摘要： 1 LL Ex_GCD(LL a,LL b,LL &x,LL& y) 2 { 3 if(b==0) 4 { 5 x=1; 6 y=0; 7 return a; 8 } 9 LL g=Ex_GCD(b,a%b,x,y);... 阅读全文

摘要： 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 const int maxn = 1e6; 8 bitset prime; 9 10 void init()11 {12 int ... 阅读全文

摘要： A simple problemAccepted : 30Submit : 303Time Limit : 15000 MSMemory Limit : 655360 KBProblem DescriptionThere is a simple problem. Given a number N. ... 阅读全文

摘要： So Easy!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2026Accepted Submission(s): 624Problem Des... 阅读全文

摘要： Interesting FibonacciTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 665Accepted Submission(s): 11... 阅读全文

摘要： http://acdream.info/problem?pid=1093女神的正多面体Time Limit:2000/1000 MS (Java/Others)Memory Limit:128000/64000 KB (Java/Others)SubmitStatisticNext ProblemP... 阅读全文

摘要： 1120.机器人走方格V3基准时间限制：1秒 空间限制：65536KB 分值:160N * N的方格，从左上到右下画一条线。一个机器人从左上走到右下，只能向右或向下走。并要求只能在这条线的上面或下面走，不能穿越这条线，有多少种不同的走法？由于方法数量可能很大，只需要输出Mod 10007的结果。In... 阅读全文

摘要： E. Elegant StringTime Limit:1000msCase Time Limit:1000msMemory Limit:65536KB64-bit integer IO format:%lld Java class name:MainSubmitStatusPID: 34985Fo... 阅读全文

摘要： Problem APlay with Floor and CeilInput:standard inputOutput:standard outputTime Limit:1 secondTheoremFor any two integersxandkthere exists two more in... 阅读全文

摘要： Problem FMarblesInput:standard inputOutput:standard outputI have some (say,n) marbles (small glass balls) and I am going to buy some boxes to store th... 阅读全文