摘要: const int mod=1e9+7; typedef long long ll; //返回d=gcd(a,b);和对应于等式ax+by=d中的x,y ll extend_gcd(ll a,ll b,ll &x,ll &y) { if(a==0&&b==0) return -1;//无最大公约数 if(b==0){x=1;y=0;return a;} ll d=exte... 阅读全文
posted @ 2016-03-26 20:41 lucky_少哖 阅读(462) 评论(0) 推荐(0)
摘要: "红色病毒"问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5562 Accepted Submission(s): 2323 Proble 阅读全文
posted @ 2016-03-26 11:21 lucky_少哖 阅读(585) 评论(0) 推荐(0)
摘要: Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25414 Accepted Submission(s): 12686 P 阅读全文
posted @ 2016-03-26 11:11 lucky_少哖 阅读(142) 评论(0) 推荐(0)