摘要：Yet another end of the worldTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 920Accepted Submission... 阅读全文

摘要：好久没来写blog了，不能颓了。这道题的数据范围很小，n#include#include#includeusing namespace std;int num[100], n;string s;int gcd(int a, int b){ return b ? gcd(b, a % b) : ... 阅读全文

摘要：题目大意： 就是说，给你两个起始的x和y，然后x每次增加m，y每次增加n，以及长度L，求出最小的变化次数T,有(x+m*T)-(y+n*T)==P*L.解题思路： 裸裸的扩展欧几里得。 分析：假设跳了T次以后，青蛙1的坐标便是x+m*T,青蛙2的坐标为y+n*T。它们能够相遇的情况为（x+m*... 阅读全文

摘要：294 DivisorsMathematicians love all sorts of odd properties of numbers. For instance, they consider 945 to be aninteresting number, since it is the r... 阅读全文

摘要：Problem AAlmost Prime NumbersTime Limit: 1 secondAlmost prime numbers are the non-prime numbers which are divisible by only a single prime number. In ... 阅读全文