博弈
关注
分享
扫一扫
文章平均质量分 61
cyendra
Azarath Metrion Zinthos
展开
-
NEFU 699 Lucky Boy 博弈?几何?
Lucky BoyTime Limit 1000msMemory Limit 65536Kdescription Recently, Lur have a good luck. He is also the cleverest boy in his school as he cre原创 2013-05-05 20:18:54 · 1217 阅读 · 1 评论 -
URAL 1023 Buttons 博弈
当K是L+1的倍数时，先手必败。又因为L>=2，特殊考虑2*p的数据。--------#include #include using namespace std;int main(){ int K,i,L; while (cin>>K){ for (i=3;i<=(int)sqrt(K);i++){ if (K%i==0)原创 2014-01-13 20:37:47 · 1138 阅读 · 0 评论