作者davidpanda (panda)
看板b97902HW
標題[情報] 使徒三出來了
時間Mon Sep 29 13:33:30 2008
如題
聽說使徒三難度是使徒二的很多倍??
大家有空去看看吧
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.229.67.124
1F：推 godgunman:早就出來了 只是IO還沒有@@ 09/29 13:36
2F：推 sa072686:我覺得我看不懂題目 09/29 13:37
3F：→ godgunman:沒有sample配合我也看不太懂 09/29 13:38
4F：推 gaga19900329:看不懂+1= = 09/29 13:50
5F：推 pangfeng:array還沒敎所以沒辦法弄很難,請等使徒四. 09/29 13:54
6F：推 anfranion:好像又是simulation? 09/29 13:57
7F：推 jimmyken793:應該還是模擬硬解吧 09/29 14:03
8F：推 applerman:if two resistance is the same what would it happen?? 09/29 15:43
9F：推 pangfeng:select the one from the north in clockwise order. 09/29 16:35
10F：推 applerman:how precise the pi should be assigned?? 09/29 19:57
11F：→ applerman:and ...will T%dt==0??sorry for too many questions>< 09/29 20:01
12F：→ davidpanda:嗯....這邊有規定要用英文嗎?? 09/29 21:04
13F：推 benck:看到上面一句...我笑....T%dt應該要是0吧...?? 09/29 21:15
14F：推 benck:pi 應該是直接引用M_PI就可以了...吧? 09/29 21:21
15F：推 ckclark:用M_PI compile不會過哦 請用3.14159265358979323846 09/30 01:35
16F：推 sa072686:2.0 * acos(0.0)呢？ 09/30 01:38
17F：推 ming1053:樓上的應該是正解吧 09/30 01:43
18F：推 ckclark:還有 4 * atan(1) 不過反正double極限就到這邊 背起來也可 09/30 01:45
19F：推 godgunman:我用小算盤的pi可以過 09/30 21:23
20F：推 LoganChien:const double PI = acos(-1); // 僅供參考 10/01 22:44