problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 1)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 915,734 | 915,733 | u313578168 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 915,732 | 915,735 | u313578168 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 1)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int A, B, K, c, i;
cin >> A >> B >> K;
c = gcd(A, B);
for (i = c; i >= 1; i--) {
if (c % i == 0) {
K--;
}
if (K == 0) {
break;
}
}
cout << i << endl;
return 0;
} | [] | 915,734 | 915,735 | u313578168 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
static void ABC120D_DecayedBridges();
static void ABC119C_SyntheticKadomatsu();
static void ABC120B_KthCommonDivisor();
#if 1
int main() {
// ABC120D_DecayedBridges();
// ABC119C_SyntheticKadomatsu();
ABC120B_KthCommonDivisor();
fflush(stdout);
return 0;
}
#endif
static void ABC120B_KthCommonDivisor() {
int A = 0, B = 0, K = 0;
scanf(" %d %d %d", &A, &B, &K);
int target = 1;
int count = 0;
while (1) {
if (((A % target) == 0) && ((B % target) == 0)) {
count++;
if (count == K) {
break;
}
}
target++;
}
printf("%d\n", target);
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
static void ABC120D_DecayedBridges();
static void ABC119C_SyntheticKadomatsu();
static void ABC120B_KthCommonDivisor();
#if 1
int main() {
// ABC120D_DecayedBridges();
// ABC119C_SyntheticKadomatsu();
ABC120B_KthCommonDivisor();
fflush(stdout);
return 0;
}
#endif
static void ABC120B_KthCommonDivisor() {
int A = 0, B = 0, K = 0;
scanf(" %d %d %d", &A, &B, &K);
int target = 100;
int count = 0;
while (1) {
if (((A % target) == 0) && ((B % target) == 0)) {
count++;
if (count == K) {
break;
}
}
target--;
}
printf("%d\n", target);
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 915,745 | 915,746 | u887675488 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int A, B, K;
vector<int> ans;
cin >> A >> B >> K;
for (int i = 1; i < A; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[K - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int A, B, K;
vector<int> ans;
cin >> A >> B >> K;
for (int i = 1; i <= A; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[K - 1] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,747 | 915,748 | u574045761 | cpp |
p03106 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int count = 0, res = 1;
for (int i = min(a, b); i != 1; i--) {
if (a % i == 0 && b % i == 0) {
count++;
res = i;
}
if (count == k)
break;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int count = 0, res = 1;
for (int i = min(a, b); i != 0; i--) {
if (a % i == 0 && b % i == 0) {
count++;
res = i;
}
if (count == k)
break;
}
cout << res << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,785 | 915,786 | u598382605 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> result;
if (A >= B) {
for (int i = B; i > 0; i--) {
if (A % i == 0 && B % i == 0) {
result.push_back(i);
}
}
cout << result[K];
}
if (B > A) {
for (int j = A; j > 0; j--) {
if (B % j == 0 && A % j == 0) {
result.push_back(j);
}
}
cout << result[K];
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> result;
if (A >= B) {
for (int i = B; i > 0; i--) {
if (A % i == 0 && B % i == 0) {
result.push_back(i);
}
}
cout << result[K - 1];
}
if (B > A) {
for (int j = A; j > 0; j--) {
if (B % j == 0 && A % j == 0) {
result.push_back(j);
}
}
cout << result[K - 1];
}
return 0;
} | [
"expression.operation.binary.add"
] | 915,787 | 915,788 | u464725395 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, l;
cin >> a >> b >> k;
if (a > b)
l = a;
else
l = b;
int youjo[101];
int i, j = 0;
for (i = 1; i <= l; i++) {
if (a % i == 0 && b % i == 0) {
youjo[j] = i;
j++;
}
}
cout << youjo[k - 1] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, k, l;
cin >> a >> b >> k;
if (a < b)
l = a;
else
l = b;
int youjo[100];
int i, j = 0;
for (i = 1; i <= l; i++) {
if (a % i == 0 && b % i == 0) {
youjo[j] = i;
j++;
}
}
cout << youjo[j - k] << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.... | 915,801 | 915,802 | u554899240 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, l;
cin >> a >> b >> k;
if (a > b)
l = a;
else
l = b;
int youjo[100];
int i, j = 0;
for (i = 1; i <= l; i++) {
if (a % i == 0 && b % i == 0) {
youjo[j] = i;
j++;
}
}
cout << youjo[k - 1] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, k, l;
cin >> a >> b >> k;
if (a < b)
l = a;
else
l = b;
int youjo[100];
int i, j = 0;
for (i = 1; i <= l; i++) {
if (a % i == 0 && b % i == 0) {
youjo[j] = i;
j++;
}
}
cout << youjo[j - k] << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,803 | 915,802 | u554899240 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,830 | 915,831 | u317715099 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, cnt = 0;
cin >> a >> b;
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, cnt = 0;
cin >> a >> b >> k;
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
}
| [
"expression.operation.binary.add"
] | 915,834 | 915,835 | u401900157 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i < max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i <= max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,844 | 915,845 | u554965736 | cpp |
p03106 | #include <iostream>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int min;
if (a > b)
min = b;
else
min = a;
int c(0);
for (int i(1); i <= min; i++) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
cout << i << endl;
break;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int min;
if (a > b)
min = b;
else
min = a;
int c(0);
for (int i(min); i >= 1; i--) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
cout << i << endl;
break;
}
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 915,854 | 915,855 | u144692457 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
int i = 0;
while (count != k) {
i++;
if (a % i == 0 && b % i == 0)
count++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
int i = a + 1;
while (count != k) {
i--;
if (a % i == 0 && b % i == 0)
count++;
}
cout << i << endl;
} | [
"identifier.replace.add",
"literal.replace.remove"
] | 915,858 | 915,859 | u544165468 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 1, num = 0;
while (true) {
if (A % i == 0 && B % i == 0) {
num++;
}
if (num >= K)
break;
}
cout << i << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = A, num = 0;
while (true) {
if (A % i == 0 && B % i == 0) {
num++;
}
if (num >= K)
break;
i--;
}
cout << i << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.unary.arithmetic.add"
] | 915,884 | 915,885 | u570417673 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);
while (count < K) {
if (A % i > 0 && B % i > 0) {
count++;
}
i--;
}
cout << i + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);
while (count < K) {
if (A % i == 0 && B % i == 0) {
count++;
}
i--;
}
cout << i + 1 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 915,888 | 915,889 | u408053343 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _lcint;
#define REP(i, n) for (_lcint i = 0; i < n; i++)
#define FOR(i, a, b) for (_lcint i = (_lcint)(a); i < (_lcint)(b); i++)
#define FORREV(i, a, b) for (_lcint i = (_lcint)(b)-1; i >= (_lcint)(a); i--)
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ": "; \
REP(i, v.size()) cout << " " << v[i] << endl;
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
struct Info {
ll A, B;
};
bool operator<(const Info &left, const Info &right) { return left.A < right.A; }
unsigned long long XOR(unsigned long long A, unsigned long long B) {
return A ^ B;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = max(A, B);
FORREV(i, 1, m) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0) {
cout << i << endl;
return 0;
}
}
}
cout << 1 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _lcint;
#define REP(i, n) for (_lcint i = 0; i < n; i++)
#define FOR(i, a, b) for (_lcint i = (_lcint)(a); i < (_lcint)(b); i++)
#define FORREV(i, a, b) for (_lcint i = (_lcint)(b)-1; i >= (_lcint)(a); i--)
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ": "; \
REP(i, v.size()) cout << " " << v[i] << endl;
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
struct Info {
ll A, B;
};
bool operator<(const Info &left, const Info &right) { return left.A < right.A; }
unsigned long long XOR(unsigned long long A, unsigned long long B) {
return A ^ B;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = min(A, B);
FORREV(i, 1, m + 1) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0) {
cout << i << endl;
return 0;
}
}
}
cout << 1 << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 915,903 | 915,904 | u681358160 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt = k) {
cout << i << endl;
break;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 915,916 | 915,917 | u139251862 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt = k) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 915,918 | 915,917 | u139251862 | cpp |
p03106 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0; //今までみつかった数
for (int i = min(A, B); i >= 1; i--) {
if (A & i == 0 && B & i == 0) {
cnt++;
if (cnt == K) {
cout << i << endl;
return 0;
}
}
}
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0; //今までみつかった数
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K) {
cout << i << endl;
return 0;
}
}
}
} | [
"control_flow.branch.if.condition.change"
] | 915,938 | 915,939 | u654115954 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans;
int i = 50;
int count = 0;
while (true) {
if (a % i == 0 && b % i == 0) {
ans = i;
count++;
}
i--;
if (count == k)
break;
if (i == 0)
break;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans;
int i = 100;
int count = 0;
while (true) {
if (a % i == 0 && b % i == 0) {
ans = i;
count++;
}
i--;
if (count == k)
break;
if (i == 0)
break;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 915,942 | 915,943 | u119013542 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, num;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && A % i == 0) {
num = i;
K--;
}
if (K == 0)
break;
}
cout << num;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, num;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && B % i == 0) {
num = i;
K--;
}
if (K == 0)
break;
}
cout << num;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 915,946 | 915,947 | u377032133 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 1;; i++) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
cout << i;
break;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100;; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
cout << i;
break;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 915,965 | 915,966 | u901678655 | cpp |
p03106 | #include <iostream>
using namespace std;
void func(int, int, int);
void swap(int &, int &);
int euclidean(int, int);
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c == 1) {
cout << c << "\n";
return 0;
}
func(a, b, c);
return 0;
}
void func(int a, int b, int c) {
int n = euclidean(a, b);
// cout << n << "\n";
if (n == 1) {
cout << 1 << "\n";
return;
}
// cout << n << "\n";
int count = 1;
for (int i = n - 1;; i--) {
if (i == 0) {
cout << 1 << "\n";
return;
}
if (n % i == 0) {
// cout << i << "\n";
count++;
if (count == c) {
cout << i << "\n";
return;
}
}
}
}
int euclidean(int a, int b) {
if (a < b)
swap(a, b);
int r;
while ((r = a % b) != 0) {
if (r == 1)
return 1;
// cout << a << "," << b << "," << r << "," << "\n" ;
a = b;
b = r;
}
return b;
}
void swap(int &a, int &b) {
int tmp = a;
a = b;
b = tmp;
} | #include <iostream>
using namespace std;
void func(int, int, int);
void swap(int &, int &);
int euclidean(int, int);
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c == 1) {
cout << euclidean(a, b) << "\n";
return 0;
}
func(a, b, c);
return 0;
}
void func(int a, int b, int c) {
int n = euclidean(a, b);
// cout << n << "\n";
if (n == 1) {
cout << 1 << "\n";
return;
}
// cout << n << "\n";
int count = 1;
for (int i = n - 1;; i--) {
if (i == 0) {
cout << 1 << "\n";
return;
}
if (n % i == 0) {
// cout << i << "\n";
count++;
if (count == c) {
cout << i << "\n";
return;
}
}
}
}
int euclidean(int a, int b) {
if (a < b)
swap(a, b);
int r;
while ((r = a % b) != 0) {
if (r == 1)
return 1;
// cout << a << "," << b << "," << r << "," << "\n" ;
a = b;
b = r;
}
return b;
}
void swap(int &a, int &b) {
int tmp = a;
a = b;
b = tmp;
} | [
"io.output.change",
"call.arguments.add"
] | 915,976 | 915,977 | u919044297 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int X = min(A, B);
vector<int> Y; //数の宣言なし
for (int i = 0; i <= X; i++) {
if (A % i == 0 && B % i == 0) {
Y.push_back(i);
}
}
reverse(Y.begin(), Y.end());
cout << Y[K - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int X = min(A, B);
vector<int> Y; //数の宣言なし
for (int i = 1; i <= X; i++) {
if (A % i == 0 && B % i == 0) {
Y.push_back(i);
}
}
reverse(Y.begin(), Y.end());
cout << Y[K - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 915,978 | 915,979 | u644100188 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll int64_t
const long mod = 1e9 + 7;
const long LINF = 1e13;
const long LLINF = 1e18;
const long ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
//最大公約数
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
} // gcd
//最小公倍数
int lcm(int m, int n) { // 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
} // lcm
int main() {
long a, b, k;
cin >> a >> b >> k;
long ans = 0;
long count = 0;
vector<long> stock;
for (int i = 1; i < max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
count++;
stock.push_back(i);
}
}
ans = stock[stock.size() - k];
cout << ans;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll int64_t
const long mod = 1e9 + 7;
const long LINF = 1e13;
const long LLINF = 1e18;
const long ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
//最大公約数
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
} // gcd
//最小公倍数
int lcm(int m, int n) { // 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
} // lcm
int main() {
long a, b, k;
cin >> a >> b >> k;
long ans = 0;
long count = 0;
vector<long> stock;
for (int i = 1; i <= max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
count++;
stock.push_back(i);
}
}
ans = stock[stock.size() - k];
cout << ans;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,980 | 915,981 | u134810655 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K, i, j = 0, a, b[100];
cin >> A >> B >> K;
if (A > B) {
a = A;
A = B;
B = a;
}
for (i = 1; i < B; i++) {
if (A % i == 0 && B % i == 0) {
b[j] = i;
j++;
}
}
cout << b[j - K];
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K, i, j = 0, a, b[100];
cin >> A >> B >> K;
if (A > B) {
a = A;
A = B;
B = a;
}
for (i = 1; i <= A; i++) {
if (A % i == 0 && B % i == 0) {
b[j] = i;
j++;
}
}
cout << b[j - K];
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 915,984 | 915,985 | u517786923 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div;
int count = 0;
for (int i = 1;; i++) {
if (A % i == 0 && B % i == 0)
count++;
if (count == K) {
div = i;
break;
}
}
cout << div;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div;
int count = 0;
for (int i = A;; i--) {
if (A % i == 0 && B % i == 0)
count++;
if (count == K) {
div = i;
break;
}
}
cout << div;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 915,986 | 915,987 | u740232619 | cpp |
p03106 | // Author: Wenxing Mei
// File: b.cpp
// Date: 2019-03-11 22:42
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define per(i, b, a) for (int i = (int)b - 1; i >= (int)a; --i)
#define repv(ele, cont) for (auto &ele : cont)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
// END OF TEMPLATE
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
int a, b, k;
cin >> a >> b >> k;
if (a > b)
swap(a, b);
int n = 0;
per(i, a, 1) {
if (a % i == 0 && b % i == 0)
++n;
if (n == k) {
cout << i << endl;
exit(0);
}
}
return 0;
}
| // Author: Wenxing Mei
// File: b.cpp
// Date: 2019-03-11 22:42
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define per(i, b, a) for (int i = (int)b; i >= (int)a; --i)
#define repv(ele, cont) for (auto &ele : cont)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
// END OF TEMPLATE
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
int a, b, k;
cin >> a >> b >> k;
if (a > b)
swap(a, b);
int n = 0;
per(i, a, 1) {
if (a % i == 0 && b % i == 0)
++n;
if (n == k) {
cout << i << endl;
exit(0);
}
}
return 0;
}
| [] | 915,996 | 915,997 | u512241683 | cpp |
p03106 | // Author: Wenxing Mei
// File: b.cpp
// Date: 2019-03-11 22:42
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define per(i, b, a) for (int i = (int)b - 1; i >= (int)a; --i)
#define repv(ele, cont) for (auto &ele : cont)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
// END OF TEMPLATE
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
int a, b, k;
cin >> a >> b >> k;
if (a > b)
swap(a, b);
int n = 0;
rep(i, 1, a + 1) {
if (a % i == 0 && b % i == 0)
++n;
if (n == k) {
cout << i << endl;
exit(0);
}
}
return 0;
}
| // Author: Wenxing Mei
// File: b.cpp
// Date: 2019-03-11 22:42
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define per(i, b, a) for (int i = (int)b; i >= (int)a; --i)
#define repv(ele, cont) for (auto &ele : cont)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
// END OF TEMPLATE
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
int a, b, k;
cin >> a >> b >> k;
if (a > b)
swap(a, b);
int n = 0;
per(i, a, 1) {
if (a % i == 0 && b % i == 0)
++n;
if (n == k) {
cout << i << endl;
exit(0);
}
}
return 0;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 915,998 | 915,997 | u512241683 | cpp |
p03106 | #include <iostream>
using std::cin;
using std::cout;
int A, B, K;
auto main() -> int {
cin >> A >> B >> K;
unsigned int checkNum = (A < B ? A : B);
unsigned int count = 0;
int ans = 1;
while (count != K && checkNum != 1) {
if ((A % checkNum) == 0) {
if ((B % checkNum) == 0) {
ans = checkNum;
++count;
}
}
--checkNum;
}
cout << ans << '\n';
return 0;
}
| #include <iostream>
using std::cin;
using std::cout;
int A, B, K;
auto main() -> int {
cin >> A >> B >> K;
unsigned int checkNum = (A < B ? A : B);
unsigned int count = 0;
int ans = 1;
while (count != K && checkNum != 0) {
if ((A % checkNum) == 0) {
if ((B % checkNum) == 0) {
ans = checkNum;
++count;
}
}
--checkNum;
}
cout << ans << '\n';
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 916,004 | 916,005 | u604446158 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = max(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K) {
break;
}
}
}
cout << cnt;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = max(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K) {
cnt = i;
break;
}
}
}
cout << cnt;
}
| [
"assignment.add"
] | 916,015 | 916,016 | u873627575 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m, k = 1;
cin >> a >> b >> m;
for (int i = min(a, b); i != 0; i--) {
if (a % i == 0 && b & i == 0) {
if (k == m) {
cout << i << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m, k = 1;
cin >> a >> b >> m;
for (int i = min(a, b); i != 0; i--) {
if (a % i == 0 && b % i == 0) {
if (k == m) {
cout << i << endl;
return 0;
}
k += 1;
}
}
}
| [
"control_flow.branch.if.condition.change",
"assignment.add"
] | 916,025 | 916,026 | u577552796 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int minNum = A > B ? B : A;
int count = 1;
for (int d = minNum; d > 0; d--) {
if (A % d == 0 && B % d == 0) {
if (count == K) {
cout << A % d;
break;
}
}
count++;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int minNum = A > B ? B : A;
int count = 1;
for (int d = minNum; d > 0; d--) {
if (A % d == 0 && B % d == 0) {
if (count == K) {
cout << d;
break;
}
count++;
}
}
return 0;
} | [
"expression.operation.binary.remove"
] | 916,064 | 916,065 | u137384669 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vector<long long> const &numbers,
string const &str) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += str;
result += to_string(numbers[i]);
}
return result;
}
//空白で区切る為のオーバーロード
static string MakeString_LongLong(vector<long long> const &numbers) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += " ";
result += to_string(numbers[i]);
}
return result;
}
//文字列の配列を改行を挟んでまとめる
static string MakeString_VectorString(vector<string> const &str) {
string result = "";
for (long long i = 0; i < str.size(); i++) {
result += str[i] + "\n";
}
return result;
}
//文字列を必要な個数だけ読み取る
static vector<string> MyReadLineSplit(LL n) {
vector<string> str(n);
for (long long i = 0; i < n; i++) {
std::cin >> str[i];
}
return str;
}
//数値を必要な個数だけ読み取る
static vector<long long> ReadInts(long long number) {
vector<long long> a(number);
for (int i = 0; i < number; i++) {
std::cin >> a[i];
}
return a;
}
//渡された自然数が素数ならtureを返す
static bool PrimeCheck_Int(long long number) {
if (number < 2)
return false;
for (ULL i = 2; i * i <= number; i++) {
if (number % i == 0)
return false;
}
return true;
}
//渡された数値以下の素数表を作る
static vector<long long> MakePrimeList(long long n) {
vector<long long> list;
LL i, j, p;
bool flag;
for (i = 2; i <= n; i++) {
flag = true;
for (j = 0; j < list.size(); j++) {
if (!(list[j] * list[j] <= i))
break;
if (i % list[j] == 0) {
flag = false;
break;
}
}
if (flag)
list.push_back(i);
}
return list;
}
//文字列の分割
static vector<string> split(string const &str, char sep) {
vector<std::string> v; // 分割結果を格納するベクター
auto first = str.begin(); // テキストの最初を指すイテレータ
while (first != str.end()) { // テキストが残っている間ループ
auto last = first; // 分割文字列末尾へのイテレータ
while (last != str.end() &&
*last != sep) // 末尾 or セパレータ文字まで進める
last++;
v.push_back(string(first, last)); // 分割文字を出力
if (last != str.end())
last++;
first = last; // 次の処理のためにイテレータを設定
}
return v;
}
//合計を求める
static LL Sum(vector<LL> a) {
LL i, sum = 0;
for (i = 0; i < a.size(); i++) {
sum += a[i];
}
return sum;
}
//小文字ならtrueを返す
static bool Komoji(char a) {
if (a >= 'a' && a <= 'z')
return true;
return false;
}
//大文字ならtrueを返す
static bool Oomoji(char a) {
if (a >= 'A' && a <= 'Z')
return true;
return false;
}
static LL GreatestCommonFactor(LL a, LL b) {
LL temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
while (true) {
temp = a % b;
a = b;
b = temp;
if (b == 0)
break;
}
return a;
}
static LL LeastCommonMultiple(LL a, LL b) {
return (a / GreatestCommonFactor(a, b)) * b;
}
};
//累積和を求めるクラス
class Syakutori {
private:
vector<LL> list;
public:
void MakeArray(vector<LL> data) {
LL i;
list = data;
list.push_back(0);
list[0] = 0;
for (i = 1; i < list.size(); i++) {
list[i] = list[i - 1] + data[i - 1];
}
}
LL Sum(LL start, LL end) {
if (end < start) {
cout << "startがendより大きいです";
return 0;
}
if (start < 0 || end >= list.size()) {
cout << "範囲が異常";
return 0;
}
return list[end] - list[start];
}
};
string strnum = "0123456789";
string alpS = "abcdefghijklmnopqrstuvwxyz";
string alpL = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int sizealp = (int)(alpS.size());
int mod = 1e9 + 7;
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define PAI 3.1415926535
string atc = "atcoder";
int main(void) {
int count = 0;
int sum = 0;
int flag = 0;
int a, b, k;
cin >> a >> b >> k;
for (int i = a; i <= a && i <= b; i--) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
cout << i << endl;
return 0;
}
}
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vector<long long> const &numbers,
string const &str) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += str;
result += to_string(numbers[i]);
}
return result;
}
//空白で区切る為のオーバーロード
static string MakeString_LongLong(vector<long long> const &numbers) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += " ";
result += to_string(numbers[i]);
}
return result;
}
//文字列の配列を改行を挟んでまとめる
static string MakeString_VectorString(vector<string> const &str) {
string result = "";
for (long long i = 0; i < str.size(); i++) {
result += str[i] + "\n";
}
return result;
}
//文字列を必要な個数だけ読み取る
static vector<string> MyReadLineSplit(LL n) {
vector<string> str(n);
for (long long i = 0; i < n; i++) {
std::cin >> str[i];
}
return str;
}
//数値を必要な個数だけ読み取る
static vector<long long> ReadInts(long long number) {
vector<long long> a(number);
for (int i = 0; i < number; i++) {
std::cin >> a[i];
}
return a;
}
//渡された自然数が素数ならtureを返す
static bool PrimeCheck_Int(long long number) {
if (number < 2)
return false;
for (ULL i = 2; i * i <= number; i++) {
if (number % i == 0)
return false;
}
return true;
}
//渡された数値以下の素数表を作る
static vector<long long> MakePrimeList(long long n) {
vector<long long> list;
LL i, j, p;
bool flag;
for (i = 2; i <= n; i++) {
flag = true;
for (j = 0; j < list.size(); j++) {
if (!(list[j] * list[j] <= i))
break;
if (i % list[j] == 0) {
flag = false;
break;
}
}
if (flag)
list.push_back(i);
}
return list;
}
//文字列の分割
static vector<string> split(string const &str, char sep) {
vector<std::string> v; // 分割結果を格納するベクター
auto first = str.begin(); // テキストの最初を指すイテレータ
while (first != str.end()) { // テキストが残っている間ループ
auto last = first; // 分割文字列末尾へのイテレータ
while (last != str.end() &&
*last != sep) // 末尾 or セパレータ文字まで進める
last++;
v.push_back(string(first, last)); // 分割文字を出力
if (last != str.end())
last++;
first = last; // 次の処理のためにイテレータを設定
}
return v;
}
//合計を求める
static LL Sum(vector<LL> a) {
LL i, sum = 0;
for (i = 0; i < a.size(); i++) {
sum += a[i];
}
return sum;
}
//小文字ならtrueを返す
static bool Komoji(char a) {
if (a >= 'a' && a <= 'z')
return true;
return false;
}
//大文字ならtrueを返す
static bool Oomoji(char a) {
if (a >= 'A' && a <= 'Z')
return true;
return false;
}
static LL GreatestCommonFactor(LL a, LL b) {
LL temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
while (true) {
temp = a % b;
a = b;
b = temp;
if (b == 0)
break;
}
return a;
}
static LL LeastCommonMultiple(LL a, LL b) {
return (a / GreatestCommonFactor(a, b)) * b;
}
};
//累積和を求めるクラス
class Syakutori {
private:
vector<LL> list;
public:
void MakeArray(vector<LL> data) {
LL i;
list = data;
list.push_back(0);
list[0] = 0;
for (i = 1; i < list.size(); i++) {
list[i] = list[i - 1] + data[i - 1];
}
}
LL Sum(LL start, LL end) {
if (end < start) {
cout << "startがendより大きいです";
return 0;
}
if (start < 0 || end >= list.size()) {
cout << "範囲が異常";
return 0;
}
return list[end] - list[start];
}
};
string strnum = "0123456789";
string alpS = "abcdefghijklmnopqrstuvwxyz";
string alpL = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int sizealp = (int)(alpS.size());
int mod = 1e9 + 7;
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define PAI 3.1415926535
string atc = "atcoder";
int main(void) {
int count = 0;
int sum = 0;
int flag = 0;
int a, b, k;
cin >> a >> b >> k;
for (int i = min(a, b); i <= a && i <= b; i--) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
cout << i << endl;
return 0;
}
}
}
| [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 916,090 | 916,091 | u196798307 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == k) {
cout << cnt << endl;
return 0;
}
}
}
} | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == k) {
cout << i << endl;
return 0;
}
}
}
} | [
"identifier.change",
"io.output.change"
] | 916,098 | 916,099 | u666683460 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
signed main() {
int a, b;
cin >> a >> b;
vector<int> x;
for (int i = 1; i <= 100; i++)
if (a % i == 0 && b % i == 0)
x.pb(i);
int k;
cin >> k;
cout << x[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
signed main() {
int a, b;
cin >> a >> b;
vector<int> x;
for (int i = 1; i <= 100; i++)
if (a % i == 0 && b % i == 0)
x.pb(i);
int k;
cin >> k;
cout << x[x.size() - k] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,104 | 916,105 | u685892567 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"expression.operation.binary.add"
] | 916,120 | 916,121 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,122 | 916,121 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,123 | 916,121 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"call.arguments.change"
] | 916,120 | 916,125 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,122 | 916,125 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
reverse(v1.begin(), v1.end());
// REP(i, cnt){cout << v1[i] << endl;}
cout << v1[k - 1];
return 0;
} | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,123 | 916,125 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | [
"expression.operation.binary.add"
] | 916,120 | 916,126 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,122 | 916,126 | u509680664 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i < whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* REPmacro */
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
/*alias*/
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
/*using*/
using ll = long long;
using ull = unsigned long long;
using unsi = unsigned;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using db = double;
using plex = complex<double>;
using vs = vector<string>;
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
/*struct*/
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const db EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
//#define int ll
//#define int long long
signed main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
vi v1(0, 0);
int whi = max(a, b);
for (int i = 1; i <= whi; ++i) {
if (a % i == 0 && b % i == 0) {
v1.PB(i);
++cnt;
}
}
/*for(int i = 1; i <= whi; ++i){
cout << a%i;
cout << b%i << endl;
}*/
// REP(i, cnt){cout << v1[i] << endl;}
reverse(v1.begin(), v1.end());
cout << v1[k - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,123 | 916,126 | u509680664 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (a).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
ll sumDigit(ll N) {
ll sum = 0;
for (ll i = 1; i <= N; i *= 10) {
sum += (N % (i * 10)) / i;
}
return sum;
}
signed main() {
llin(A);
llin(B);
llin(K);
ll m = min(A, B);
ll ctr = 0;
FOR(i, 1, m) {
if (A % i == 0 || B % i == 0) {
ctr++;
}
if (ctr == K) {
echo(i);
return 0;
}
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (a).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
ll sumDigit(ll N) {
ll sum = 0;
for (ll i = 1; i <= N; i *= 10) {
sum += (N % (i * 10)) / i;
}
return sum;
}
signed main() {
llin(A);
llin(B);
llin(K);
ll m = min(A, B);
ll ctr = 0;
rFOR(i, 1, m) {
if (A % i == 0 && B % i == 0) {
ctr++;
}
if (ctr == K) {
echo(i);
return 0;
}
}
}
| [
"identifier.change",
"call.function.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 916,138 | 916,139 | u127844950 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (a).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
ll sumDigit(ll N) {
ll sum = 0;
for (ll i = 1; i <= N; i *= 10) {
sum += (N % (i * 10)) / i;
}
return sum;
}
signed main() {
llin(A);
llin(B);
llin(K);
ll m = min(A, B);
ll ctr = 0;
FOR(i, 1, m) {
if (A % i == 0 && B % i == 0) {
ctr++;
}
if (ctr == K) {
echo(i);
return 0;
}
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (a).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
ll sumDigit(ll N) {
ll sum = 0;
for (ll i = 1; i <= N; i *= 10) {
sum += (N % (i * 10)) / i;
}
return sum;
}
signed main() {
llin(A);
llin(B);
llin(K);
ll m = min(A, B);
ll ctr = 0;
rFOR(i, 1, m) {
if (A % i == 0 && B % i == 0) {
ctr++;
}
if (ctr == K) {
echo(i);
return 0;
}
}
}
| [
"identifier.change",
"call.function.change"
] | 916,140 | 916,139 | u127844950 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, count, i;
cin >> A >> B >> K;
count = 0;
i = 0;
while (count < K) {
i++;
if (A % i == 0 && B % i == 0) {
count++;
}
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, count, i;
cin >> A >> B >> K;
count = 0;
i = 200;
while (count < K) {
i--;
if (A % i == 0 && B % i == 0) {
count++;
}
}
cout << i << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 916,144 | 916,143 | u808593466 | cpp |
p03106 | #include <stdio.h>
int main() {
int a, b, x, k, i, j = 0, m;
scanf("%d%d%d/n", &a, &b, &k);
if (a > b) {
m = b;
b = a;
a = m;
}
x = b % a;
while (x != 0) {
b = a;
a = x;
x = b % a;
}
for (i = a; j < k; i--) {
if (a % i == 0) {
j++;
}
}
printf("%d", i);
return 0;
} | #include <stdio.h>
int main() {
int a, b, x, k, i, j = 0, m;
scanf("%d%d%d/n", &a, &b, &k);
if (a > b) {
m = b;
b = a;
a = m;
}
x = b % a;
while (x != 0) {
b = a;
a = x;
x = b % a;
}
for (i = a; j < k; i--) {
if (a % i == 0) {
j++;
}
}
printf("%d", i + 1);
return 0;
} | [
"expression.operation.binary.add"
] | 916,151 | 916,152 | u433204705 | cpp |
p03106 | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int k = 0;
int d = 0;
while (k < K) {
d++;
if (A % d == 0 && B % d == 0)
k++;
}
cout << d << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int k = 0;
int d = 101;
while (k < K) {
d--;
if (A % d == 0 && B % d == 0)
k++;
}
cout << d << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 916,157 | 916,158 | u898331860 | cpp |
p03106 | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int64, int64>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 3e5 + 1;
// init/input
#define int int64
#define INIT \
ios::sync_with_stdio(false); \
cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC(type, c, n) \
vector<type> c(n); \
for (auto &&i : c) \
cin >> i;
// out
#define OUT(dist) cout << (dist);
#define FOUT(n, dist) cout << fixed << setprecision(n) << (dist);
#define SP cout << " ";
#define BR cout << endl;
#define zero(n) cout << setfill('0') << right << setw(n)
#define debug(x) \
cerr << #x << ":" << (x); \
BR;
// utility
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, a) for (auto &&i : (a))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
signed main() {
INIT;
VAR(int, a, b, k);
int cnt = 0;
FOR(i, 1, 1010) {
if (a % i == 0 || b % i == 0)
++cnt;
if (cnt == k) {
OUT(i) BR;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = int_fast64_t;
using PAIR = pair<int64, int64>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 3e5 + 1;
// init/input
#define int int64
#define INIT \
ios::sync_with_stdio(false); \
cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC(type, c, n) \
vector<type> c(n); \
for (auto &&i : c) \
cin >> i;
// out
#define OUT(dist) cout << (dist);
#define FOUT(n, dist) cout << fixed << setprecision(n) << (dist);
#define SP cout << " ";
#define BR cout << endl;
#define zero(n) cout << setfill('0') << right << setw(n)
#define debug(x) \
cerr << #x << ":" << (x); \
BR;
// utility
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, a) for (auto &&i : (a))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
signed main() {
INIT;
VAR(int, a, b, k);
int cnt = 0;
RFOR(i, 1, 101) {
if (a % i == 0 && b % i == 0)
++cnt;
if (cnt == k) {
OUT(i) BR;
return 0;
}
}
return 0;
}
| [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 916,178 | 916,179 | u258009780 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define Ford(i, a, b) for (int i = (a); i < (b); i++)
#define For(i, n) Ford(i, 0, n)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if ((a % i == 0) && (b % i == 0))
--k;
if (k == 0)
cout << i << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define Ford(i, a, b) for (int i = (a); i < (b); i++)
#define For(i, n) Ford(i, 0, n)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if ((a % i == 0) && (b % i == 0)) {
--k;
}
if (k == 0) {
cout << i << endl;
return 0;
}
}
}
| [] | 916,180 | 916,181 | u920863268 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
if (a > b)
swap(a, b);
int cnt = 0, i;
for (i = 1; i <= a && cnt < k; ++i)
if (!(a % i) && !(b % i))
cnt++;
printf("%d\n", i - 1);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
if (a > b)
swap(a, b);
int cnt = 0, i;
for (i = a; i >= 1 && cnt < k; --i)
if (!(a % i) && !(b % i))
cnt++;
printf("%d\n", i + 1);
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.... | 916,184 | 916,185 | u768653806 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define MOD 1000000007LL
#define INF 2000000000
#define PI 3.1415926
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx_8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy_8[] = {0, -1, -1, -1, 0, 1, 1, 1};
typedef long long ll;
template <typename T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <typename T> inline T LCM(T a, T b) {
T c = GCD(a, b);
a /= c;
return a * b;
}
template <typename T> inline T nCr(T a, T b) {
T i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
template <typename T> inline T nHr(T a, T b) { return nCr(a + b - 1, b); }
template <typename T> inline T POW(T a, T b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (a % (i + 1) == 0 and b % (i + 1) == 0)
cnt++;
if (cnt == k) {
cout << i + 1 << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define MOD 1000000007LL
#define INF 2000000000
#define PI 3.1415926
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx_8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy_8[] = {0, -1, -1, -1, 0, 1, 1, 1};
typedef long long ll;
template <typename T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <typename T> inline T LCM(T a, T b) {
T c = GCD(a, b);
a /= c;
return a * b;
}
template <typename T> inline T nCr(T a, T b) {
T i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
template <typename T> inline T nHr(T a, T b) { return nCr(a + b - 1, b); }
template <typename T> inline T POW(T a, T b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (a % (i) == 0 and b % (i) == 0)
cnt++;
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 916,186 | 916,187 | u748069390 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = abs(a - b);
for (int i = n; i >= 1; --i) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i << endl;
return 0;
}
}
} // ABC120_b. 復習. 解説参考. | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = min(a, b);
for (int i = n; i >= 1; --i) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i << endl;
return 0;
}
}
} // ABC120_b. 復習. 解説参考. | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 916,189 | 916,190 | u209767598 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i < N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i <= N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,195 | 916,196 | u189870205 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 0, cnt = 0;
while (cnt != K) {
ans++;
if (A % ans == 0 && B % ans == 0) {
cnt++;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 101, cnt = 0;
while (cnt != K) {
ans--;
if (A % ans == 0 && B % ans == 0) {
cnt++;
}
}
cout << ans;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,201 | 916,202 | u778347695 | cpp |
p03106 | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
int counter = 0;
for (i = 100; i >= 1; i--) {
if (a % i && b % i)
counter++;
if (counter == k)
break;
}
cout << i << endl;
return 0;
} | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
int counter = 0;
for (i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
counter++;
if (counter == k)
break;
}
cout << i << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 916,205 | 916,206 | u534417782 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(VECTOR) (VECTOR).begin(), (VECTOR).end()
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
if (a % b == 0)
return b;
return gcd(b, a % b);
}
//最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int num = min(a, b);
while (true) {
num--;
if (a % num == 0 && b % num == 0)
cnt++;
if (cnt == c) {
cout << num << endl;
break;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(VECTOR) (VECTOR).begin(), (VECTOR).end()
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
if (a % b == 0)
return b;
return gcd(b, a % b);
}
//最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int num = min(a, b) + 1;
while (true) {
num--;
if (a % num == 0 && b % num == 0)
cnt++;
if (cnt == c) {
cout << num << endl;
break;
}
}
return 0;
} | [
"assignment.change"
] | 916,207 | 916,208 | u285598935 | cpp |
p03106 | /*input
100 50 4
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
int mod = 1000000007;
#define PI 3.14159265
#define endl '\n'
#define debug(x) cout << #x << " = " << x << endl;
#define MAX 1501
template <typename T> T GCD(T a, T b) {
ll t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T> string toString(T a) { return to_string(a); }
template <typename T> void toInt(string s, T &x) {
stringstream str(s);
str >> x;
}
inline int add(ll a, ll b) {
a += b;
if (a < 0)
a += mod;
return a;
}
inline int sub(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
inline int mul(ll a, ll b) { return (a * 1ll * b) % mod; }
inline int pwr(ll x, ll y) {
int ans = 1 % mod;
while (y) {
if (y & 1)
ans = mul(ans, x);
x = mul(x, x);
y >>= 1;
}
return ans;
}
inline int inv(int a) { return pwr(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
for (int i = 1; i * i <= a; i++) {
if (a % i == 0) {
vec.pb(i);
if (i != a / i)
vec.pb(a / i);
}
}
sort(all(vec));
int ans = 0;
for (auto it : vec) {
if (a % it == 0 && b % it == 0) {
ans++;
}
if (ans == k) {
cout << it << endl;
break;
}
}
return 0;
}
| /*input
100 50 4
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
int mod = 1000000007;
#define PI 3.14159265
#define endl '\n'
#define debug(x) cout << #x << " = " << x << endl;
#define MAX 1501
template <typename T> T GCD(T a, T b) {
ll t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T> string toString(T a) { return to_string(a); }
template <typename T> void toInt(string s, T &x) {
stringstream str(s);
str >> x;
}
inline int add(ll a, ll b) {
a += b;
if (a < 0)
a += mod;
return a;
}
inline int sub(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
inline int mul(ll a, ll b) { return (a * 1ll * b) % mod; }
inline int pwr(ll x, ll y) {
int ans = 1 % mod;
while (y) {
if (y & 1)
ans = mul(ans, x);
x = mul(x, x);
y >>= 1;
}
return ans;
}
inline int inv(int a) { return pwr(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
for (int i = 1; i * i <= a; i++) {
if (a % i == 0) {
vec.pb(i);
if (i != a / i)
vec.pb(a / i);
}
}
sort(allr(vec));
int ans = 0;
for (auto it : vec) {
if (a % it == 0 && b % it == 0) {
ans++;
}
if (ans == k) {
cout << it << endl;
break;
}
}
return 0;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 916,217 | 916,218 | u186304815 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int TEST = 0, CASE = 1;
#define pf printf
#define si(x) scanf("%d", &x)
#define si2(x, y) scanf("%d %d", &x, &y)
#define si3(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define sl(x) scanf("%lld", &x)
#define sl2(x, y) scanf("%lld %lld", &x, &y)
#define sl3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define sd(x) scanf("%lf ", &x)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define clr(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define MX 401000
#define left (indx << 1)
#define right left + 1
#define mid ((l + r) >> 1)
#define call left, l, mid
#define lnd tree[left]
#define calr right, mid + 1, r
#define rnd tree[right]
#define cnd tree[indx]
#define speed (ios::sync_with_stdio(false), cin.tie(0))
#define fpoint(x) (cout.precision(x), cout << fixed)
#define FOR(i, n) for (int i = 1; i <= n; ++i)
#define FOR0(i, n) for (int i = 0; i < n; ++i)
#define dx xx + dirx[i]
#define dy yy + diry[i]
long long int mod = 1000000007LL;
const long double pi = 2.0 * acos(0.0);
typedef long long int ll;
typedef long double ld;
int dirx[9] = {0, 0, 0, -1, +1, +1, +1, -1, -1};
int diry[9] = {0, -1, +1, 0, 0, -1, +1, -1, +1};
struct vpair {
int a, b;
vpair(int a, int b) { this->a = a, this->b = b; }
};
bool cmp(int &a, int &b) {
return a < b; /// ascending order
return a > b; /// descending order
}
int n, m, a, b, c, d, k, x, y, z, ans = 0, total = 0;
int arr[300001];
string s;
vector<int> v;
int main(void) {
cin >> a >> b >> k;
v.pb(0);
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
v.pb(i);
}
cout << v[k] << endl;
return 0;
}
/**
"G:\Work Station\OnlineJudge\Atcoder\B.cpp"
**/
| #include <bits/stdc++.h>
using namespace std;
int TEST = 0, CASE = 1;
#define pf printf
#define si(x) scanf("%d", &x)
#define si2(x, y) scanf("%d %d", &x, &y)
#define si3(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define sl(x) scanf("%lld", &x)
#define sl2(x, y) scanf("%lld %lld", &x, &y)
#define sl3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define sd(x) scanf("%lf ", &x)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define clr(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define MX 401000
#define left (indx << 1)
#define right left + 1
#define mid ((l + r) >> 1)
#define call left, l, mid
#define lnd tree[left]
#define calr right, mid + 1, r
#define rnd tree[right]
#define cnd tree[indx]
#define speed (ios::sync_with_stdio(false), cin.tie(0))
#define fpoint(x) (cout.precision(x), cout << fixed)
#define FOR(i, n) for (int i = 1; i <= n; ++i)
#define FOR0(i, n) for (int i = 0; i < n; ++i)
#define dx xx + dirx[i]
#define dy yy + diry[i]
long long int mod = 1000000007LL;
const long double pi = 2.0 * acos(0.0);
typedef long long int ll;
typedef long double ld;
int dirx[9] = {0, 0, 0, -1, +1, +1, +1, -1, -1};
int diry[9] = {0, -1, +1, 0, 0, -1, +1, -1, +1};
struct vpair {
int a, b;
vpair(int a, int b) { this->a = a, this->b = b; }
};
bool cmp(int &a, int &b) {
return a < b; /// ascending order
return a > b; /// descending order
}
int n, m, a, b, c, d, k, x, y, z, ans = 0, total = 0;
int arr[300001];
string s;
vector<int> v;
int main(void) {
cin >> a >> b >> k;
v.pb(0);
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
v.pb(i);
}
cout << v[v.size() - k] << endl;
return 0;
}
/**
"G:\Work Station\OnlineJudge\Atcoder\B.cpp"
**/
| [
"expression.operation.binary.add"
] | 916,223 | 916,224 | u403297091 | cpp |
p03106 | #if 0
#endif
#include <algorithm>
#include <assert.h>
#include <complex>
#include <iostream>
#include <memory>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF (1 << 30)
using namespace std;
using ll = long long;
int A, B, K;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
for (int i = 1; i < 101; ++i) {
if (A % i == 0 && B % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | #if 0
#endif
#include <algorithm>
#include <assert.h>
#include <complex>
#include <iostream>
#include <memory>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF (1 << 30)
using namespace std;
using ll = long long;
int A, B, K;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
for (int i = 100; i > 0; --i) {
if (A % i == 0 && B % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,229 | 916,230 | u884692162 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC(T, v) static_cast<T>(v)
#define SI(v) SC(int, v.size())
#define SL(v) SC(LL, v.size())
#define RF(e, v) for (auto &e : v)
#define ei else if
#define UR assert(false)
// ---- ----
int a, b, k;
int main() {
cin >> a >> b >> k;
int c = 0;
inc1(i, max(a, b)) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
cout << i << endl;
return 0;
}
}
UR;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC(T, v) static_cast<T>(v)
#define SI(v) SC(int, v.size())
#define SL(v) SC(LL, v.size())
#define RF(e, v) for (auto &e : v)
#define ei else if
#define UR assert(false)
// ---- ----
int a, b, k;
int main() {
cin >> a >> b >> k;
int c = 0;
dec1(i, max(a, b)) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
cout << i << endl;
return 0;
}
}
UR;
}
| [
"identifier.change"
] | 916,231 | 916,232 | u568652083 | cpp |
p03106 | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
vector<int> cd;
for (int a = 2; a <= A; ++a) {
if (A % a == 0 && B % a == 0)
cd.push_back(a);
}
sort(cd.begin(), cd.end());
cout << cd[cd.size() - K] << "\n";
return 0;
} | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
vector<int> cd;
for (int a = 1; a <= A; ++a) {
if (A % a == 0 && B % a == 0)
cd.push_back(a);
}
sort(cd.begin(), cd.end());
cout << cd[cd.size() - K] << "\n";
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,236 | 916,237 | u577747009 | cpp |
p03106 | #include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
using u32 = std::uint_fast32_t;
using usize = std::size_t;
#include <utility>
template <class T> T gcd(T m, T n) {
while (m %= n)
::std::swap(m, n);
return n;
}
int main() {
u32 a, b;
usize k;
std::cin >> a >> b >> k;
const u32 c = gcd(a, b);
u32 i = 0;
while (k != static_cast<usize>(0)) {
++i;
if (c % i == static_cast<u32>(0)) {
--k;
}
}
std::cout << i << std::endl;
return 0;
}
| #include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
using u32 = std::uint_fast32_t;
using usize = std::size_t;
#include <utility>
template <class T> T gcd(T m, T n) {
while (m %= n)
::std::swap(m, n);
return n;
}
int main() {
u32 a, b;
usize k;
std::cin >> a >> b >> k;
const u32 c = gcd(a, b);
u32 i = c + 1;
while (k != static_cast<usize>(0)) {
--i;
if (c % i == static_cast<u32>(0)) {
--k;
}
}
std::cout << i << std::endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 916,240 | 916,241 | u708618797 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 916,244 | 916,245 | u148968106 | cpp |
p03106 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
vector<int> v;
for (int i = b; i >= 1; i--) {
if (b % i == 0) {
cout << i;
v.push_back(i);
}
}
cout << v[c - 1];
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
vector<int> v;
for (int i = b; i >= 1; i--) {
if (b % i == 0) {
v.push_back(i);
}
}
cout << v[c - 1];
}
| [] | 916,252 | 916,253 | u978036461 | cpp |
p03106 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
vector<int> v;
for (int i = b; i >= 1; i--) {
if (b % i == 0) {
v.push_back(i);
}
}
cout << v[c];
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
vector<int> v;
for (int i = b; i >= 1; i--) {
if (b % i == 0) {
v.push_back(i);
}
}
cout << v[c - 1];
}
| [
"expression.operation.binary.add"
] | 916,255 | 916,253 | u978036461 | cpp |
p03106 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using ll = long long;
using ull = unsigned long long;
// vector
template <class T> using vec = std::vector<T>;
template <class T> using vvec = vec<vec<T>>;
constexpr std::size_t operator""_sz(ull n) { return std::size_t(n); }
int main() {
using namespace std;
int a, b, k;
cin >> a >> b >> k;
for (int i = 1, count = 0; i <= 100; ++i) {
if (a % i == 0 && b % i == 0) {
++count;
}
if (count == k) {
cout << i << endl;
break;
}
}
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstddef>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using ll = long long;
using ull = unsigned long long;
// vector
template <class T> using vec = std::vector<T>;
template <class T> using vvec = vec<vec<T>>;
constexpr std::size_t operator""_sz(ull n) { return std::size_t(n); }
int main() {
using namespace std;
int a, b, k;
cin >> a >> b >> k;
for (int i = 100, count = 0; i > 0; --i) {
if (a % i == 0 && b % i == 0) {
++count;
}
if (count == k) {
cout << i << endl;
break;
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,258 | 916,259 | u207917850 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int a, b, k;
Scd3(a, b, k);
int i = a * b;
while (k) {
i--;
if (a % i == 0 && b % i == 0) {
k--;
}
}
printf("%d\n", i);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int a, b, k;
Scd3(a, b, k);
int i = a * b + 1;
while (k) {
i--;
if (a % i == 0 && b % i == 0) {
k--;
}
}
printf("%d\n", i);
return 0;
}
| [
"assignment.change"
] | 916,273 | 916,274 | u550398291 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K + 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K);
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 916,281 | 916,282 | u504053832 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
int main() {
ll a, b, c, i;
cin >> a >> b >> c;
vector<ll> v;
ll k = max(a, b);
for (i = 1; i <= k; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v[c - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
int main() {
ll a, b, c, i;
cin >> a >> b >> c;
vector<ll> v;
ll k = max(a, b);
for (i = 1; i <= k; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v[v.size() - c] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,283 | 916,284 | u876646747 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = 0;
while (count < K) {
i++;
if (A % i == 0 && B % i == 0) {
count++;
}
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = 101;
while (count < K) {
i--;
if (A % i == 0 && B % i == 0) {
count++;
}
}
cout << i << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,294 | 916,295 | u981068718 | cpp |
p03106 | #include <algorithm>
#include <iostream>
int main() {
int a, b, k;
std::cin >> a >> b >> k;
int temp = 0;
int ans = 0;
for (int i = std::min(a, b); i > 1; i--) {
if (a % i == 0 && b % i == 0) {
temp += 1;
}
if (temp == k) {
ans = i;
break;
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <iostream>
int main() {
int a, b, k;
std::cin >> a >> b >> k;
int temp = 0;
int ans = 0;
for (int i = std::min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0) {
temp += 1;
}
if (temp == k) {
ans = i;
break;
}
}
std::cout << ans << std::endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,296 | 916,297 | u892351900 | cpp |
p03106 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, k, i;
scanf("%d %d %d", &a, &b, &k);
for (i = 1; 1; i++) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
printf("%d", i);
break;
}
}
} | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, k, i;
scanf("%d %d %d", &a, &b, &k);
for (i = a; 1; i--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
printf("%d", i);
break;
}
}
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 916,300 | 916,301 | u356991267 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main(void) {
int a, b, k, n, max;
VI arr;
cin >> a >> b >> k;
if (a > b) {
n = b;
max = a;
} else {
n = a;
max = b;
}
for (int i = 1; i <= n; i++) {
if (n % i == 0 && max % i == 0) {
arr.push_back(i);
}
}
cout << arr[k - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main(void) {
int a, b, k, n, max;
VI arr;
cin >> a >> b >> k;
if (a > b) {
n = b;
max = a;
} else {
n = a;
max = b;
}
for (int i = 1; i <= n; i++) {
if (n % i == 0 && max % i == 0) {
arr.push_back(i);
}
}
cout << arr[arr.size() - k];
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,308 | 916,309 | u522598953 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int a, b, k, i, r;
cin >> a >> b >> k;
if (a < b) {
swap(a, b);
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
for (i = b;; i--) {
if (a % i == 0)
k--;
if (!k)
break;
}
cout << i << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int a, b, k, i, r;
cin >> a >> b >> k;
if (a < b) {
swap(a, b);
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
for (i = b;; i--) {
if (b % i == 0)
k--;
if (!k)
break;
}
cout << i << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 916,318 | 916,319 | u351521513 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
int gcd = b;
int sum = 0;
for (int i = gcd; i != 1; i--) {
if (gcd % i == 0)
sum++;
if (sum == k) {
printf("%d\n", i);
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
int gcd = b;
int sum = 0;
for (int i = gcd; i != 0; i--) {
if (gcd % i == 0)
sum++;
if (sum == k) {
printf("%d\n", i);
return 0;
}
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,333 | 916,334 | u751675422 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
deque<int> yakusuu;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0)
yakusuu.push_back(i);
}
cout << yakusuu[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
deque<int> yakusuu;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0)
yakusuu.push_front(i);
}
cout << yakusuu[k - 1] << endl;
return 0;
} | [
"call.function.change"
] | 916,335 | 916,336 | u506320030 | cpp |
p03106 | /* Akshat Sharma @akshat98 */
#include <bits/stdc++.h>
#include <iostream>
#define IOS ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define ll long long
#define MOD 1000000007
#define MAX 1000000001
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pair<int, int>>
#define vpl vector<pair<ll, ll>>
#define rep(i, a, b) for (i = a; i < b; i++)
#define reqp(i, a, b) for (i = a; i <= b; i++)
#define ren for (i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input_file.txt", "r", stdin);
// freopen("output_file.txt", "w", stdout);
// #endif
int i, j, k, l, n, test_case, a, b, c;
test_case = 1;
// cin>>test_case;
while (test_case--) {
int ans = 0;
cin >> a >> b >> k;
i = 1;
while (k) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0)
break;
i++;
}
cout << i;
}
return 0;
} | /* Akshat Sharma @akshat98 */
#include <bits/stdc++.h>
#include <iostream>
#define IOS ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define ll long long
#define MOD 1000000007
#define MAX 1000000001
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pair<int, int>>
#define vpl vector<pair<ll, ll>>
#define rep(i, a, b) for (i = a; i < b; i++)
#define reqp(i, a, b) for (i = a; i <= b; i++)
#define ren for (i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input_file.txt", "r", stdin);
// freopen("output_file.txt", "w", stdout);
// #endif
int i, j, k, l, n, test_case, a, b, c;
test_case = 1;
// cin>>test_case;
while (test_case--) {
int ans = 0;
cin >> a >> b >> k;
i = a;
while (k) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0)
break;
i--;
}
cout << i;
}
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 916,339 | 916,340 | u211831468 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (int i = a; i <= b; i++)
#define rfor(i, a, b) for (int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define X first
#define Y second
#define N 314159
#define vi vector<int>
#define v vector
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, k;
cin >> a >> b >> k;
// multiset<int>dc;
int ans;
forn(i, 1, 100) {
if (a % i == 0 and b % i == 0) {
k--;
if (k == 0) {
ans = i;
break;
}
}
}
cout << ans;
return 0;
}
// g++ -g c.cpp ; ./a.exe | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << endl
#define real signed
#define endl '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (int i = a; i <= b; i++)
#define rfor(i, a, b) for (int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define X first
#define Y second
#define N 314159
#define vi vector<int>
#define v vector
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, k;
cin >> a >> b >> k;
// multiset<int>dc;
int ans;
rfor(i, 100, 1) {
if (a % i == 0 and b % i == 0) {
k--;
if (k == 0) {
ans = i;
break;
}
}
}
cout << ans;
return 0;
}
// g++ -g c.cpp ; ./a.exe | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 916,341 | 916,342 | u782238920 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define endl '\n'
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt[100] = {}, tmp = 0;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
cnt[tmp] = i;
tmp++;
}
}
cout << cnt[k - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define endl '\n'
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt[100] = {}, tmp = 0;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
cnt[tmp] = i;
tmp++;
}
}
cout << cnt[tmp - k] << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 916,353 | 916,354 | u946090308 | cpp |
p03106 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int y[200];
int comD(int a, int b, int k) {
int sum = 0;
int jg;
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
y[sum] = i;
sum++;
}
}
return y[sum - k];
}
int main() {
int a, b, k;
cin >> a >> b >> k;
cout << comD(a, b, k) << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int y[200];
int comD(int a, int b, int k) {
int sum = 0;
int jg;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
y[sum] = i;
sum++;
}
}
return y[sum - k];
}
int main() {
int a, b, k;
cin >> a >> b >> k;
cout << comD(a, b, k) << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,359 | 916,360 | u061597928 | cpp |
p03106 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int gcd(int a, int b) {
int g = max(a, b);
int l = min(a, b);
if (g % l) {
return gcd(l, g % l);
} else {
return l;
}
}
int main() {
int A, B, K;
int n, m;
int cnt = 0;
cin >> A >> B >> K;
n = gcd(A, B);
for (int i = n - 1; i > 0; i--) {
if (n % i == 0) {
cnt++;
if (cnt == K) {
m = i;
break;
}
}
}
cout << m << endl;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int gcd(int a, int b) {
int g = max(a, b);
int l = min(a, b);
if (g % l) {
return gcd(l, g % l);
} else {
return l;
}
}
int main() {
int A, B, K;
int n, m;
int cnt = 0;
cin >> A >> B >> K;
n = gcd(A, B);
for (int i = n; i > 0; i--) {
if (n % i == 0) {
cnt++;
if (cnt == K) {
m = i;
break;
}
}
}
cout << m << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 916,361 | 916,362 | u601256797 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; i < 1; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; 0 < i; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 916,377 | 916,378 | u767430468 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; 1 < i; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; 0 < i; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,379 | 916,378 | u767430468 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 1, count = 0;
while (count <= 100) {
if (A % i == 0 && B % i == 0) {
count++;
if (count == K) {
break;
}
}
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 100, count = 0;
while (count <= 100) {
if (A % i == 0 && B % i == 0) {
count++;
if (count == K) {
break;
}
}
i--;
}
cout << i << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,402 | 916,403 | u977554186 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
const int MAXN = 1e6 + 50;
int A[MAXN];
main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
}
}
cout << vec[K - 1];
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
const int MAXN = 1e6 + 50;
int A[MAXN];
main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
}
}
cout << vec[vec.size() - K];
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,407 | 916,408 | u875940442 | cpp |
p03106 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i < 101; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
sort(div.begin(), div.end());
cout << div[k - 1] << endl;
return 0;
} |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i < 101; i++) {
if ((a % i == 0) && (b % i == 0)) {
div.push_back(i);
}
}
sort(div.rbegin(), div.rend());
cout << div[k - 1] << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.function.change",
"call.arguments.change"
] | 916,411 | 916,412 | u874996917 | cpp |
p03106 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
vector<int> get_divisors(int n) {
vector<int> res;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
// res.insert(res.begin(), 1);
sort(res.begin(), res.end());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int num = gcd(a, b);
vector<int> divs = get_divisors(num);
cout << divs[k - 1] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
vector<int> get_divisors(int n) {
vector<int> res;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
sort(res.rbegin(), res.rend());
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int num = gcd(a, b);
vector<int> divs = get_divisors(num);
cout << divs[k - 1] << '\n';
return 0;
}
| [
"call.function.change",
"call.arguments.change"
] | 916,413 | 916,414 | u009579822 | cpp |
p03106 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll a, b, n;
ll i, j, k;
vector<ll> vv;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
scanf("%lld%lld%lld", &a, &b, &n);
ll aa = gcd(a, b);
fornum(i, 0, aa) {
if (aa % (i + 1) == 0) {
vv.push_back(aa / (i + 1));
}
}
sort(vv.begin(), vv.end());
printf("%lld", vv[n - 1]);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll a, b, n;
ll i, j, k;
vector<ll> vv;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
scanf("%lld%lld%lld", &a, &b, &n);
ll aa = gcd(a, b);
fornum(i, 0, aa) {
if (aa % (i + 1) == 0) {
vv.push_back(aa / (i + 1));
}
}
sort(vv.begin(), vv.end());
/*fornum(i,0,vv.size()){
printf("%lld\n", vv[i]);
}*/
printf("%lld", vv[vv.size() - n]);
return 0;
} | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,417 | 916,418 | u259396003 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int list[100] = {};
REP(i, 100) {
if (a % (i + 1) == 0 && b % (i + 1) == 0) {
list[i] = 1;
}
}
int count = 0;
int ans = 0;
for (int i = 99; i > 0; i--) {
if (list[i] == 1) {
count++;
}
ans = i + 1;
if (count == k) {
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int list[100] = {};
REP(i, 100) {
if (a % (i + 1) == 0 && b % (i + 1) == 0) {
list[i] = 1;
}
}
int count = 0;
int ans = 0;
for (int i = 99; i >= 0; i--) {
if (list[i] == 1) {
count++;
}
ans = i + 1;
if (count == k) {
break;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 916,428 | 916,429 | u620059302 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1;; i++) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i << endl;
return 0;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = a;; i--) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i << endl;
return 0;
}
}
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 916,436 | 916,437 | u601082779 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, i, ans, count = 0;
cin >> A >> B >> K;
for (i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
ans = i;
count++;
}
if (count == K) {
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, i, ans, count = 0;
cin >> A >> B >> K;
for (i = 100; 0 < i; i--) {
if (A % i == 0 && B % i == 0) {
ans = i;
count++;
}
if (count == K) {
break;
}
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 916,438 | 916,439 | u317711717 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B)) {
if (A % i == 0 && B % i == 0) {
X.push_back(i);
}
}
cout << X[X.size() - K] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
X.push_back(i);
}
}
cout << X[X.size() - K] << endl;
} | [
"expression.operation.binary.add"
] | 916,443 | 916,444 | u325820449 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> ans;
for (int i = 1; i <= 100; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
// for ( int i = 0; i < 10; i++ ) cout << ans[i] << endl;
cout << ans[K - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> ans;
for (int i = 1; i <= 100; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
cout << ans[ans.size() - K] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,455 | 916,456 | u806800460 | cpp |
p03106 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i < a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i);
}
}
}
std::cout << *(t.end() - k);
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i <= a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i);
}
}
}
std::cout << *(t.end() - k);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,472 | 916,473 | u228807040 | cpp |
p03106 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = 0;
while (k != 0) {
ans++;
if (a % ans == 0 && b % ans == 0) {
k--;
// cout << ans << endl;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = 1000;
while (k != 0) {
ans--;
if (a % ans == 0 && b % ans == 0) {
k--;
// cout << ans << endl;
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,476 | 916,475 | u174404613 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C;
D = A;
if (A > B) {
A = B;
B = D;
}
int a[2000];
a[0] = 1;
int k = 1;
for (int i = 2; i <= A; i++) {
if (A % i == 0 && B % i == 0) {
a[k] = i;
k++;
}
}
cout << a[C - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C;
D = A;
if (A > B) {
A = B;
B = D;
}
int a[2000];
a[0] = 1;
int k = 1;
for (int i = 2; i <= A; i++) {
if (A % i == 0 && B % i == 0) {
a[k] = i;
k++;
}
}
cout << a[k - C] << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 916,479 | 916,480 | u833295869 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.