摘要:
Given 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x and y. Sin 阅读全文
posted @ 2017-05-08 22:13
cdongyang
阅读(268)
评论(0)
推荐(0)
摘要:
1 #include <bits/stdc++.h> 2 using namespace std; 3 typedef long long LL; 4 const int N=1e6+10; 5 const int INF=0x3f3f3f3f; 6 int cas=1,T; 7 int c[N]; 阅读全文
posted @ 2017-05-08 22:09
cdongyang
阅读(202)
评论(0)
推荐(0)
摘要:
1 #include <bits/stdc++.h> 2 using namespace std; 3 typedef long long LL; 4 void gcd(LL a, LL b, LL &d, LL &x, LL &y) 5 { 6 if (!b) 7 { 8 d = a; 9 x = 阅读全文
posted @ 2017-05-08 19:57
cdongyang
阅读(245)
评论(0)
推荐(0)
摘要:
1 #include <bits/stdc++.h> 2 using namespace std; 3 int p,x,y,a[26]; 4 bool init(int s) 5 { 6 int i=s/50%475; 7 for (int j=0;j<25;j++) 8 { 9 i=(i*96+4 阅读全文
posted @ 2017-05-08 14:51
cdongyang
阅读(339)
评论(0)
推荐(0)

浙公网安备 33010602011771号