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 | #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>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
// typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
// typedef unsigned int uint;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
rrep(i, 1, min(A, B)) {
if (A % i == 0 && B % i == 0) {
ans++;
if (ans == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | #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>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
// typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
// typedef unsigned int uint;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
rrep(i, 1, min(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
ans++;
if (ans == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | [
"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>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
// typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
// typedef unsigned int uint;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
rep(i, 1, min(A, B)) {
if (A % i == 0 && B % i == 0) {
ans++;
if (ans == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | #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>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
// typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
// typedef unsigned int uint;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
rrep(i, 1, min(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
ans++;
if (ans == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | [
"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)) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
break;
}
}
} | #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)) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
break;
}
}
} | [
"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 (int i = n; i >= 0; i--)
#define int long long
#define endl "\n"
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
repi(i, 1, 1000) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | #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 (int i = n; i >= 0; i--)
#define int long long
#define endl "\n"
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
repn(i, 101) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"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) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
#define ANS(a) cout << a << endl
template <typename T> T gcd(T a, T b) {
if (b == 0)
return abs(a);
T r;
while ((r = a % b) != 0)
a = b, b = r;
return abs(b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
int A, B, K;
cin >> A >> B >> K;
int gcd_AB = gcd(A, B);
int c = 0;
for (int d = 1; d <= gcd_AB; d++) {
if (gcd_AB % d == 0) {
if (++c == K) {
ANS(d);
break;
}
}
}
}
| #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) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
#define ANS(a) cout << a << endl
template <typename T> T gcd(T a, T b) {
if (b == 0)
return abs(a);
T r;
while ((r = a % b) != 0)
a = b, b = r;
return abs(b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
int A, B, K;
cin >> A >> B >> K; // cout << FMT3(A,B,K) << endl;
int gcd_AB = gcd(A, B);
int c = 0;
for (int d = 1; d <= gcd_AB; d++) {
// cout << FMT3(d, gcd_AB, c) << endl;
if (gcd_AB % d == 0) {
if (++c == K) {
ANS(gcd_AB / d);
break;
}
}
}
}
| [
"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) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
#define ANS(a) cout << a << endl
template <typename T> T gcd(T a, T b) {
if (b == 0)
return abs(a);
T r;
while ((r = a % b) != 0)
a = b, b = r;
return abs(b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
int A, B, K;
cin >> A >> B >> K;
int gcd_AB = gcd(A, B);
int c = 0;
for (int d = 1; d <= gcd_AB; d++) {
if (gcd_AB % 1 == 0) {
if (++c == K) {
ANS(d);
break;
}
}
}
}
| #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) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c
#define FMT4(a, b, c, d) \
#a << ":" << a << ", " << #b << ":" << b << ", " << #c << ":" << c << ", " \
<< #d << ":" << d
typedef long long ll;
template <class T> istream &operator>>(istream &s, vector<T> &v) {
for (T &x : v)
s >> x;
return s;
}
inline void Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; }
inline void YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; }
#define ANS(a) cout << a << endl
template <typename T> T gcd(T a, T b) {
if (b == 0)
return abs(a);
T r;
while ((r = a % b) != 0)
a = b, b = r;
return abs(b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout<<std::fixed<<std::setprecision(10);
int A, B, K;
cin >> A >> B >> K; // cout << FMT3(A,B,K) << endl;
int gcd_AB = gcd(A, B);
int c = 0;
for (int d = 1; d <= gcd_AB; d++) {
// cout << FMT3(d, gcd_AB, c) << endl;
if (gcd_AB % d == 0) {
if (++c == K) {
ANS(gcd_AB / d);
break;
}
}
}
}
| [
"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 == 0) {
++c;
if (c == k) {
printf("%d\n", i);
return 0;
}
}
}
return 0;
} | #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 == 0) {
++c;
if (c == k) {
printf("%d\n", i);
return 0;
}
}
}
return 0;
} | [
"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) {
if (a % i == 0 && b % i == 0) {
count++;
}
}
int j = 1, k = 0;
vector<int> d(count);
while (k < count) {
if (a % j == 0 && b % j == 0) {
k++;
d.at(k - 1) = j;
}
j++;
}
cout << d.at(count - c) << endl;
} | #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) {
if (a % i == 0 && b % i == 0) {
count++;
}
}
int j = 1, k = 0;
vector<int> d(count);
while (k < count) {
if (a % j == 0 && b % j == 0) {
k++;
d.at(k - 1) = j;
}
j++;
}
cout << d.at(count - c) << endl;
} | [
"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;
n++;
}
}
if (n == 0) {
std::cout << 1;
return 0;
}
std::cout << s[n - k];
return 0;
} | #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;
n++;
}
}
if (n == 0) {
std::cout << 1;
return 0;
}
std::cout << s[n - k];
return 0;
} | [
"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
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
int A, B, K;
std::cin >> A >> B >> K;
int cnt;
std::vector<int> L(1000);
cnt = 0;
int j;
j = 1;
for (int i = 1; i < 100; i++) {
if (A % i == 0 && B % i == 0) {
L[j] = i;
j++;
}
}
printf("%d\n", L[j - 2]);
} | #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
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
int A, B, K;
std::cin >> A >> B >> K;
int cnt;
std::vector<int> L(1000);
cnt = 0;
int j;
j = 1;
for (int i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
L[j] = i;
j++;
}
}
printf("%d\n", L[j - K]);
/*
for(int i=1;i<101;i++){
printf("%d\n",L[i]);
}
*/
} | [
"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
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
int A, B, K;
std::cin >> A >> B >> K;
int cnt;
std::vector<int> L(1000);
cnt = 0;
int j;
j = 0;
for (int i = 1; i < 100; i++) {
if (A % i == 0 && B % i == 0) {
L[j] = i;
j++;
}
}
printf("%d", L[K - 1]);
} | #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
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
int A, B, K;
std::cin >> A >> B >> K;
int cnt;
std::vector<int> L(1000);
cnt = 0;
int j;
j = 1;
for (int i = 1; i < 101; i++) {
if (A % i == 0 && B % i == 0) {
L[j] = i;
j++;
}
}
printf("%d\n", L[j - K]);
/*
for(int i=1;i<101;i++){
printf("%d\n",L[i]);
}
*/
} | [
"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).end()
#define ASC(v) sort(ALL(v));
#define DESC(v) sort(ALL(v), greater<int>());
#define UNIQ(a) \
sort(ALL(a)); \
(a).resize(unique(ALL(a)) - a.begin());
#define PRINTD(x, d) cout << fixed << setprecision(d) << x << "\n";
#define DEBUG(x) cout << #x << ": " << x << "\n"
const double PI = acos(-1);
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
bool isprime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
int digsum(int n) {
int r = 0;
while (n > 0) {
r += n % 10;
n /= 10;
}
return r;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void rcmb(ll *x, ll s, ll r, function<void(ll *)> f) {
if (r == 0) {
f(x);
} else {
if (s < 0)
return;
rcmb(x, s - 1, r, f);
x[r - 1] = s;
rcmb(x, s - 1, r - 1, f);
}
}
void cmb(ll n, ll k, function<void(ll *)> f) {
ll x[k];
rcmb(x, n - 1, k, f);
}
void prm(ll n, function<void(ll *)> f) {
ll x[n];
for (ll i = 0; i < n; i++)
x[i] = i;
do {
f(x);
} while (next_permutation(x, x + n));
}
void prm(ll n, ll k, function<void(ll *)> f) {
cmb(n, k, [&](ll *c) {
prm(k, [&](ll *p) {
ll x[k];
for (ll i = 0; i < k; i++) {
x[i] = c[p[i]];
}
f(x);
});
});
}
// prm(4, 2, [](ll *x){ cout << x[0] << "," << x[1] << "\n"; });
void solve(long long A, long long B, long long K) {
ll res = 0;
ll i = 1;
ll c = 0;
while (res < K) {
if (A % i == 0 && B % i == 0) {
res = i;
c++;
}
i++;
}
cout << res << "\n";
}
int main() {
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long K;
scanf("%lld", &K);
solve(A, B, K);
return 0;
}
| #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).end()
#define ASC(v) sort(ALL(v));
#define DESC(v) sort(ALL(v), greater<int>());
#define UNIQ(a) \
sort(ALL(a)); \
(a).resize(unique(ALL(a)) - a.begin());
#define PRINTD(x, d) cout << fixed << setprecision(d) << x << "\n";
#define DEBUG(x) cout << #x << ": " << x << "\n"
const double PI = acos(-1);
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
bool isprime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
int digsum(int n) {
int r = 0;
while (n > 0) {
r += n % 10;
n /= 10;
}
return r;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void rcmb(ll *x, ll s, ll r, function<void(ll *)> f) {
if (r == 0) {
f(x);
} else {
if (s < 0)
return;
rcmb(x, s - 1, r, f);
x[r - 1] = s;
rcmb(x, s - 1, r - 1, f);
}
}
void cmb(ll n, ll k, function<void(ll *)> f) {
ll x[k];
rcmb(x, n - 1, k, f);
}
void prm(ll n, function<void(ll *)> f) {
ll x[n];
for (ll i = 0; i < n; i++)
x[i] = i;
do {
f(x);
} while (next_permutation(x, x + n));
}
void prm(ll n, ll k, function<void(ll *)> f) {
cmb(n, k, [&](ll *c) {
prm(k, [&](ll *p) {
ll x[k];
for (ll i = 0; i < k; i++) {
x[i] = c[p[i]];
}
f(x);
});
});
}
// prm(4, 2, [](ll *x){ cout << x[0] << "," << x[1] << "\n"; });
void solve(long long A, long long B, long long K) {
ll res = 0;
ll i = 100;
ll c = 0;
while (c < K) {
if (A % i == 0 && B % i == 0) {
res = i;
c++;
}
i--;
}
cout << res << "\n";
}
int main() {
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long K;
scanf("%lld", &K);
solve(A, B, K);
return 0;
}
| [
"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 - 1) << endl;
} | #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(yakusu.size() - k) << endl;
} | [
"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 long long ll;
int gcd(int a, int b) {
int ma = max(a, b);
int mi = min(a, b);
if (ma % mi == 0) {
return mi;
} else {
return gcd(mi, ma % mi);
}
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int C = gcd(A, B);
int itr = 0;
vector<int> vec; //約数を列挙
for (int i = 1; i <= sqrt(C); i++) {
if (C % i == 0) {
vec.push_back(i);
itr++;
}
}
REPR(i, itr - 1) { vec.push_back(C / vec[i]); }
if (vec[itr - 1] == vec[itr]) {
vec.erase(vec.begin() + itr);
}
/*REP(i,vec.size()){
cout << vec[i] << endl;
}*/
cout << vec[K - 1] << endl;
} | #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 long long ll;
int gcd(int a, int b) {
int ma = max(a, b);
int mi = min(a, b);
if (ma % mi == 0) {
return mi;
} else {
return gcd(mi, ma % mi);
}
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int C = gcd(A, B);
int itr = 0;
vector<int> vec; //約数を列挙
for (int i = 1; i <= sqrt(C); i++) {
if (C % i == 0) {
vec.push_back(i);
itr++;
}
}
REPR(i, itr - 1) { vec.push_back(C / vec[i]); }
if (vec[itr - 1] == vec[itr]) {
vec.erase(vec.begin() + itr);
}
/*REP(i,vec.size()){
cout << vec[i] << endl;
}*/
cout << vec[vec.size() - K] << endl;
} | [
"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;
int cnt = 1;
int q = euclidean_gcd(a, b);
int z = 0;
rep(i, q) {
int y = i + 1;
if (q % y == 0) {
z++;
if (z == k)
cout << y << endl;
}
}
}
| #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;
int cnt = 1;
int q = euclidean_gcd(a, b);
int z = 0;
rep(i, q) {
int y = q - i;
if (q % y == 0) {
z++;
if (z == k)
cout << y << endl;
}
}
}
| [
"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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = min(a, b);
int cnt = 0;
int ans = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
ans = i + 1;
break;
}
}
cout << ans;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // 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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = min(a, b);
int cnt = 0;
int ans = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
ans = i;
break;
}
}
cout << ans;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"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 main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> c;
_rep(i, 1, max(a, b)) {
if (a % i == 0 && b % i == 0)
c.push_back(i);
}
print(c[c.size() - k]);
}
| #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 main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> c;
_rep(i, 1, max(a, b) + 1) {
if (a % i == 0 && b % i == 0)
c.push_back(i);
}
print(c[c.size() - k]);
}
| [
"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 EPS 1e-10
using namespace std;
typedef long long ll;
#pragma endregion
int main() {
int A, B, K;
vector<int> d;
cin >> A >> B >> K;
repc(i, 1, max(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
d.push_back(i);
}
}
cout << d.at(K - 1) << endl;
}
| #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 EPS 1e-10
using namespace std;
typedef long long ll;
#pragma endregion
int main() {
int A, B, K;
vector<int> d;
cin >> A >> B >> K;
reprc(i, max(A, B) + 1, 0) {
if (A % i == 0 && B % i == 0) {
d.push_back(i);
}
}
cout << d.at(K - 1) << endl;
}
| [
"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 = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> gcd;
int mx = max(a, b);
for (int i = 1; i < mx; i++) {
if (a % i == 0 && b % i == 0) {
gcd.push_back(i);
}
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
}
| #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 = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> gcd;
int mx = max(a, b);
for (int i = 1; i <= mx; i++) {
if (a % i == 0 && b % i == 0) {
gcd.push_back(i);
}
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
}
| [
"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)) {
if (a % i == 0 && b % i == 0) {
v.at(now) = i;
now++;
}
}
sort(all(v));
reverse(all(v));
cout << v.at(k - 1);
}
| #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) + 1) {
if (a % i == 0 && b % i == 0) {
v.at(now) = i;
now++;
}
}
sort(all(v));
reverse(all(v));
cout << v.at(k - 1);
}
| [
"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)) {
if (a % i == 0 && b % 1 == 0) {
v.at(now) = i;
now++;
}
}
sort(all(v));
reverse(all(v));
cout << v.at(k - 1);
}
| #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) + 1) {
if (a % i == 0 && b % i == 0) {
v.at(now) = i;
now++;
}
}
sort(all(v));
reverse(all(v));
cout << v.at(k - 1);
}
| [
"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 main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
int ans = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
ans = i + 1;
break;
}
}
cout << ans << endl;
}
| #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 main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
int ans = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
}
if (cnt == k) {
ans = i;
break;
}
}
cout << ans << endl;
}
| [
"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, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int a, b, k;
cin >> a >> b >> k;
int cou = 0;
for (int i = 1;; i++) {
if (a % i == 0 && b % i == 0) {
cou++;
if (cou == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| #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, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int a, b, k;
cin >> a >> b >> k;
int cou = 0;
for (int i = a * b;; i--) {
if (a % i == 0 && b % i == 0) {
cou++;
if (cou == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| [
"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 i = 1, ct = 0;
vector<int> ans{1};
if (a == 1 || b == 1) {
cout << 1 << endl;
return 0;
}
do {
i++;
if (a % i == 0 && b % i == 0) {
ct++;
ans.push_back(i);
}
} while (i != a && i != b);
cout << ans[ct - k - 1] << endl;
return 0;
} | #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 i = 1, ct = 0;
vector<int> ans{1};
if (a == 1 || b == 1) {
cout << 1 << endl;
return 0;
}
do {
i++;
if (a % i == 0 && b % i == 0) {
ct++;
ans.push_back(i);
}
} while (i != a && i != b);
cout << ans[ct - k + 1] << endl;
return 0;
} | [
"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 i = 1, ct = 0;
vector<int> ans;
if (a == 1 || b == 1) {
cout << 1 << endl;
return 0;
}
do {
i++;
if (a % i == 0 && b % i == 0) {
ct++;
ans.push_back(i);
}
} while (i != a && i != b);
cout << ans[ct - k] << endl;
return 0;
} | #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 i = 1, ct = 0;
vector<int> ans{1};
if (a == 1 || b == 1) {
cout << 1 << endl;
return 0;
}
do {
i++;
if (a % i == 0 && b % i == 0) {
ct++;
ans.push_back(i);
}
} while (i != a && i != b);
cout << ans[ct - k + 1] << endl;
return 0;
} | [
"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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[k - 1]);
return 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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[count - k]);
return 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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[k - 1]);
return 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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[count - k]);
return 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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[k - 1]);
return 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) {
ans[count] = i;
count++;
}
}
printf("%d\n", ans[count - k]);
return 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).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int answer = 0;
int cnt = 0;
while (cnt < K) {
answer++;
if (A % answer == 0 && B % answer == 0) {
cnt++;
}
}
cout << answer << endl;
return 0;
} | #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).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int answer = 101;
int cnt = 0;
while (cnt < K) {
answer--;
if (A % answer == 0 && B % answer == 0) {
cnt++;
}
}
cout << answer << endl;
return 0;
} | [
"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) {
count++;
if (count == k) {
cout << i << endl;
return 0;
}
}
}
return 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) {
count++;
if (count == 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,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>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
#define pre cout << fixed << setprecision(10);
#define umap unordered_map
#define uset unordered_set
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
int main() {
fast
int a,
b, c;
cin >> a >> b >> c;
int gcd = __gcd(a, b);
vi v;
int i = 1;
for (; i * i < gcd; i++) {
if (gcd % i == 0) {
v.pb(i);
v.pb(gcd / i);
}
}
if (i * i == gcd)
v.pb(i);
sort(all(v));
cout << v[c - 1];
return 0;
} | #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>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
#define pre cout << fixed << setprecision(10);
#define umap unordered_map
#define uset unordered_set
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
int main() {
fast
int a,
b, c;
cin >> a >> b >> c;
int gcd = __gcd(a, b);
vi v;
int i = 1;
for (; i * i < gcd; i++) {
if (gcd % i == 0) {
v.pb(i);
v.pb(gcd / i);
}
}
if (i * i == gcd)
v.pb(i);
sort(all(v));
cout << v[v.sze - c];
return 0;
} | [
"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;
}
}
cout << quotients[index - k];
return 0;
} | #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;
}
}
cout << quotients[index - k];
return 0;
} | [
"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 << quotients[index - k];
return 0;
} | #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;
}
}
cout << quotients[index - k];
return 0;
} | [
"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 << array[index - divisor];
} | #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;
}
}
cout << array[index - divisor];
} | [
"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) {
if (A % i == 0 && B % i == 0) {
v.push_back(i);
}
}
// for (vector<int>::iterator it = v.begin(); it != v.end(); ++it) {
// cout << (*it) << endl;
// }
printf("%d\n", v[K - 1]);
return 0;
}
| #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) {
if (A % i == 0 && B % i == 0) {
v.push_back(i);
}
}
// for (vector<int>::iterator it = v.begin(); it != v.end(); ++it) {
// cout << (*it) << endl;
// }
printf("%d\n", v[v.size() - K]);
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"
] | 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;
return 0;
}
}
}
} | #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;
return 0;
}
}
}
} | [
"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, k;
cin >> a >> b >> k;
int ans = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
ans++;
if (ans == k)
cout << i << endl;
}
} | #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, k;
cin >> a >> b >> k;
int ans = 0;
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
ans++;
if (ans == k) {
cout << i << endl;
break;
}
}
} | [
"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 << vec[K - 1] << endl;
} | // 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 << vec[vec.size() - K] << endl;
} | [
"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;
count++;
}
}
cout << div1[K - 1] << endl;
} | #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;
count++;
}
}
cout << div1[count - K] << endl;
} | [
"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;
count++;
}
}
cout << div1[K - 1] << endl;
} | #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;
count++;
}
}
cout << div1[count - K] << endl;
} | [
"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
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= 100; ++i) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i << endl;
break;
}
}
}
| #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
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i <= 100; --i) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
break;
}
}
}
| [
"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 << endl;
} | [
"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--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
} | #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--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
} | [
"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--) {
if (a % i == 0 && b / i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
} | #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--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
} | [
"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(0); \
cout.tie(0); // Thanks Joshua :)
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
need_for_speed;
int a, b, c;
cin >> a >> b >> c;
int res = 0;
for (int i = 1; i <= 100000 && c; i++)
if (a % i == 0 && b % i == 0)
--c, res = i;
cout << res << endl;
} | /*
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(0); \
cout.tie(0); // Thanks Joshua :)
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
need_for_speed;
int a, b, c;
cin >> a >> b >> c;
int res = 0;
for (int i = 100; i >= 1 && c; i--)
if (a % i == 0 && b % i == 0)
--c, res = i;
cout << res << endl;
} | [
"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;
return 0;
} | #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 0;
} | [
"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> c;
for (int k = 0; k < a.size(); k++) {
for (int l = 0; l < b.size(); l++) {
if (a.at(k) == b.at(l)) {
c.push_back(a.at(k));
}
}
}
cout << c.at(K - 1) << endl;
}
| #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> c;
for (int k = 0; k < a.size(); k++) {
for (int l = 0; l < b.size(); l++) {
if (a.at(k) == b.at(l)) {
c.push_back(a.at(k));
}
}
}
cout << c.at(c.size() - K) << endl;
}
| [
"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())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
vector<int> yaku;
int wrk;
cin >> A >> B >> K;
wrk = (A < B) ? A : B;
for (int i = 1; i < wrk + 1; i++) {
if (A % i == 0 && B % i == 0) {
yaku.push_back(i);
}
}
sort(yaku.begin(), yaku.end());
cout << yaku[K - 1] << endl;
return 0;
} |
#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())
#define Sum(a) accumulate(a.begin(), a.end(), 0)
#define REP(i, n) for (UI i = 0; i < n; i++)
#define REPR(i, n) for (UI i = n; i >= 0; i--)
#define FOR(i, m, n) for (UI i = m; i < n; i++)
#define pb(i) push_back(i)
#define MOD (LL)1e9 + 7;
#define INF (LL)1 << 62;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
vector<int> yaku;
int wrk;
cin >> A >> B >> K;
wrk = (A < B) ? A : B;
for (int i = 1; i < wrk + 1; i++) {
if ((A % i == 0) && (B % i == 0)) {
yaku.push_back(i);
}
}
sort(yaku.rbegin(), yaku.rend());
cout << yaku[K - 1] << endl;
return 0;
}
| [
"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) \
for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define WHATIS(x) cout << #x << " is " << x << endl;
#define ERROR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
//__builtin_ffs(x) return 1 + index of least significant 1-bit of x
//__builtin_clz(x) return number of leading zeros of x
//__builtin_ctz(x) return number of trailing zeros of x
using namespace std;
using ll = long long;
using ld = double;
typedef pair<int, int> II;
typedef pair<ll, II> III;
typedef complex<ld> cd;
typedef vector<cd> vcd;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const ll MODBASE = 1000000007LL;
const int MAXN = 100010;
const int MAXM = 110;
const int MAXK = 510;
int a, b, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cin >> a >> b >> k;
FOR(i, 1, min(a, b)) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i;
break;
}
}
}
return 0;
} | #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) \
for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define WHATIS(x) cout << #x << " is " << x << endl;
#define ERROR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
//__builtin_ffs(x) return 1 + index of least significant 1-bit of x
//__builtin_clz(x) return number of leading zeros of x
//__builtin_ctz(x) return number of trailing zeros of x
using namespace std;
using ll = long long;
using ld = double;
typedef pair<int, int> II;
typedef pair<ll, II> III;
typedef complex<ld> cd;
typedef vector<cd> vcd;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const ll MODBASE = 1000000007LL;
const int MAXN = 100010;
const int MAXM = 110;
const int MAXK = 510;
int a, b, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cin >> a >> b >> k;
FORE(i, min(a, b), 1) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i;
break;
}
}
}
return 0;
} | [
"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;
}
}
}
return 0;
} | #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;
}
}
}
return 0;
} | [
"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 < (int)c; ++a)
#define cd(a, b, c) for (int a = (b)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAXN 52
#define MAXH 20
#define MAXM 52
#define INF 100000000
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.1415926535897932384626433
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
fu(i, 1, min(a, b)) {
if (a % i == 0 && b % i == 0)
++cnt;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| #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 < (int)c; ++a)
#define cd(a, b, c) for (int a = (b)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAXN 52
#define MAXH 20
#define MAXM 52
#define INF 100000000
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.1415926535897932384626433
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
fd(i, min(a, b), 1) {
if (a % i == 0 && b % i == 0)
++cnt;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| [
"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 < (int)c; ++a)
#define cd(a, b, c) for (int a = (b)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAXN 52
#define MAXH 20
#define MAXM 52
#define INF 100000000
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.1415926535897932384626433
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
cu(i, 1, min(a, b)) {
if (a % i == 0 && b % i == 0)
++cnt;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| #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 < (int)c; ++a)
#define cd(a, b, c) for (int a = (b)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAXN 52
#define MAXH 20
#define MAXM 52
#define INF 100000000
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.1415926535897932384626433
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
fd(i, min(a, b), 1) {
if (a % i == 0 && b % i == 0)
++cnt;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
| [
"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) {
vl ret;
for (ll i = 0; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
//これ入れたらオーダーちょい上がる
sort(ret.begin(), ret.end());
return ret;
}
//ユークリッドの互除法 ラメの定理よりO(log N)
//使い方
//整数a,bを渡すと最小公倍数を返す
ll gcd(ll a, ll b) {
ll q = max(a, b);
ll r = min(a, b);
while (r) {
ll t = q;
q = r;
r = t % r;
}
return q;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll d = gcd(a, b);
vl ngo = divisor(d);
cout << ngo[ngo.size() - 1 - (k - 1)] << endl;
} | #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) {
vl ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
//これ入れたらオーダーちょい上がる
sort(ret.begin(), ret.end());
return ret;
}
//ユークリッドの互除法 ラメの定理よりO(log N)
//使い方
//整数a,bを渡すと最小公倍数を返す
ll gcd(ll a, ll b) {
ll q = max(a, b);
ll r = min(a, b);
while (r) {
ll t = q;
q = r;
r = t % r;
}
return q;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll d = gcd(a, b);
vl ngo = divisor(d);
cout << ngo[ngo.size() - 1 - (k - 1)] << endl;
} | [
"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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
int sum = 0;
vector<int> v;
while (t--) {
int a, b, k;
cin >> a >> b >> k;
int i;
for (i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
v.pb(i);
}
int n = v.size();
cout << v[n - 4];
}
}
| #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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
int sum = 0;
vector<int> v;
while (t--) {
int a, b, k;
cin >> a >> b >> k;
int i;
for (i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
v.pb(i);
}
int n = v.size();
cout << v[n - k];
}
}
| [
"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.size();
l = l - k;
cout << c[l];
return 0;
} | #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.size();
l = l - k;
cout << c[l];
return 0;
}
| [
"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::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
vector<int> ans;
for (int i = 1; i <= min(a, b); ++i) {
if (a % i == 0 && b % i == 0)
ans.push_back(i);
}
cout << ans[c - 1] << endl;
return 0;
}
| /*
* 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::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, c;
cin >> a >> b >> c;
vector<int> ans;
for (int i = 1; i <= min(a, b); ++i) {
if (a % i == 0 && b % i == 0)
ans.push_back(i);
}
cout << ans[ans.size() - c] << endl;
return 0;
}
| [
"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 << ans << endl;
return 0;
} | #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 << ans << endl;
return 0;
} | [
"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 == k) {
ans = num[i];
}
}
}
cout << ans << endl;
}
| #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 == k) {
ans = num[i];
}
}
}
cout << ans << endl;
} | [
"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 << V[k - 1] << endl;
return 0;
} | #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 << V[K - 1] << endl;
return 0;
} | [
"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 0;
} | #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 0;
} | [
"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.push_back(i);
}
vector<int> v(0);
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j])
v.push_back(a[i]);
}
}
reverse(v.begin(), v.end());
if (v.size() == 1)
cout << v[1];
else
cout << v[K - 1];
cout << endl;
return 0;
} | #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.push_back(i);
}
vector<int> v(0);
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j])
v.push_back(a[i]);
}
}
reverse(v.begin(), v.end());
if (v.size() == 1)
cout << v[0];
else
cout << v[K - 1];
cout << endl;
return 0;
} | [
"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 << 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,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.