fyfcauc的专栏

//132K 110MS C++ #include #include using namespace std; int N; long long cnt; void solve(int N) { int begin = 1; int end = 1; long long sum = 1; while(1) { if (begin == N) { if (sum =

//144K 0MS C++ #include #include #include int gcd(int a, int b) { if (b == 0) { return a; } else if (a > b) { return gcd(b, a%b); } else { return gcd(a, b%a);