problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03103 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
long long N, M, a, b;
cin >> N >> M;
std::map<long long, long long> mp;
for (int n = 0; n < N; ++n) {
cin >> a >> b;
mp.insert(make_pair(a, b));
}
long long sum{0};
long long bought{0};
... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
long long N, M, a, b;
cin >> N >> M;
std::multimap<long long, long long> mp;
for (int n = 0; n < N; ++n) {
cin >> a >> b;
mp.insert(make_pair(a, b));
}
long long sum{0};
long long bought{0... | [] | 914,157 | 914,158 | u603356062 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> valAmount(N);
for (int i = 0; i < N; i++) {
cin >> valAmount[i].first;
cin >> valAmount[i].second;
}
sort(valAmount.begin(), valAmount.end());
for (int i = 0; i < N; i++) {
// cout << val... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, long>> valAmount(N);
for (int i = 0; i < N; i++) {
cin >> valAmount[i].first;
cin >> valAmount[i].second;
}
sort(valAmount.begin(), valAmount.end());
for (int i = 0; i < N; i++) {
// cout << v... | [
"variable_declaration.type.primitive.change"
] | 914,167 | 914,166 | u204973596 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> vec(100010);
for (int i = 0; i < N; i++)
cin >> vec.at(i).first >> vec.at(i).second;
sort(vec.begin(), vec.end());
ll ans = 0, m = M;
for (int i = 0; i < N; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> vec(100010);
for (int i = 0; i < N; i++)
cin >> vec.at(i).first >> vec.at(i).second;
sort(vec.begin(), vec.begin() + N);
ll ans = 0, m = M;
for (int i = 0; i < N; i++) {
... | [
"call.function.change",
"call.arguments.change"
] | 914,168 | 914,169 | u508571192 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
long a, b;
long count = 0;
long accum = 0;
typedef pair<int, int> pair;
vector<pair> vec;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
auto p = make_pair(a, b);
vec.push_back(p);
}
std::sort(vec.begi... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
long a, b;
long count = 0;
long accum = 0;
typedef pair<long, long> pair;
vector<pair> vec;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a >> b;
auto p = make_pair(a, b);
vec.push_back(p);
}
std::sort(vec.be... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 914,170 | 914,171 | u771365068 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (1e9 + 7)
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, m;
cin >> n >> m;
vector<pii> ab;
int a, b;
for (int i = 0; i < ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (1e9 + 7)
#define pb push_back
#define int long long
using namespace std;
typedef pair<int, int> pii;
signed main() {
int n, m;
cin >> n >> m;
vector<pii> ab;
int a, ... | [
"variable_declaration.type.primitive.change"
] | 914,173 | 914,174 | u733823138 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> ED(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long long, int>> ED(N);
for (int i = 0; i < N; i++) {
int a, b;
cin ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 914,175 | 914,176 | u230414490 | cpp |
p03103 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"variable_declaration.type.change"
] | 914,179 | 914,180 | u511379665 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> data_t;
int main() {
long long N, M, i, baikai, count, sum;
cin >> N >> M;
vector<data_t> data_array(N);
for (i = 0; i < N; i++) {
cin >> data_array[i].first >> data_array[i].second;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> data_t;
int main() {
long long N, M, i, baikai, count, sum;
cin >> N >> M;
vector<data_t> data_array(N);
for (i = 0; i < N; i++) {
cin >> data_array[i].first >> data_array[i].... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 914,183 | 914,184 | u059790365 | cpp |
p03103 | #include <iostream>
#include <map>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
map<int, int> arr;
long A, B;
for (int i = 0; i < N; ++i) {
cin >> A >> B;
arr[A] = B;
}
long total = 0;
long money = 0;
/*
for(const auto& [key,value]:arr){
if (total+value>=M){
... | #include <iostream>
#include <map>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
map<long, long> arr;
long A, B;
for (int i = 0; i < N; ++i) {
cin >> A >> B;
arr[A] += B; //同じ金額のジュースが別店で売られていたら和をとっていく
}
long total = 0;
long money = 0;
for (auto itr = arr.begin(); itr != arr.end(... | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 914,187 | 914,186 | u860546679 | cpp |
p03103 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<long long, long long> drink;
long long A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
drink[A] = B;
}
long long res = 0;
for (auto i = drink.begin(); i != drink.end(); i++) {
long long co... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<long long, long long> drink;
long long A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
drink[A] += B;
}
long long res = 0;
for (auto i = drink.begin(); i != drink.end(); i++) {
long long c... | [
"assignment.value.change"
] | 914,194 | 914,195 | u483747145 | cpp |
p03103 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<long long, long long> drink;
long long A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
drink[A] = B;
}
long long res = 0;
for (auto i = drink.begin(); i != drink.end(); i++) {
auto cost = ... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<long long, long long> drink;
long long A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
drink[A] += B;
}
long long res = 0;
for (auto i = drink.begin(); i != drink.end(); i++) {
long long c... | [
"assignment.value.change",
"variable_declaration.type.widen.change"
] | 914,196 | 914,195 | u483747145 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" \
<< "\n"
using namespace std;
const ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" \
<< "\n"
using namespace std;
const ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 914,197 | 914,198 | u628262476 | cpp |
p03103 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<pair<ll, ll>> ab;
ll N, M;
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
ll tmp, tmp2;
cin >> tmp >> tmp2;
ab.push_back(make_pair(tmp, tmp2));
}
sort(ab.begin(), ab.end());
ll ans = 0;
for (int i = 0; i < N;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<pair<ll, ll>> ab;
ll N, M;
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
ll tmp, tmp2;
cin >> tmp >> tmp2;
ab.push_back(make_pair(tmp, tmp2));
}
sort(ab.begin(), ab.end());
ll ans = 0;
for (int i = 0; i < N;... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 914,199 | 914,200 | u628262476 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, i, j, need_cans;
long ans = 0;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (i = 0; i < N; ++i) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.end(), [](const pair<int, int> a, const... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, i, j, need_cans;
long ans = 0;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (i = 0; i < N; ++i) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.end(), [](const pair<int, int> a, const... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 914,201 | 914,202 | u346891539 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<vector<long>> A;
A = vector<vector<long>>(N, vector<long>(2, 0));
for (int i = 0; i < N; i++) {
cin >> A[i][0] >> A[i][1];
}
sort(A.b... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<vector<long>> A;
A = vector<vector<long>>(N, vector<long>(2, 0));
for (int i = 0; i < N; i++) {
cin >> A[i][0] >> A[i][1];
}
sort(A.b... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 914,205 | 914,206 | u238353279 | cpp |
p03103 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [
"control_flow.break.add"
] | 914,209 | 914,210 | u332843157 | cpp |
p03103 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <stdio.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.e... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <stdio.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 914,211 | 914,212 | u332843157 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) \
; \
for ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) \
; \
for ... | [
"variable_declaration.type.change"
] | 914,225 | 914,226 | u478997153 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0... | [
"variable_declaration.type.change",
"call.add"
] | 914,227 | 914,228 | u153846982 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
//ループ, 0からn-1までのn個
#define rep1(i, n) for (int i = 1; i <= (n); i++)
//ループ, 1からnまでのn個
#define co(x) cout << (x) << "\n"
//出力
#define cosp(x) cout << (x) << " "
//?
#define ce(x) cerr << (x) << "\n"
//... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
//ループ, 0からn-1までのn個
#define rep1(i, n) for (int i = 1; i <= (n); i++)
//ループ, 1からnまでのn個
#define co(x) cout << (x) << "\n"
//出力
#define cosp(x) cout << (x) << " "
//?
#define ce(x) cerr << (x) << "\n"
//... | [
"variable_declaration.type.change"
] | 914,229 | 914,230 | u659712326 | cpp |
p03103 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A;
cin >> B;
pairs[i] = make_pair(A, B);
}
sort(pairs.begin(... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, int>> pairs(N);
for (int i = 0; i < N; i++) {
long A;
int B;
cin >> A;
cin >> B;
pairs[i] = make_pair(A, B);
}
sort(pa... | [
"variable_declaration.type.primitive.change"
] | 914,233 | 914,234 | u712993629 | cpp |
p03103 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A;
cin >> B;
pairs[i] = make_pair(A, B);
}
sort(pairs.begin(... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, int>> pairs(N);
for (int i = 0; i < N; i++) {
long A;
int B;
cin >> A;
cin >> B;
pairs[i] = make_pair(A, B);
}
sort(pa... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 914,235 | 914,234 | u712993629 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [] | 914,252 | 914,253 | u043443359 | cpp |
p03103 | #include <algorithm>
#include <iostream>
using namespace std;
class PandC {
public:
int p;
int c;
};
int main() {
int N, M;
cin >> N >> M;
PandC pc_list[N];
for (int i = 0; i < N; i++) {
cin >> pc_list[i].p >> pc_list[i].c;
}
int answer = 0;
sort(pc_list, pc_list + N,
[](const PandC &x... | #include <algorithm>
#include <iostream>
using namespace std;
class PandC {
public:
long p;
long c;
};
int main() {
long N, M;
cin >> N >> M;
PandC pc_list[N];
for (int i = 0; i < N; i++) {
cin >> pc_list[i].p >> pc_list[i].c;
}
long answer = 0;
sort(pc_list, pc_list + N,
[](const Pand... | [
"variable_declaration.type.primitive.change"
] | 914,254 | 914,255 | u179987763 | cpp |
p03103 | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | [
"identifier.change"
] | 914,264 | 914,265 | u453412459 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n), B(n);
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; i++) {
AB... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n), B(n);
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; i++) {
AB... | [
"type_conversion.add"
] | 914,266 | 914,267 | u377032133 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n), B(n);
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; i++) {
AB... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n), B(n);
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; i++) {
AB... | [
"assignment.value.change"
] | 914,268 | 914,267 | u377032133 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
struct node {
int a, b;
} Node[N];
bool cmp(node a, node b) { return a.a < b.a; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d%d", &Node[i].a, &Node[i].b);
}
sort(Node, ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
struct node {
ll a, b;
} Node[N];
bool cmp(node a, node b) { return a.a < b.a; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &Node[i].a, &Node[i].b);
}
sort(Nod... | [
"literal.string.change",
"call.arguments.change"
] | 914,271 | 914,272 | u566185387 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
struct node {
int a, b;
} Node[N];
bool cmp(node a, node b) { return a.a < b.a; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d%d", &Node[i].a, &Node[i].b);
}
sort(Node, ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
struct node {
ll a, b;
} Node[N];
bool cmp(node a, node b) { return a.a < b.a; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &Node[i].a, &Node[i].b);
}
sort(Nod... | [
"literal.string.change",
"call.arguments.change"
] | 914,273 | 914,272 | u566185387 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
// ペアにしたいんだな
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; ++i) {
AB[i] = make_pair(A[i], B... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
// AとBを関連付ける
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; ++i) {
AB[i] = make_pair(A[i], B[... | [] | 914,274 | 914,275 | u318150500 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
// ペアにしたいんだな
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; ++i) {
AB[i] = make_pair(A[i], B... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
// ペアにしたいんだな
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; ++i) {
AB[i] = make_pair(A[i], B... | [] | 914,274 | 914,276 | u318150500 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
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... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
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... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 914,319 | 914,320 | u088751997 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int j = 0;
while (i != K) {
j++;
if (A % j == 0 && B % j == 0) {
i++;
}
}
cout << j << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int j = A + 1;
while (i != K) {
j--;
if (A % j == 0 && B % j == 0) {
i++;
}
}
cout << j << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 914,321 | 914,322 | u934462215 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int j = 0;
while (i != K) {
j++;
if (A % j == 0 && B % j == 0) {
i++;
}
}
cout << j << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int j = A + 1;
while (i != K) {
j--;
if (A % j == 0 && B % j == 0) {
i++;
}
}
cout << j << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 914,323 | 914,322 | u934462215 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
if (a > b) {
swap(a, b);
}
rep(i, 1, a + 1) {
if (a % i == 0 && b % i == 0) {
// cout << i << endl;
ans.pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
if (a > b) {
swap(a, b);
}
rep(i, 1, a + 1) {
if (a % i == 0 && b % i == 0) {
// cout << i << endl;
ans.pus... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,324 | 914,325 | u134896569 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X <= A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = Y;
break;
}
}
}
cout << Z << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X <= A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = X;
break;
}
}
}
cout << Z << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 914,326 | 914,327 | u740002394 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X > 0; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = Y;
break;
}
}
}
cout << Z << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X <= A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = X;
break;
}
}
}
cout << Z << endl;
} | [
"control_flow.loop.for.condition.change",
"assignment.value.change",
"identifier.change"
] | 914,328 | 914,327 | u740002394 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X < A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = Y;
break;
}
}
}
cout << Z << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X <= A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = X;
break;
}
}
}
cout << Z << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 914,330 | 914,327 | u740002394 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X < A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = Y;
break;
}
}
}
cout << Z << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, Z;
int Y = 0;
cin >> A >> B >> K;
for (int X = A; X <= A; X--) {
if (A % X == 0 && B % X == 0) {
Y++;
if (Y == K) {
Z = X;
break;
}
}
}
cout << Z << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 914,331 | 914,327 | u740002394 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | [
"expression.operation.binary.add"
] | 914,357 | 914,358 | u709144111 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 914,359 | 914,358 | u709144111 | cpp |
p03106 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 914,362 | 914,361 | u709144111 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,378 | 914,379 | u874081650 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int sum = K;
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && B % i == 0) {
sum--;
}
if (sum == K) {
cout << i;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int sum = K;
for (int i = min(A, B); i >= 1; i--) {
if (A % i == 0 && B % i == 0) {
sum--;
}
if (sum == 0) {
cout << i;
return 0;
}
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 914,384 | 914,385 | u109191542 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
... | [] | 914,390 | 914,391 | u306035287 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, nm = 0;
cin >> a >> b >> k;
int i = min(a, b);
while (k != nm) {
if (a % i == 0 && b % i == 0) {
nm++;
}
i--;
}
cout << i << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, nm = 0;
cin >> a >> b >> k;
int i = min(a, b);
while (k != nm) {
if (a % i == 0 && b % i == 0) {
nm++;
}
i--;
}
cout << i + 1 << endl;
}
| [
"expression.operation.binary.add"
] | 914,413 | 914,414 | u834753207 | cpp |
p03106 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = 1;
int cnt = 1;
while (cnt != k) {
ans += 1;
if ((a % ans == 0) && (b % ans == 0)) {
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = 101;
int cnt = 0;
while (cnt != k) {
ans -= 1;
if ((a % ans == 0) && (b % ans == 0)) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.change"
] | 914,424 | 914,425 | u549383771 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> D(100);
for (int i = 1; i <= 100; i++) {
if (A % i == 0 && B % i == 0)
D[i] == i;
}
sort(D.begin(), D.end());
reverse(D.begin(), D.end());
cout << D[K - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> D(110);
for (int i = 1; i <= 100; i++) {
if (A % i == 0 && B % i == 0) {
D[i] = i;
}
}
sort(D.begin(), D.end());
reverse(D.begin(), D.end());
cout << D[K - 1] << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 914,428 | 914,427 | u279848598 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int num = 100;
do {
if (A % num == 0 && B % num == 0)
i++;
else
num--;
} while (i == K);
cout << num << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = 0;
int num = 100;
do {
if (A % num == 0 && B % num == 0)
i++;
num--;
} while (i != K);
cout << num + 1 << endl;
return 0;
} | [
"control_flow.branch.else.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 914,432 | 914,433 | u568877271 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - k) << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 914,434 | 914,435 | u231354686 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int A, B, K;
cin >> A >> B >> K;
rep(i, 99) {
if (A % (100 - i) == 0 && B % (100 - i) == 0) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int A, B, K;
cin >> A >> B >> K;
rep(i, 100) {
if (A % (100 - i) == 0 && B % (100 - i) == 0) ... | [
"literal.number.change",
"call.arguments.change"
] | 914,436 | 914,437 | u983563612 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = max(a, b);
int x[n] = {0};
int j = 0;
for (int i = 1; i < n; i++) {
if (a % i == 0 && b % i == 0) {
x[j] = i;
j++;
}
}
sort(x, n ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = min(a, b);
int x[n] = {0};
int j = 0;
for (int i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
x[j] = i;
j++;
}
}
sort(x, n... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,456 | 914,457 | u318661636 | cpp |
p03106 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | [
"identifier.change",
"call.function.change"
] | 914,458 | 914,459 | u244839008 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define ll long long
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define ll long long
#define rep(i, n) for (int i = 0; i <... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,460 | 914,461 | u350766567 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
int ans = 0;
for (int i = 0; i < 100; ++i) {
int j = 100 - i;
if (a % j == 0 && b % j == 0) {
cnt++;
}
if (cnt == k)
ans = j;
break;
}
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
int ans = 0;
for (int i = 0; i < 100; ++i) {
int j = 100 - i;
if (a % j == 0 && b % j == 0) {
cnt++;
}
if (cnt == k) {
ans = j;
break;
}
}
cout << ans << endl;
... | [] | 914,462 | 914,463 | u782700818 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ad, bd;
for (int i = 1; i <= a; i++) {
if (a % i == 0)
ad.push_back(i);
}
for (int i = 1; i <= b; i++) {
if (b % i == 0)
bd.push_back(i);
}
ad.insert(ad.end(), bd.begin(), bd.en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ad, bd;
for (int i = 1; i <= a; i++) {
if (a % i == 0)
ad.push_back(i);
}
for (int i = 1; i <= b; i++) {
if (b % i == 0)
bd.push_back(i);
}
ad.insert(ad.end(), bd.begin(), bd.en... | [
"call.arguments.change"
] | 914,472 | 914,473 | u528258842 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0) {
vec.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0) {
vec.push_ba... | [
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,474 | 914,475 | u127228093 | cpp |
p03106 | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,481 | 914,482 | u502694307 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 101;
int count = 0;
while (1) {
ans--;
if (A % ans == 0 && B % ans == 0)
count++;
if (ans == K)
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int ans = 101;
int count = 0;
while (1) {
ans--;
if (A % ans == 0 && B % ans == 0)
count++;
if (count == K)
break;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 914,488 | 914,489 | u430394202 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
vector<int> v;
if (a < b) {
for (int i = 1; i <= b; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
... | // بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
// لآ اِلَهَ اِلّا اللّهُ مُحَمَّدٌ رَسُوُل اللّهِ
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c... | [
"call.function.change",
"call.arguments.change"
] | 914,501 | 914,502 | u581850493 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
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;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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);
}
}
cout << v[v.size() - k] << endl;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,516 | 914,517 | u850165979 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int kaage = __gcd(A, B);
// kaageは50になりますな
int count = 0;
for (int i = 1; i <= kaage; i++) {
if (kaage % i == 0) {
count++;
}
if (count == K) {
cout << kaage / i << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int kaage = __gcd(A, B);
// kaageは50になりますな
int count = 0;
for (int i = 1; i <= kaage; i++) {
if (kaage % i == 0) {
count++;
}
if (count == K) {
cout << kaage / i << endl;
break;
}
... | [
"control_flow.break.add"
] | 914,529 | 914,530 | u851044959 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i <= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 914,534 | 914,535 | u188332959 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 50; i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
count++;
if (count ... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
count++;
if (count... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 914,555 | 914,556 | u656767904 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 50; i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
count++;
if (count ... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
count++;
if (count... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 914,557 | 914,556 | u656767904 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> 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;
}
ll g... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> 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;
}
ll g... | [
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,564 | 914,565 | u190875453 | cpp |
p03106 | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int k;
cin >> a >> b >> k;
vector<int> v;
// odd numbers
for (int i = 1; (i <= a && i <= b); i++) {
if (a... | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int k;
cin >> a >> b >> k;
vector<int> v;
// odd numbers
for (int i = 1; (i <= a && i <= b); i++) {
if (a... | [
"expression.operation.binary.remove"
] | 914,580 | 914,581 | u672828730 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
if (min(a, b) == 1) {
cout << 1 << endl;
return 0;
}
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.push_back(i);
}
}
cout << vec[vec.size() -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> vec;
if (min(a, b) == 1) {
cout << 1 << endl;
return 0;
}
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.push_back(i);
}
}
cout << vec[vec.size() ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,595 | 914,596 | u237925781 | cpp |
p03106 | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int A, B;
cin >> A >> B;
int K;
cin >> K;
int cnt = 0;
vector<int> ans(100);
for (int i = 1; i <= 100; i++) {
if (A % i == 0 and B % i == 0) {
an... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int A, B;
cin >> A >> B;
int K;
cin >> K;
int cnt = 0;
vector<int> ans(100);
for (int i = 1; i <= 100; i++) {
if (A % i == 0 and B % i == 0) {
an... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 914,602 | 914,603 | u365077014 | cpp |
p03106 | #include <bits/stdc++.h>
#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;
vector<int> x;
for (int i = 100; i >= 0; i--) {
if (a % i == 0 && b % i == 0) {
x.push_back(i);
}
}
co... | #include <bits/stdc++.h>
#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;
vector<int> x;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
x.push_back(i);
}
}
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 914,611 | 914,612 | u708271445 | cpp |
p03106 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) (... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 914,632 | 914,633 | u905715926 | cpp |
p03106 | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 914,653 | 914,654 | u878615689 | cpp |
p03106 | #include <bits/stdc++.h>
#if ONLINE_JUDGE
#define DEBUG false
#else
#define DEBUG true
#endif
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
#if ONLINE_JUDGE
#define DEBUG false
#else
#define DEBUG true
#endif
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define rep(i, n) for (int i = 0; ... | [] | 914,675 | 914,676 | u428830428 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"identifier.change"
] | 914,682 | 914,683 | u530107518 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
vector<ll... | [
"call.function.change",
"call.arguments.change"
] | 914,706 | 914,707 | u718758485 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, K, G;
cin >> A >> B >> K;
G = __gcd(A, B);
for (int i = 100; i > 1; i--) {
if (G % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, K, G;
cin >> A >> B >> K;
G = __gcd(A, B);
for (int i = 100; i > 0; i--) {
if (G % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
return 0;
}
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,708 | 914,709 | u261947526 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int min = A < B ? A : B;
int count = 0;
for (int i = sqrt(min); i > 0; --i) {
if (B % i == 0 && A % i == 0)
++count;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int min = A < B ? A : B;
int count = 0;
for (int i = min; i > 0; --i) {
if (B % i == 0 && A % i == 0)
++count;
if (c... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 914,747 | 914,748 | u323542775 | cpp |
p03106 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int k;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0) {
if (b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
}
}
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int k;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0) {
if (b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
}
}
}
}
} | [
"function.return_value.change"
] | 914,756 | 914,757 | u600215903 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 914,785 | 914,786 | u499381410 | cpp |
p03106 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 914,800 | 914,801 | u043443359 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x == 0 && B % x == 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x != 0 || B % x != 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 914,802 | 914,803 | u820224016 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c;
cin >> c;
int k = 0;
int ans;
for (int i = min(a, b); i = 1; i--) {
if (a % i == 0 && b % i == 0) {
k++;
ans = i;
}
if (k == c)
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c;
cin >> c;
int k = 0;
int ans;
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
k++;
ans = i;
}
if (k == c)
break;
}
cout << ans << endl;
} | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 914,808 | 914,809 | u955282280 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = max(a, b);
vector<int> p;
for (int i = 1; i <= (n); ++i) {
if (a % i == 0 && b % i == 0)
p.push_back(i)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int n = max(a, b);
vector<int> p;
for (int i = 1; i <= (n); ++i) {
if (a % i == 0 && b % i == 0)
p.push_back(i)... | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 914,826 | 914,827 | u139255323 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> Cd(110);
int k = 0;
for (int i = 1; i < min(A, B) + 1; i++) {
if (A % i == 0 && B % i == 0) {
Cd.at(k) = i;
k++;
}
}
cout << Cd.at(K - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> Cd(110);
int k = 0;
for (int i = 1; i < min(A, B) + 1; i++) {
if (A % i == 0 && B % i == 0) {
Cd.at(k) = i;
k++;
}
}
cout << Cd.at(k - K) << endl;
}
| [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 914,828 | 914,829 | u817769480 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = A; i > 0; i--) {
if (A % i == 0 && B % i == 0)
K--;
if (K == 1) {
cout << i;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = A; i > 0; i--) {
if (A % i == 0 && B % i == 0)
K--;
if (K == 0) {
cout << i;
break;
}
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 914,849 | 914,850 | u424374375 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,859 | 914,860 | u833549197 | cpp |
p03106 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 914,867 | 914,868 | u103850114 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int tmp;
if (a > b) {
tmp = a;
} else {
tmp = b;
}
vector<int> divisor(tmp + 1);
int count;
count = 0;
for (int i = 1; i <= tmp; i++) {
if ((0 == a % i) && (0 == b % i)) {
divisor[count] = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int tmp;
if (a > b) {
tmp = a;
} else {
tmp = b;
}
vector<int> divisor(tmp + 1);
int count;
count = 0;
for (int i = 1; i <= tmp; i++) {
if ((0 == a % i) && (0 == b % i)) {
// cout << i << e... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 914,883 | 914,884 | u697641414 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int c = gcd(a, b);
int ans = 0;
int cnt = 0;
for (int i = c; i > 1; --i) {
if (a % i == 0 && b % i == 0) {
cnt... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int c = gcd(a, b);
int ans = 0;
int cnt = 0;
for (int i = c; i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
cn... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 914,890 | 914,891 | u417563928 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int big = GCD(a, b);
int count = 0;
for (int i = 1; i < big; i++) {
if (big % i == 0) {
count++;
if (count == k) {... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int big = GCD(a, b);
int count = 0;
for (int i = 1; i <= big; i++) {
if (big % i == 0) {
count++;
if (count == k) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 914,903 | 914,904 | u681084651 | cpp |
p03106 | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
l... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
l... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 914,922 | 914,923 | u399326102 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int a, b, k, l, ans = 0;
cin >> a >> b >> k;
l = gcd(a, b);
for (int i = 1; i < l; i++) {
if (ans == k) {
cout << l / (i - 1) << endl;
return 0;
}
if (l % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int a, b, k, l, ans = 0;
cin >> a >> b >> k;
l = gcd(a, b);
for (int i = 1; i <= l + 1; i++) {
if (ans == k) {
cout << l / (i - 1) << endl;
return 0;
}
if (l % i == 0) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 914,933 | 914,934 | u442754977 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | [
"expression.operation.binary.remove"
] | 914,935 | 914,936 | u806999568 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = max(a, b), cnt = 0;
while (cnt != k && ans != 1) {
ans--;
if (a % ans == 0 && b % ans == 0)
cnt++;
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans = max(a, b) + 1, cnt = 0;
while (cnt != k && ans != 1) {
ans--;
if (a % ans == 0 && b % ans == 0)
cnt++;
}
... | [
"assignment.change"
] | 914,943 | 914,944 | u258994590 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = min(a, b); i > 1; i--) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
break;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = min(a, b); 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"
] | 914,951 | 914,952 | u435867227 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | [
"expression.operation.binary.add"
] | 914,960 | 914,961 | u457790148 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 100000... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 100000... | [] | 914,962 | 914,963 | u225388820 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 100000... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 100000... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 914,964 | 914,963 | u225388820 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
typedef unsigned long long ull;
int main(void) {
int a, b, k;
int count = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i < 0; --i) {
if (a % i == 0 &&... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
typedef unsigned long long ull;
int main(void) {
int a, b, k;
int count = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i > 0; --i) {
if (a % i == 0 &&... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 914,965 | 914,966 | u517197973 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int a, b, k, i;
int main() {
cin >> a >> b >> k;
for (i = min(a, b); i >= 1 && k; i--) {
if (a % i == 0 && b % i == 0)
k--;
}
cout << i << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, k, i;
int main() {
cin >> a >> b >> k;
for (i = min(a, b); i >= 1 && k; i--) {
if (a % i == 0 && b % i == 0)
k--;
}
cout << i + 1 << '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 914,979 | 914,980 | u699904147 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.