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 8
values |
|---|---|---|---|---|---|---|---|
p03106 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"expression.operation.binary.add"
] | 914,983 | 914,984 | u874947858 | cpp |
p03106 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"identifier.change",
"call.function.change"
] | 914,985 | 914,984 | u874947858 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 1; true; i++) {
if ((a % i == 0) && (b % i == 0)) {
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; true; i--) {
if ((a % i == 0) && (b % i == 0)) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 914,988 | 914,989 | u232711814 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, k, i, count = 0, ans;
cin >> a >> b >> k;
for (i = 1; i < 200; i++) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, k, i, count = 0, ans;
cin >> a >> b >> k;
for (i = 100; 0 < i; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
} | [
"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"
] | 914,991 | 914,992 | u703537155 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 915,007 | 915,008 | u386769326 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
int c = 0;
int d = 0;
cin >> a >> b >> k;
for (int i = 100; i > 1; i--) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
d = i;
break;
}
}
cout << d;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
int c = 0;
int d = 0;
cin >> a >> b >> k;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
d = i;
break;
}
}
cout << d;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,035 | 915,036 | u469451657 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
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 += 1;
if (cnt == K) {
cout << i << endl;
return 0;
}
}
}
}
| #include <iostream>
using namespace std;
int main() {
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;
}
}
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,043 | 915,044 | u591755251 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) ... | [
"expression.operation.binary.add"
] | 915,047 | 915,048 | u167988719 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ALL(a) begin(a), end(a)
#define COUNTOF(a) (sizeof(a) / sizeof(a[0]))
#define SP << " " <<
#define FMT(a) #a << ":" << a
#define FMT2(a, b) #a << ":" << a << ", " << #b << ":" << b
#define FMT3(a, b, c) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 915,049 | 915,048 | u167988719 | cpp |
p03106 | #include <cstdio>
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
T r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
int g = gcd(a, b);
int c = 0;
for (int i = g; i > 0; --i) {
if (a % i == 0 && b % 1... | #include <cstdio>
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
T r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, k;
scanf("%d %d %d", &a, &b, &k);
int g = gcd(a, b);
int c = 0;
for (int i = g; i > 0; --i) {
if (a % i == 0 && b % i... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 915,058 | 915,059 | u931819817 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count = 0;
REP(i, 1, a) {
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count = 0;
REP(i, 1, 9999999) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 915,074 | 915,075 | u430302940 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
int main() {
long long unsigned int a, b, k, ab, n = 0, s[1000] = {0};
std::cin >> a >> b >> k;
if (a > b) {
ab = a;
} else {
ab = b;
}
for (int i = 1; i < ab; i++) {
if (a % i == 0 && b % i == 0) {
s[n] = i;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
int main() {
long long unsigned int a, b, k, ab, n = 0, s[1000] = {0};
std::cin >> a >> b >> k;
if (a > b) {
ab = a;
} else {
ab = b;
}
for (int i = 1; i <= ab; i++) {
if (a % i == 0 && b % i == 0) {
s[n] = i;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,076 | 915,077 | u125051909 | cpp |
p03106 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> v;
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v.at(k - 1) << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> v;
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
cout << v.at(v.size() - k) << endl;
return 0;
}
| [
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,078 | 915,079 | u657208344 | cpp |
p03106 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 915,084 | 915,085 | u069521477 | cpp |
p03106 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"identifier.change",
"variable_access.subscr... | 915,086 | 915,085 | u069521477 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 0; i < min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i <= min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,087 | 915,088 | u936602931 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int x[100];
int cnt = 0;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
x[cnt] = i;
cnt++;
}
}
cout << x[k - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int x[100];
int cnt = 0;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
x[cnt] = i;
cnt++;
}
}
cout << x[cnt - k];
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,097 | 915,098 | u883323885 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPR(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define FORR(i, m, n) for (ll i = (ll)m - 1; i >= (ll)n; i--)
#define ALL(x) (x).begin(), (x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPR(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define FORR(i, m, n) for (ll i = (ll)m - 1; i >= (ll)n; i--)
#define ALL(x) (x).begin(), (x... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.condition.change"
] | 915,102 | 915,103 | u928713799 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> yakusu;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
yakusu.push_back(i);
}
cout << yakusu.at(k... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> yakusu;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
yakusu.push_back(i);
}
cout << yakusu.at(y... | [
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,111 | 915,112 | u796273093 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = __gcd(a, b);
int p = 1;
for (int i = 2; i <= s; i++) {
if (s % i == 0) {
p++;
if (p == k) {
cout << s / i << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = __gcd(a, b);
int p = 0;
for (int i = 1; i <= s; i++) {
if (s % i == 0) {
p++;
if (p == k) {
cout << s / i << endl;
return 0;
}
}
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 915,116 | 915,117 | u146788010 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = __gcd(a, b);
int p = 1;
for (int i = 2; i < s; i++) {
if (s % i == 0) {
p++;
if (p == k) {
cout << s / i << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = __gcd(a, b);
int p = 0;
for (int i = 1; i <= s; i++) {
if (s % i == 0) {
p++;
if (p == k) {
cout << s / i << endl;
return 0;
}
}
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,118 | 915,117 | u146788010 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef lon... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef lon... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,129 | 915,130 | u211259428 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, k;
cin >> a >> b >> k;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int a, b, k;
cin >> a >> b >> k;... | [
"expression.operation.binary.remove"
] | 915,139 | 915,140 | u525560003 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> C(100);
for (int i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
C[i] = i;
}
}
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
cout << C[K] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> C(101);
for (int i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
C[i] = i;
}
}
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
cout << C[K - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 915,143 | 915,142 | u016183710 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> C(100);
for (int i = 0; i < 100; i++) {
if (A % i == 0 && B % i == 0) {
C[i] = i;
}
}
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
cout << C[K] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> C(101);
for (int i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
C[i] = i;
}
}
sort(C.begin(), C.end());
reverse(C.begin(), C.end());
cout << C[K - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,144 | 915,142 | u016183710 | cpp |
p03106 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"expression.operation.binary.remove"
] | 915,156 | 915,157 | u610897920 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int mai... | [
"expression.operation.binary.add"
] | 915,166 | 915,167 | u999788719 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i < min(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,168 | 915,169 | u957398141 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i < max(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| [
"control_flow.loop.for.condition.change"
] | 915,170 | 915,169 | u957398141 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[num.size() - K + 1] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[num.size() - K] << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 915,177 | 915,178 | u670815700 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[K - 1] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[num.size() - K] << endl;
return 0;
} | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,179 | 915,178 | u670815700 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[K] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int N = A <= B ? A : B;
vector<int> num;
for (int i = 1; i <= N; i++) {
if (A % i == 0 && B % i == 0) {
num.push_back(i);
}
}
cout << num[num.size() - K] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 915,180 | 915,178 | u670815700 | cpp |
p03106 | #pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define repc(i, m, n) for (int i = m; i < n; i++)
#define reprc(i, m, n) for (int i = m; i > n; i--)
#define all(v) v.begin(), v.end
#define INF 1e9
#define... | #pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define repc(i, m, n) for (int i = m; i < n; i++)
#define reprc(i, m, n) for (int i = m; i > n; i--)
#define all(v) v.begin(), v.end
#define INF 1e9
#define... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 915,189 | 915,190 | u327950489 | cpp |
p03106 | #include <iostream>
int main() {
int a, b, k;
std::cin >> a >> b >> k;
int count = 0;
for (int i = std::min(a, b); i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
++count;
}
if (count == 3) {
std::cout << i << std::endl;
}
}
}
| #include <iostream>
int main() {
int a, b, k;
std::cin >> a >> b >> k;
int count = 0;
for (int i = std::min(a, b); i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
++count;
}
if (count == k) {
std::cout << i << std::endl;
break;
}
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 915,208 | 915,209 | u855644334 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,210 | 915,211 | u018713014 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
vector<int> v(max(a, b));
rep(i, max(a, b... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
vector<int> v(max(a, b));
rep(i, max(a, b... | [
"expression.operation.binary.add"
] | 915,217 | 915,218 | u260907804 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
vector<int> v(max(a, b));
rep(i, min(a, b... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
vector<int> v(max(a, b));
rep(i, max(a, b... | [
"misc.opposites",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 915,219 | 915,218 | u260907804 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
for (int i = 1; i < 200; i++) {
if (a % i == 0 && b % i == 0)
vec.push_back(i);
}
cout << vec[vec.size() - k + 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
for (int i = 1; i < 200; i++) {
if (a % i == 0 && b % i == 0)
vec.push_back(i);
}
cout << vec[vec.size() - k] << endl;
} | [
"expression.operation.binary.remove"
] | 915,220 | 915,221 | u966257731 | cpp |
p03106 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
for (int i = abs(B - A); i >= 1; --i) {
if (A % i == 0 && B % i == 0) {
count++;
}
if (count == K) {
cout << i << endl;
return 0;
}
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
for (int i = B; i >= 1; --i) {
if (A % i == 0 && B % i == 0) {
count++;
}
if (count == K) {
cout << i << endl;
return 0;
}
}
} | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 915,222 | 915,223 | u906839513 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"expression.operation.binary.remove"
] | 915,224 | 915,225 | u454081619 | cpp |
p03106 | #include <bits/stdc++.h>
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 == 1) {
K--;
if (K == 0) {
cout << i << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
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;
}
}
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 915,226 | 915,227 | u629548179 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 915,236 | 915,237 | u398437835 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, k;
cin >> a >> b >> k;
int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, k;
cin >> a >> b >> k;
int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 915,238 | 915,239 | u388372553 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, k;
cin >> a >> b >> k;
int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, k;
cin >> a >> b >> k;
int... | [
"expression.operation.binary.add"
] | 915,240 | 915,239 | u388372553 | cpp |
p03106 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[10000] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0) ... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[1000] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,241 | 915,242 | u374678351 | cpp |
p03106 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[1000000] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[1000] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,243 | 915,242 | u374678351 | cpp |
p03106 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[100] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0) {
... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
int max;
int count = 0;
// vector<int> ans;
int ans[1000] = {0};
cin >> a >> b >> k;
if (a > b)
max = a;
else
max = b;
for (int i = 1; i <= max; i++) {
if (a % i == 0 && b % i == 0) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,244 | 915,242 | u374678351 | cpp |
p03106 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).... | [
"literal.number.change",
"variable_declaration.value.change"
] | 915,250 | 915,249 | u767543103 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int C[100];
int l = 0;
for (int i = min(A, B); i >= 1; --i) {
if (A % i == 0 && B % i == 0) {
C[l] = i;
l++;
}
}
cout << C[l - 1 - (K - 1)];
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int C[100];
int l = 0;
for (int i = min(A, B); i >= 1; --i) {
if (A % i == 0 && B % i == 0) {
C[l] = i;
l++;
}
}
cout << C[K - 1];
} | [
"expression.operation.binary.remove"
] | 915,274 | 915,275 | u764860452 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
cout << i << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
cout << i << endl;
break;
}
}
return 0;
} | [
"control_flow.break.add"
] | 915,282 | 915,283 | u110383054 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b, k;
cin >> a >> b >> k;
int i = 1;
int count = 0;
for (int i = min(a, b); i > 1; i--) {
if ((a % i) == 0 && (b % i) == 0) ... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b, k;
cin >> a >> b >> k;
int i = 1;
int count = 0;
for (int i = min(a, b); i > 0; i--) {
if ((a % i) == 0 && (b % i) == 0)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,304 | 915,305 | u432194969 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | [
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,311 | 915,312 | u460819600 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int quotients[100];
int main() {
int a;
int b;
int k;
int index = 0;
cin >> a >> b >> k;
for (int i = 2; i < b + 3; i++) {
if (a % i == 0 && b % i == 0) {
quotients[index] = i;
index += 1;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int quotients[100];
int main() {
int a;
int b;
int k;
int index = 0;
cin >> a >> b >> k;
for (int i = 1; i < b + 2; i++) {
if (a % i == 0 && b % i == 0) {
quotients[index] = i;
index += 1;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,315 | 915,316 | u974680794 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int quotients[100];
int main() {
int a;
int b;
int k;
int index = 0;
cin >> a >> b >> k;
for (int i = 2; i < 100; i++) {
if (a % i == 0 && b % i == 0) {
quotients[index] = i;
index += 1;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int quotients[100];
int main() {
int a;
int b;
int k;
int index = 0;
cin >> a >> b >> k;
for (int i = 1; i < b + 2; i++) {
if (a % i == 0 && b % i == 0) {
quotients[index] = i;
index += 1;
}
}
cou... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,317 | 915,316 | u974680794 | 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 = min(a, b); i > 1; i--) {
if (a % i == 0 and b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 and b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,329 | 915,330 | u732730677 | cpp |
p03106 | #include <iostream>
using namespace std;
int num, num2, divisor;
int main() {
cin >> num >> num2 >> divisor;
int array[50];
int largest = 0;
int index = 0;
for (int i = 1; i < 51; i++) {
if (num % i == 0 && num2 % i == 0) {
array[index] = i;
largest = i;
index += 1;
}
}
cout... | #include <iostream>
using namespace std;
int num, num2, divisor;
int main() {
cin >> num >> num2 >> divisor;
int array[100];
int largest = 0;
int index = 0;
for (int i = 1; i < 101; i++) {
if (num % i == 0 && num2 % i == 0) {
array[index] = i;
largest = i;
index += 1;
}
}
co... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,346 | 915,347 | u261501616 | cpp |
p03106 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
void swap(int &A, int &B) {
int T = A;
A = B;
B = T;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B) {
swap(A, B);
}
vector<int> v;
REP(1, i, A + 1) {
... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
void swap(int &A, int &B) {
int T = A;
A = B;
B = T;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B) {
swap(A, B);
}
vector<int> v;
REP(1, i, A + 1) {
... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,348 | 915,349 | u392294962 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int(i); i < (n); i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = min(a, b); i; i--) {
if (a % i == 0 && b & i == 0) {
k--;
if (k == 0) {
cout << i << endl;
retu... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int(i); i < (n); i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = min(a, b); i; i--) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
retu... | [
"control_flow.branch.if.condition.change"
] | 915,417 | 915,418 | u855016901 | cpp |
p03106 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int X = 0;
while (i < K) {
X++;
if (A % X == 0 && B % X == 0) {
i++;
}
}
cout << X << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int X = 530000;
while (i < K) {
X--;
if (A % X == 0 && B % X == 0) {
i++;
}
}
cout << X << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 915,438 | 915,439 | u899108527 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b, ... | [
"control_flow.break.add"
] | 915,451 | 915,452 | u703214333 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i << endl;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i << endl;
break;
}
}
} | [
"control_flow.break.add"
] | 915,455 | 915,456 | u305018585 | cpp |
p03106 | // abc120_b
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i < A * B + 1; i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
// cout << i << endl;
}
}
cout <<... | // abc120_b
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i < A * B + 1; i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
// cout << i << endl;
}
}
cout <... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,466 | 915,467 | u798557584 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div1[100];
int small = min(A, B);
int count = 0;
int i = 1;
for (i = 1; i <= small; i++) {
if (A % i == 0 && B % i == 0) {
div1[count] = i;
... | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div1[100];
int small = min(A, B);
int count = 0;
int i = 1;
for (i = 1; i <= small; i++) {
if (A % i == 0 && B % i == 0) {
div1[count] = i;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,471 | 915,472 | u873269440 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div1[100];
int small = min(A, B);
int count = 0;
int i = 1;
for (i = 1; i < small; i++) {
if (A % i == 0 && B % i == 0) {
div1[count] = i;
... | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int div1[100];
int small = min(A, B);
int count = 0;
int i = 1;
for (i = 1; i <= small; i++) {
if (A % i == 0 && B % i == 0) {
div1[count] = i;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,473 | 915,472 | u873269440 | cpp |
p03106 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 915,477 | 915,478 | u775507068 | 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;
cin >> a >> b >> k;
int g = gcd(a, b);
int ans = g;
for (int i = 0; i < k - 1; ++i) {
while (g % ans != 0)
ans--;
}
cout << ans << endl;
} | #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;
cin >> a >> b >> k;
int g = gcd(a, b);
int ans = g;
for (int i = 0; i < k - 1; ++i) {
ans--;
while (g % ans != 0)
ans--;
}
cout << ans << e... | [
"expression.unary.arithmetic.add"
] | 915,484 | 915,485 | u679366464 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v(1000, 1000);
for (int i = 1; i < 101; i++) {
if (a % i == 0 && b % i == 0)
v[i] = i;
}
sort(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(1000, 0);
for (int i = 1; i < 101; i++) {
if (a % i == 0 && b % i == 0)
v[i] = i;
}
sort(v.begin(), v.end());
cout << v[1000 - k] << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,488 | 915,489 | u469953228 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = max(a, b); i != 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = max(a, b); i != 0; i--) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,495 | 915,496 | u408650734 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = max(a, b); i != 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = max(a, b); i != 0; i--) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 915,497 | 915,496 | u408650734 | cpp |
p03106 | /*
First, solve the problem.Then write the code. - John Johnson
@author: returnAC
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define need_for_speed \
ios_base::sync_with_stdio(0); \
cin.tie... | /*
First, solve the problem.Then write the code. - John Johnson
@author: returnAC
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define need_for_speed \
ios_base::sync_with_stdio(0); \
cin.tie... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 915,500 | 915,501 | u733246687 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int A, B, K;
vector<int> v;
cin >> A >> B >> K;
for (int i = 1; i <= min(A, B); i++)
if (A % i == 0 && B % i == 0)
v.push_back(i);
cout << v[K - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int A, B, K;
vector<int> v;
cin >> A >> B >> K;
for (int i = 1; i <= min(A, B); i++)
if (A % i == 0 && B % i == 0)
v.push_back(i);
cout << v[v.size() - K] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,509 | 915,510 | u528005130 | cpp |
p03106 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
int t = a;
a = b;
b = t;
}
vector<int> m;
for (int i = 1; i <= b / 2 + 1; ++i) {
if (a % i == 0 && b % i == 0)
m.push_back(i);
}
cout << m[m.size() - c] << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
int t = a;
a = b;
b = t;
}
vector<int> m;
for (int i = 1; i <= a; ++i) {
if (a % i == 0 && b % i == 0)
m.push_back(i);
}
cout << m[m.size() - c] << endl;
return ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 915,524 | 915,525 | u207460172 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i <= A; i++) {
if (A % i == 0) {
a.push_back(i);
}
}
vector<int> b;
for (int j = 1; j <= B; j++) {
if (B % j == 0) {
b.push_back(j);
}
}
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i <= A; i++) {
if (A % i == 0) {
a.push_back(i);
}
}
vector<int> b;
for (int j = 1; j <= B; j++) {
if (B % j == 0) {
b.push_back(j);
}
}
vector<int> ... | [
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,528 | 915,529 | u521975232 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, ans;
cin >> a >> b >> k;
for (int i = min(a, b); k > 0; i--) {
if (a % i == 0 && b % i == 0) {
ans = i;
k--;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, k, ans;
cin >> a >> b >> k;
for (int i = min(a, b); k > 0; i--) {
if (a % i == 0 && b % i == 0) {
ans = i;
k--;
}
}
cout << ans;
return 0;
}
| [] | 915,548 | 915,549 | u340494803 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
int cnt = 0;
for (int i = A; i > 0; i--) {
if (A % (i + 1) == 0 && B % (i + 1) == 0)
cnt++;
if (cnt == K) {
ans = i + 1;
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
int cnt = 0;
for (int i = A; i > 0; i--) {
if (A % (i) == 0 && B % (i) == 0)
cnt++;
if (cnt == K) {
ans = i;
break;
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 915,554 | 915,555 | u288087195 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = min(A, B);
int cnt = 0;
while (t > 0 && cnt <= K) {
if (A % t == 0 && B % t == 0) {
cnt++;
}
t--;
}
cout << t << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = min(A, B);
int cnt = 0;
while (t > 0 && cnt < K) {
if (A % t == 0 && B % t == 0) {
cnt++;
}
t--;
}
cout << t + 1 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 915,562 | 915,563 | u904123392 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = min(A, B);
int cnt = 0;
while (t > 0 && cnt < K) {
if (A % t == 0 && B % t == 0) {
cnt++;
}
t--;
}
cout << t << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = min(A, B);
int cnt = 0;
while (t > 0 && cnt < K) {
if (A % t == 0 && B % t == 0) {
cnt++;
}
t--;
}
cout << t + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 915,564 | 915,563 | u904123392 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, tmp, K[100], count = 0, i;
cin >> a >> b >> k;
for (i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
K[count] = i;
count++;
}
// if(count==k) break;
}
cout << K[k - 1] << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k, tmp, K[100], count = 0, i;
cin >> a >> b >> k;
for (i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
K[count] = i;
count++;
}
// if(count==k) break;
}
cout << K[count - k] << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 915,577 | 915,578 | u804674166 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#defi... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
#define rSort(a) sort(a.rbegin(), a.rend())
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#def... | [
"control_flow.branch.if.condition.change",
"call.function.change",
"call.arguments.change"
] | 915,579 | 915,580 | u335104842 | cpp |
p03106 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 915,581 | 915,582 | u131020584 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i < 1; i--) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
break;
}
}
}
retu... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
break;
}
}
}
ret... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,583 | 915,584 | u130834452 | cpp |
p03106 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 915,587 | 915,588 | u730731139 | cpp |
p03106 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 915,589 | 915,588 | u730731139 | cpp |
p03106 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
//自然数nの約数列挙 O(root(N))
//使い方
//自然数nを渡すとvector<long long>を返す
//ソート含めると O(root(N) + N log N)
vl divisor(ll n) {... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
//自然数nの約数列挙 O(root(N))
//使い方
//自然数nを渡すとvector<long long>を返す
//ソート含めると O(root(N) + N log N)
vl divisor(ll n) {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 915,592 | 915,593 | u386131832 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int m... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int m... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 915,606 | 915,607 | u489172963 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int min;
vector<int> c;
c.push_back(1);
if (a < b) {
min = a;
} else {
min = b;
}
for (int i = 2; i < min; i++) {
if (a % i == 0 && b % i == 0) {
c.push_back(i);
}
}
int l;
l = c.siz... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int min;
vector<int> c;
c.push_back(1);
if (a < b) {
min = a;
} else {
min = b;
}
for (int i = 2; i <= min; i++) {
if (a % i == 0 && b % i == 0) {
c.push_back(i);
}
}
int l;
l = c.si... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,613 | 915,614 | u270342249 | cpp |
p03106 | /*
* Created by Dipta Das on 16-05-2019
* Title:
* Problem Link:
* Editorial:
* Source Code:
* Comments:
*/
#include <bits/stdc++.h>
#include <stdio.h>
#define fin freopen("input", "r", stdin)
#define whatis(x) cerr << #x << ": " << x << endl;
using namespace std;
using ll = long long;
int main() {
ios_base... | /*
* Created by Dipta Das on 16-05-2019
* Title:
* Problem Link:
* Editorial:
* Source Code:
* Comments:
*/
#include <bits/stdc++.h>
#include <stdio.h>
#define fin freopen("input", "r", stdin)
#define whatis(x) cerr << #x << ": " << x << endl;
using namespace std;
using ll = long long;
int main() {
ios_base... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 915,624 | 915,625 | u567992495 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, K, cnt = 0, ans = 0;
cin >> A >> B >> K;
for (int i = min(A, B); i = 1; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
ans = i;
break;
}
}
cout <... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, K, cnt = 0, ans = 0;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
ans = i;
break;
}
}
cout ... | [
"control_flow.loop.for.condition.change"
] | 915,633 | 915,634 | u382176401 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int g = __gcd(a, b);
for (int i = 1; i <= g && k > 0; i++) {
if (g % i == 0)
k--;
if (k == 0)
cout << i << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int g = __gcd(a, b);
for (int i = g; i >= 1 && k > 0; i--) {
if (g % i == 0)
k--;
if (k == 0)
cout << i << '\n';
}
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 915,638 | 915,639 | u358988638 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0, ans = 0;
for (int i = 100; i > 0; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K)
ans = i;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0, ans = 0;
for (int i = 100; i > 0; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.break.add"
] | 915,654 | 915,655 | u525137785 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, cnt = 0, ans;
cin >> a >> b >> k;
vector<int> num(100);
for (int i = 1; i < 101; i++) {
if (a % i == 0 && b % i == 0) {
num[i - 1] = i;
}
}
for (int i = 99; i > 0; i--) {
if (num[i] != 0) {
cnt++;
if (cnt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, cnt = 0, ans;
cin >> a >> b >> k;
vector<int> num(101);
for (int i = 1; i < 101; i++) {
if (a % i == 0 && b % i == 0) {
num[i] = i;
}
}
for (int i = 100; i > 0; i--) {
if (num[i] != 0) {
cnt++;
if (cnt ==... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 915,656 | 915,657 | u812498271 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 100; i > 0; --i) {
if (A % i == 0 && B % i == 0) {
K--;
if (K) {
cout << i;
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 100; i > 0; --i) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0) {
cout << i;
break;
}
}
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 915,663 | 915,664 | u590088474 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, mi, ma, cnt = 0;
cin >> a >> b >> k;
mi = min(a, b);
ma = max(a, b);
for (int i = mi; i > 1; i--) {
if ((ma % i == 0) && (mi % i == 0)) {
cnt += 1;
}
if (cnt == k) {
cout << i;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, mi, ma, cnt = 0;
cin >> a >> b >> k;
mi = min(a, b);
ma = max(a, b);
for (int i = mi; i > 0; i--) {
if ((a % i == 0) && (b % i == 0)) {
cnt += 1;
}
if (cnt == k) {
cout << i;
break;
}
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 915,694 | 915,695 | u823444917 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int k = 1;
vector<int> V;
int A, B, K;
cin >> A >> B >> K;
for (int k = 1; k <= min(A, B); k++) {
if (A % k == 0 && B % k == 0)
V.push_back(k);
}
reverse(V.begin(), V.end());
cout << ... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int k = 1;
vector<int> V;
int A, B, K;
cin >> A >> B >> K;
for (int k = 1; k <= min(A, B); k++) {
if (A % k == 0 && B % k == 0)
V.push_back(k);
}
reverse(V.begin(), V.end());
cout << ... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 915,698 | 915,699 | u587172770 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i > 1; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 915,708 | 915,709 | u646051775 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i > a; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 915,710 | 915,709 | u646051775 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i < a; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int s = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
s++;
if (s == k) {
cout << i << endl;
break;
}
}
}
}
| [
"control_flow.loop.for.condition.change"
] | 915,711 | 915,709 | u646051775 | 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 = 0; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return ... | #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 <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 915,723 | 915,724 | u430341757 | cpp |
p03106 | #include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a(1, 1);
for (int i = 2; i <= A; i++) {
if (A % i == 0)
a.push_back(i);
}
vector<int> b(1, 1);
for (int i = 2; i <= B; i++) {
if (B % i == 0)
b.... | #include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a(1, 1);
for (int i = 2; i <= A; i++) {
if (A % i == 0)
a.push_back(i);
}
vector<int> b(1, 1);
for (int i = 2; i <= B; i++) {
if (B % i == 0)
b.... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 915,727 | 915,728 | u601575292 | 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 <<... | #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 <... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 915,732 | 915,733 | u313578168 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.