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 |
|---|---|---|---|---|---|---|---|
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};
for (auto m : mp) {
if (bought + m.second > M) {
sum += (M - bought) * m.first;
bought = M;
break;
}
sum += m.second * m.first;
bought += m.second;
}
cout << sum << endl;
return 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};
for (auto m : mp) {
if (bought + m.second > M) {
sum += (M - bought) * m.first;
bought = M;
break;
}
sum += m.second * m.first;
bought += m.second;
}
cout << sum << endl;
return 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 << valAmount[i].first;
// cout << valAmount[i].second;
}
int currentCost = 0;
int currentAmount = 0;
int currentIndex = 0;
while (true) {
if (M - currentAmount <= valAmount[currentIndex].second) {
currentCost += valAmount[currentIndex].first * (M - currentAmount);
break;
} else {
currentAmount += valAmount[currentIndex].second;
currentCost +=
valAmount[currentIndex].first * valAmount[currentIndex].second;
}
currentIndex++;
// cout << endl << currentCost << "," << currentAmount << endl;
}
cout << currentCost << endl;
} | #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 << valAmount[i].first;
// cout << valAmount[i].second;
}
long currentCost = 0;
long currentAmount = 0;
long currentIndex = 0;
while (true) {
if (M - currentAmount <= valAmount[currentIndex].second) {
currentCost += valAmount[currentIndex].first * (M - currentAmount);
break;
} else {
currentAmount += valAmount[currentIndex].second;
currentCost +=
valAmount[currentIndex].first * valAmount[currentIndex].second;
}
currentIndex++;
// cout << endl << currentCost << "," << currentAmount << endl;
}
cout << currentCost << endl;
} | [
"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 (m <= vec.at(i).second) {
ans += (vec.at(i).first) * m;
break;
}
ans += (vec.at(i).first) * (vec.at(i).second);
m -= vec.at(i).second;
}
cout << ans << endl;
} | #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++) {
if (m <= vec.at(i).second) {
ans += (vec.at(i).first) * m;
break;
}
ans += (vec.at(i).first) * (vec.at(i).second);
m -= vec.at(i).second;
}
cout << ans << endl;
} | [
"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.begin(), vec.end(),
[](const pair &x, const pair &y) { return x.first < y.first; });
for (int i = 0; i < N; i++) {
auto p = vec[i];
if (count + p.second <= M) {
accum += p.first * p.second;
count += p.second;
} else {
accum += p.first * (M - count);
break;
}
}
cout << accum << endl;
return 0;
} | #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.begin(), vec.end(),
[](const pair &x, const pair &y) { return x.first < y.first; });
for (int i = 0; i < N; i++) {
auto p = vec[i];
if (count + p.second < M) {
accum += p.first * p.second;
count += p.second;
} else {
accum += p.first * (M - count);
break;
}
}
cout << accum << endl;
return 0;
} | [
"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 < n; i++) {
cin >> a >> b;
ab.pb(pii(a, b));
}
sort(ab.begin(), ab.end());
int res = 0;
for (int i = 0; ab.size(); i++) {
if (ab[i].second >= m) {
res += m * ab[i].first;
break;
}
res += ab[i].second * ab[i].first;
m -= ab[i].second;
}
cout << res << endl;
return 0;
}
| #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, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
ab.pb(pii(a, b));
}
sort(ab.begin(), ab.end());
int res = 0;
for (int i = 0; ab.size(); i++) {
if (ab[i].second >= m) {
res += m * ab[i].first;
break;
}
res += ab[i].second * ab[i].first;
m -= ab[i].second;
}
cout << res << endl;
return 0;
}
| [
"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 >> b;
ED[i] = make_pair(a, b);
}
sort(ED.begin(), ED.end());
long long ans = 0;
int count = M;
for (int i = 0; i < N; i++) {
ans += ED[i].first * min(ED[i].second, count);
count -= min(ED[i].second, count);
if (count == 0)
break;
}
cout << ans;
return 0;
} | #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 >> a >> b;
ED[i] = make_pair(a, b);
}
sort(ED.begin(), ED.end());
long long ans = 0;
int count = M;
for (int i = 0; i < N; i++) {
ans += ED[i].first * min(ED[i].second, count);
count -= min(ED[i].second, count);
if (count == 0)
break;
}
cout << ans;
return 0;
} | [
"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
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
llong n, m;
cin >> n >> m;
pair<llong, llong> drink[100100];
for (int i = 0; i < n; i++) {
llong a, b;
cin >> a >> b;
drink[i].first = a;
drink[i].second = b;
}
sort(drink, drink + n);
int cost = 0;
int cnt = 0;
while (1) {
if (drink[cnt].second < m) {
cost += drink[cnt].first * drink[cnt].second;
m -= drink[cnt].second;
} else {
cost += drink[cnt].first * m;
break;
}
cnt++;
}
cout << cost << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
llong n, m;
cin >> n >> m;
pair<llong, llong> drink[100100];
for (int i = 0; i < n; i++) {
llong a, b;
cin >> a >> b;
drink[i].first = a;
drink[i].second = b;
}
sort(drink, drink + n);
llong cost = 0;
int cnt = 0;
while (1) {
if (drink[cnt].second < m) {
cost += drink[cnt].first * drink[cnt].second;
m -= drink[cnt].second;
} else {
cost += drink[cnt].first * m;
break;
}
cnt++;
}
cout << cost << endl;
} | [
"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;
}
sort(data_array.begin(), data_array.end());
sum = 0;
for (i = 0; i < N; i++) {
if (M - data_array[i].second >= 0) {
M = M - data_array[i].second;
sum = sum + data_array[i].second * data_array[i].first;
} else {
sum = sum + M * data_array[i].first;
break;
}
}
cout << sum;
return 0;
} | #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].second;
}
sort(data_array.begin(), data_array.end());
sum = 0;
for (i = 0; i < N; i++) {
if (M - data_array[i].second >= 0) {
M = M - data_array[i].second;
sum = sum + data_array[i].second * data_array[i].first;
} else {
sum = sum + M * data_array[i].first;
break;
}
}
cout << sum;
return 0;
} | [
"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){
money+=(M-total)*key;
break;
}
else{
total+=value;
money+=value*key;
}
}
cout<<money<<endl;
*/
for (auto itr = arr.begin(); itr != arr.end(); ++itr) {
if (total + itr->second >= M) {
money += (M - total) * itr->first;
break;
} else {
total += itr->second;
money += itr->second * itr->first;
}
}
cout << money << endl;
}
| #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(); ++itr) {
if (total + itr->second >= M) {
money += (M - total) * itr->first;
break;
} else {
total += itr->second;
money += itr->second * itr->first;
}
}
cout << money << endl;
}
| [
"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 cost = i->first, stock = i->second;
// cout << cost << "->" << stock << endl;
if (M - stock >= 0) {
res += cost * stock;
M -= stock;
} else {
res += cost * M;
break;
}
}
cout << res << endl;
return 0;
} | #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 cost = i->first, stock = i->second;
// cout << cost << "->" << stock << endl;
if (M - stock >= 0) {
res += cost * stock;
M -= stock;
} else {
res += cost * M;
break;
}
}
cout << res << endl;
return 0;
} | [
"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 = i->first, stock = i->second;
// cout << M << endl;
if (M - stock >= 0) {
res += cost * stock;
M -= stock;
} else {
res += cost * M;
break;
}
// cout << cost << " => " << stock << endl;
}
cout << res << endl;
return 0;
} | #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 cost = i->first, stock = i->second;
// cout << cost << "->" << stock << endl;
if (M - stock >= 0) {
res += cost * stock;
M -= stock;
} else {
res += cost * M;
break;
}
}
cout << res << endl;
return 0;
} | [
"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 double EPS = 1e-8;
static int roundToInt(double x) {
return (x < 0) ? -(int)(-x + 0.5) : (int)(x + 0.5);
}
class Var { // NOTE: immutable
public:
string sval;
long long dval;
enum VarType { STRING = 0, NUMBER = 1 };
VarType type;
enum NumericState { UNKNOWN = -1, STRINGY = 0, NUMERIC = 1 };
mutable NumericState numericState;
Var() {
sval = "";
type = STRING;
numericState = STRINGY;
} // represent null?
Var(string s) {
sval = s;
type = STRING;
numericState = UNKNOWN;
}
Var(long long d) {
dval = d;
type = NUMBER;
numericState = NUMERIC;
}
Var(const Var &v) {
sval = string(v.sval);
dval = v.dval;
type = v.type;
numericState = v.numericState;
}
static bool isNumericString(const string &s) {
char *ep;
// cause side-effect: errno can be ERANGE after calling strtod
strtoll(s.c_str(), &ep, 10);
// Scratch 3.0 recognize the string cause underflows or overflows as Numeric
return NULL != ep && '\0' == ep[0] && s[0] != '\0';
// TODO: In Scratch '000' is regarded as non-numeric (but here regarded as
// numeric)
}
bool isNumeric() const {
if (type == NUMBER)
return true;
if (numericState != UNKNOWN)
return numericState == NUMERIC;
bool numeric = isNumericString(sval);
numericState = (numeric) ? NUMERIC : STRINGY;
return numeric;
}
long long asNumber() const {
if (type == NUMBER)
return dval;
return (isNumeric()) ? atoll(sval.c_str()) : 0.0;
}
static bool isNearInteger(const double &x) {
return true;
// return fabs(round(x) - x) < EPS;
// TODO: allow integer type in Var class
}
static bool isNearNumber(const double &x, const double &y) {
return true;
// return fabs(x - y) < EPS;
}
string asString() const {
if (type == STRING)
return sval;
if (isNearInteger(dval))
return to_string(roundToInt(dval));
return to_string(dval);
}
Var operator+(const Var &y) const {
return Var(this->asNumber() + y.asNumber());
}
Var operator+=(const Var &y) {
*this = *this + y;
return *this;
}
Var operator-(const Var &y) const {
return Var(this->asNumber() - y.asNumber());
}
Var operator*(const Var &y) const {
return Var(this->asNumber() * y.asNumber());
}
Var operator/(const Var &y) const {
return Var(this->asNumber() / y.asNumber());
}
Var operator%(const Var &y) const {
return Var(fmod(this->asNumber(), y.asNumber()));
}
bool operator<(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() < y.asNumber();
} // compare as number if both can be interpreted as numeric
return this->asString() < y.asString();
}
bool operator>(const Var &y) const { return y < *this; }
bool operator==(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() == y.asNumber();
} // compare as numeric if both are numeric
return this->asString() == y.asString();
}
friend ostream &operator<<(ostream &os, const Var &p);
friend istream &operator>>(istream &is, const Var &p);
};
ostream &operator<<(ostream &os, const Var &p) {
os << p.asString();
return os;
}
istream &operator>>(istream &is, Var &p) {
string s;
is >> s;
p = Var(s);
return is;
}
Var letterOf(Var index, Var sourceString) {
/* index: 1-origined */
string str = sourceString.asString();
int idx = (int)(index.asNumber() - 1);
// seem to be dirty but Scratch seems to do like this.
// ex. letterOf(0.01, "world") == "w", letterOf(1.99, "world") == "w",
// letterOf(5.99, "world") == "d"
if (0 <= idx && idx < str.size())
return Var(str.substr(idx, 1));
return Var();
}
class VarList {
public:
vector<Var> data;
VarList(const vector<Var> &x) { data = x; }
void push_back(const Var &x) { data.push_back(x); }
void pop_back() { data.pop_back(); }
void clear() { data.clear(); }
int size() { return (int)data.size(); }
Var getLineOfList(const Var &index) const {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
// (unlike 'letterOf', index==0.9 does not work.)
if (0 <= idx && idx < data.size())
return data[idx];
return Var();
}
void setLineOfListTo(const Var &index, const Var &v) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data[idx] = v;
}
void deleteLineOfList(const Var &index) {
/* index: 1-origined */
string kwd = index.asString();
if (kwd == "all") {
data.clear();
} else if (kwd == "last") {
data.pop_back();
} else {
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data.erase(data.begin() + idx);
}
}
void insertAtIndexOfList(const Var &item, const Var &index) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx <= data.size())
data.insert(data.begin() + idx, item);
}
void insertAtRandomOfList(const Var &item) {
int idx = rand() % (data.size() + 1);
data.insert(data.begin() + idx, item);
}
string asString() const {
/* concatenate elements of list with space */
// TODO: concatenated without spaces only if all elements are single
// characters. (Is it an official bug? (or feature?))
string ret;
for (int i = 0; i < data.size(); i++) {
if (i > 0)
ret += ' ';
ret += data[i].asString();
}
return ret;
}
int itemNumOfList(const Var &item) const {
auto itr = find(data.begin(), data.end(), item);
if (itr == data.end())
return 0;
return 1 + (int)(itr - data.begin());
/* index: 1-origined */
}
friend ostream &operator<<(ostream &os, const VarList &p);
};
ostream &operator<<(ostream &os, const VarList &p) {
os << p.asString();
return os;
}
double randUniform(double x, double y) {
if (x > y)
return randUniform(y, x);
if (Var::isNearInteger(x) && Var::isNearInteger(y)) {
int xi = roundToInt(x), yi = roundToInt(y);
return xi + rand() % (yi - xi + 1);
} else {
return x + (y - x) * (0.0 + rand()) / RAND_MAX;
}
}
Var buf_answer; // for "answer"
// ============================= Scripts =============================
// variable declaration
Var var_n(4);
Var var_div(8);
Var var_seg(9);
Var var_fb(1);
Var var_k(5);
Var var_sb(5);
Var var_fe(5);
Var var_se(5);
Var var_i(3);
Var var_j(5);
Var var_p(5);
Var var_N(4);
Var var_M(15);
Var var_buf(100000);
Var var___i(18);
Var var_ans(130);
Var var_buy(18);
// list declaration
VarList list_tmp({Var(2), Var(3), Var(6), Var(7)});
VarList list_ary({Var(2), Var(3), Var(6), Var(7)});
VarList list_A({});
VarList list_B({Var(18), Var(5), Var(10), Var(9)});
VarList list_retlist({Var(1000000000), Var(100000)});
VarList list_ary__idx({Var(2), Var(3), Var(1), Var(4)});
VarList list_tmp__idx({Var(2), Var(3), Var(1), Var(4)});
// prototype declaration of functions
int func_merge__sort__ary();
int main();
int func_string__to__retlist(const Var &arg_str);
// contents of functions
int func_merge__sort__ary() {
var_n = Var(list_ary.size());
list_tmp.deleteLineOfList(Var("all"));
list_tmp__idx.deleteLineOfList(Var("all"));
list_ary__idx.deleteLineOfList(Var("all"));
var_i = Var(1);
for (int pvimdswq = 0; pvimdswq < var_n.asNumber(); pvimdswq++) {
list_ary__idx.push_back(var_i);
list_tmp.push_back(Var(0));
list_tmp__idx.push_back(Var(0));
var_i += Var(1);
}
var_n += Var(1);
var_div = Var(1);
while (!(!(var_div < var_n))) {
var_seg = Var(1);
while (!(!(var_seg < var_n))) {
var_fb = var_seg;
var_k = var_seg;
if ((((var_fb + var_div) < var_n) || ((var_fb + var_div) == var_n))) {
var_sb = (var_fb + var_div);
var_fe = (var_fb + var_div);
} else {
var_sb = var_n;
var_fe = var_n;
}
if ((((var_sb + var_div) < var_n) || ((var_sb + var_div) == var_n))) {
var_se = (var_sb + var_div);
} else {
var_se = var_n;
}
var_i = var_fb;
var_j = var_sb;
while (!(!((var_i < var_fe) && (var_j < var_se)))) {
if (((list_ary.getLineOfList(var_i) < list_ary.getLineOfList(var_j)) ||
(list_ary.getLineOfList(var_i) ==
list_ary.getLineOfList(var_j)))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_i));
var_i += Var(1);
} else {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_j));
var_j += Var(1);
}
var_k += Var(1);
}
while (!(!(var_i < var_fe))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_i));
var_k += Var(1);
var_i += Var(1);
}
while (!(!(var_j < var_se))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_j));
var_k += Var(1);
var_j += Var(1);
}
var_p = var_seg;
while (!(!(var_p < var_k))) {
list_ary.setLineOfListTo(var_p, list_tmp.getLineOfList(var_p));
list_ary__idx.setLineOfListTo(var_p,
list_tmp__idx.getLineOfList(var_p));
var_p += Var(1);
}
var_seg = (var_seg + (var_div * Var(2)));
}
var_div = (var_div * Var(2));
}
var_n += Var(-1);
return 0;
}
int main() {
list_ary.clear();
list_A.clear();
list_B.clear();
cin >> buf_answer;
var_N = buf_answer;
cin >> buf_answer;
var_M = buf_answer;
for (int uzrgikhs = 0; uzrgikhs < var_N.asNumber(); uzrgikhs++) {
cin >> buf_answer;
list_ary.push_back(buf_answer);
cin >> buf_answer;
list_B.push_back(buf_answer);
}
func_merge__sort__ary();
var_ans = Var(0);
var_i = Var(1);
for (int bxxvntcy = 0; bxxvntcy < var_N.asNumber(); bxxvntcy++) {
var_buy = list_B.getLineOfList(list_ary__idx.getLineOfList(var_i));
if ((var_buy < var_M)) {
var_ans += (list_ary.getLineOfList(var_i) * var_buy);
var_M += (Var(0) - var_buy);
} else {
var_ans += (list_ary.getLineOfList(var_i) * var_M);
cout << var_ans << endl;
return 0;
}
var_i += Var(1);
}
return 0;
}
int func_string__to__retlist(const Var &arg_str) {
list_retlist.clear();
var_buf = Var("");
var___i = Var(1);
for (int okuazbmr = 0; okuazbmr < Var(arg_str.asString().size()).asNumber();
okuazbmr++) {
if ((letterOf(var___i, arg_str) == Var(" "))) {
list_retlist.push_back(var_buf);
var_buf = Var("");
} else {
var_buf = Var(var_buf.asString() + letterOf(var___i, arg_str).asString());
}
var___i += Var(1);
}
if ((!(var_buf == Var("")))) {
list_retlist.push_back(var_buf);
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" \
<< "\n"
using namespace std;
const double EPS = 1e-8;
static long long roundToInt(double x) {
return (x < 0) ? -(long long)(-x + 0.5) : (long long)(x + 0.5);
}
class Var { // NOTE: immutable
public:
string sval;
long long dval;
enum VarType { STRING = 0, NUMBER = 1 };
VarType type;
enum NumericState { UNKNOWN = -1, STRINGY = 0, NUMERIC = 1 };
mutable NumericState numericState;
Var() {
sval = "";
type = STRING;
numericState = STRINGY;
} // represent null?
Var(string s) {
sval = s;
type = STRING;
numericState = UNKNOWN;
}
Var(long long d) {
dval = d;
type = NUMBER;
numericState = NUMERIC;
}
Var(const Var &v) {
sval = string(v.sval);
dval = v.dval;
type = v.type;
numericState = v.numericState;
}
static bool isNumericString(const string &s) {
char *ep;
// cause side-effect: errno can be ERANGE after calling strtod
strtoll(s.c_str(), &ep, 10);
// Scratch 3.0 recognize the string cause underflows or overflows as Numeric
return NULL != ep && '\0' == ep[0] && s[0] != '\0';
// TODO: In Scratch '000' is regarded as non-numeric (but here regarded as
// numeric)
}
bool isNumeric() const {
if (type == NUMBER)
return true;
if (numericState != UNKNOWN)
return numericState == NUMERIC;
bool numeric = isNumericString(sval);
numericState = (numeric) ? NUMERIC : STRINGY;
return numeric;
}
long long asNumber() const {
if (type == NUMBER)
return dval;
return (isNumeric()) ? atoll(sval.c_str()) : 0.0;
}
static bool isNearInteger(const double &x) {
return true;
// return fabs(round(x) - x) < EPS;
// TODO: allow integer type in Var class
}
static bool isNearNumber(const double &x, const double &y) {
return true;
// return fabs(x - y) < EPS;
}
string asString() const {
if (type == STRING)
return sval;
if (isNearInteger(dval))
return to_string(roundToInt(dval));
return to_string(dval);
}
Var operator+(const Var &y) const {
return Var(this->asNumber() + y.asNumber());
}
Var operator+=(const Var &y) {
*this = *this + y;
return *this;
}
Var operator-(const Var &y) const {
return Var(this->asNumber() - y.asNumber());
}
Var operator*(const Var &y) const {
return Var(this->asNumber() * y.asNumber());
}
Var operator/(const Var &y) const {
return Var(this->asNumber() / y.asNumber());
}
Var operator%(const Var &y) const {
return Var(fmod(this->asNumber(), y.asNumber()));
}
bool operator<(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() < y.asNumber();
} // compare as number if both can be interpreted as numeric
return this->asString() < y.asString();
}
bool operator>(const Var &y) const { return y < *this; }
bool operator==(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() == y.asNumber();
} // compare as numeric if both are numeric
return this->asString() == y.asString();
}
friend ostream &operator<<(ostream &os, const Var &p);
friend istream &operator>>(istream &is, const Var &p);
};
ostream &operator<<(ostream &os, const Var &p) {
os << p.asString();
return os;
}
istream &operator>>(istream &is, Var &p) {
string s;
is >> s;
p = Var(s);
return is;
}
Var letterOf(Var index, Var sourceString) {
/* index: 1-origined */
string str = sourceString.asString();
int idx = (int)(index.asNumber() - 1);
// seem to be dirty but Scratch seems to do like this.
// ex. letterOf(0.01, "world") == "w", letterOf(1.99, "world") == "w",
// letterOf(5.99, "world") == "d"
if (0 <= idx && idx < str.size())
return Var(str.substr(idx, 1));
return Var();
}
class VarList {
public:
vector<Var> data;
VarList(const vector<Var> &x) { data = x; }
void push_back(const Var &x) { data.push_back(x); }
void pop_back() { data.pop_back(); }
void clear() { data.clear(); }
int size() { return (int)data.size(); }
Var getLineOfList(const Var &index) const {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
// (unlike 'letterOf', index==0.9 does not work.)
if (0 <= idx && idx < data.size())
return data[idx];
return Var();
}
void setLineOfListTo(const Var &index, const Var &v) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data[idx] = v;
}
void deleteLineOfList(const Var &index) {
/* index: 1-origined */
string kwd = index.asString();
if (kwd == "all") {
data.clear();
} else if (kwd == "last") {
data.pop_back();
} else {
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data.erase(data.begin() + idx);
}
}
void insertAtIndexOfList(const Var &item, const Var &index) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx <= data.size())
data.insert(data.begin() + idx, item);
}
void insertAtRandomOfList(const Var &item) {
int idx = rand() % (data.size() + 1);
data.insert(data.begin() + idx, item);
}
string asString() const {
/* concatenate elements of list with space */
// TODO: concatenated without spaces only if all elements are single
// characters. (Is it an official bug? (or feature?))
string ret;
for (int i = 0; i < data.size(); i++) {
if (i > 0)
ret += ' ';
ret += data[i].asString();
}
return ret;
}
int itemNumOfList(const Var &item) const {
auto itr = find(data.begin(), data.end(), item);
if (itr == data.end())
return 0;
return 1 + (int)(itr - data.begin());
/* index: 1-origined */
}
friend ostream &operator<<(ostream &os, const VarList &p);
};
ostream &operator<<(ostream &os, const VarList &p) {
os << p.asString();
return os;
}
double randUniform(double x, double y) {
if (x > y)
return randUniform(y, x);
if (Var::isNearInteger(x) && Var::isNearInteger(y)) {
int xi = roundToInt(x), yi = roundToInt(y);
return xi + rand() % (yi - xi + 1);
} else {
return x + (y - x) * (0.0 + rand()) / RAND_MAX;
}
}
Var buf_answer; // for "answer"
// ============================= Scripts =============================
// variable declaration
Var var_n(4);
Var var_div(8);
Var var_seg(9);
Var var_fb(1);
Var var_k(5);
Var var_sb(5);
Var var_fe(5);
Var var_se(5);
Var var_i(3);
Var var_j(5);
Var var_p(5);
Var var_N(4);
Var var_M(15);
Var var_buf(100000);
Var var___i(18);
Var var_ans(130);
Var var_buy(18);
// list declaration
VarList list_tmp({Var(2), Var(3), Var(6), Var(7)});
VarList list_ary({Var(2), Var(3), Var(6), Var(7)});
VarList list_A({});
VarList list_B({Var(18), Var(5), Var(10), Var(9)});
VarList list_retlist({Var(1000000000), Var(100000)});
VarList list_ary__idx({Var(2), Var(3), Var(1), Var(4)});
VarList list_tmp__idx({Var(2), Var(3), Var(1), Var(4)});
// prototype declaration of functions
int func_merge__sort__ary();
int main();
int func_string__to__retlist(const Var &arg_str);
// contents of functions
int func_merge__sort__ary() {
var_n = Var(list_ary.size());
list_tmp.deleteLineOfList(Var("all"));
list_tmp__idx.deleteLineOfList(Var("all"));
list_ary__idx.deleteLineOfList(Var("all"));
var_i = Var(1);
for (int pvimdswq = 0; pvimdswq < var_n.asNumber(); pvimdswq++) {
list_ary__idx.push_back(var_i);
list_tmp.push_back(Var(0));
list_tmp__idx.push_back(Var(0));
var_i += Var(1);
}
var_n += Var(1);
var_div = Var(1);
while (!(!(var_div < var_n))) {
var_seg = Var(1);
while (!(!(var_seg < var_n))) {
var_fb = var_seg;
var_k = var_seg;
if ((((var_fb + var_div) < var_n) || ((var_fb + var_div) == var_n))) {
var_sb = (var_fb + var_div);
var_fe = (var_fb + var_div);
} else {
var_sb = var_n;
var_fe = var_n;
}
if ((((var_sb + var_div) < var_n) || ((var_sb + var_div) == var_n))) {
var_se = (var_sb + var_div);
} else {
var_se = var_n;
}
var_i = var_fb;
var_j = var_sb;
while (!(!((var_i < var_fe) && (var_j < var_se)))) {
if (((list_ary.getLineOfList(var_i) < list_ary.getLineOfList(var_j)) ||
(list_ary.getLineOfList(var_i) ==
list_ary.getLineOfList(var_j)))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_i));
var_i += Var(1);
} else {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_j));
var_j += Var(1);
}
var_k += Var(1);
}
while (!(!(var_i < var_fe))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_i));
var_k += Var(1);
var_i += Var(1);
}
while (!(!(var_j < var_se))) {
list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
list_tmp__idx.setLineOfListTo(var_k,
list_ary__idx.getLineOfList(var_j));
var_k += Var(1);
var_j += Var(1);
}
var_p = var_seg;
while (!(!(var_p < var_k))) {
list_ary.setLineOfListTo(var_p, list_tmp.getLineOfList(var_p));
list_ary__idx.setLineOfListTo(var_p,
list_tmp__idx.getLineOfList(var_p));
var_p += Var(1);
}
var_seg = (var_seg + (var_div * Var(2)));
}
var_div = (var_div * Var(2));
}
var_n += Var(-1);
return 0;
}
int main() {
list_ary.clear();
list_A.clear();
list_B.clear();
cin >> buf_answer;
var_N = buf_answer;
cin >> buf_answer;
var_M = buf_answer;
for (int uzrgikhs = 0; uzrgikhs < var_N.asNumber(); uzrgikhs++) {
cin >> buf_answer;
list_ary.push_back(buf_answer);
cin >> buf_answer;
list_B.push_back(buf_answer);
}
func_merge__sort__ary();
var_ans = Var(0);
var_i = Var(1);
for (int bxxvntcy = 0; bxxvntcy < var_N.asNumber(); bxxvntcy++) {
var_buy = list_B.getLineOfList(list_ary__idx.getLineOfList(var_i));
if ((var_buy < var_M)) {
var_ans += (list_ary.getLineOfList(var_i) * var_buy);
var_M += (Var(0) - var_buy);
} else {
var_ans += (list_ary.getLineOfList(var_i) * var_M);
cout << var_ans << endl;
return 0;
}
var_i += Var(1);
}
return 0;
}
int func_string__to__retlist(const Var &arg_str) {
list_retlist.clear();
var_buf = Var("");
var___i = Var(1);
for (int okuazbmr = 0; okuazbmr < Var(arg_str.asString().size()).asNumber();
okuazbmr++) {
if ((letterOf(var___i, arg_str) == Var(" "))) {
list_retlist.push_back(var_buf);
var_buf = Var("");
} else {
var_buf = Var(var_buf.asString() + letterOf(var___i, arg_str).asString());
}
var___i += Var(1);
}
if ((!(var_buf == Var("")))) {
list_retlist.push_back(var_buf);
}
return 0;
}
| [
"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; i++) {
ll buy = min(M, ab[i].second);
ans += ab[i].first + buy;
M -= buy;
if (M == 0)
break;
}
cout << ans << endl;
}
| #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; i++) {
ll buy = min(M, ab[i].second);
ans += ab[i].first * buy;
M -= buy;
if (M == 0)
break;
}
cout << ans << endl;
}
| [
"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 pair<int, int> b) {
return a.second < b.second;
});
i = 0;
need_cans = M;
while (need_cans > 0) {
ans += ((long)min(need_cans, A[i].second)) * A[i].first;
need_cans -= A[i].second;
++i;
}
cout << ans << endl;
return 0;
} | #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 pair<int, int> b) {
return a.first < b.first;
});
i = 0;
need_cans = M;
while (need_cans > 0) {
ans += ((long)min(need_cans, A[i].second)) * A[i].first;
need_cans -= A[i].second;
++i;
}
cout << ans << endl;
return 0;
} | [
"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.begin(), A.end());
long ans;
for (int i = 0; i < N; i++) {
if (A[i][1] <= M) {
ans += A[i][1] * A[i][0];
M = M - A[i][1];
} else {
ans += M * A[i][0];
break;
}
}
cout << ans << "\n";
return 0;
} | #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.begin(), A.end());
long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i][1] < M) {
ans += A[i][1] * A[i][0];
M = M - A[i][1];
} else {
ans += M * A[i][0];
break;
}
}
cout << ans << "\n";
return 0;
} | [
"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 ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main(void) {
int n, m;
cin >> n >> m;
vector<pair<int, int>> A(n);
rep(i, n) { cin >> A[i].first >> A[i].second; }
sort(A.begin(), A.end());
int sum = 0;
rep(i, n) {
if (m > A[i].second) {
m -= A[i].second;
sum += A[i].first * A[i].second;
} else {
sum += A[i].first * m;
cout << sum;
}
}
}
| #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 ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll) INF *INF
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, a, n) for (int i = a; i < (n); i++)
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vp;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main(void) {
int n, m;
cin >> n >> m;
vector<pair<int, int>> A(n);
rep(i, n) { cin >> A[i].first >> A[i].second; }
sort(A.begin(), A.end());
int sum = 0;
rep(i, n) {
if (m > A[i].second) {
m -= A[i].second;
sum += A[i].first * A[i].second;
} else {
sum += A[i].first * m;
cout << sum;
break;
}
}
}
| [
"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.end());
int sum = 0;
for (int i = 0; i < n; i++) {
if (m - A[i].second > 0) {
sum += A[i].first * A[i].second;
m -= A[i].second;
} else {
sum += A[i].first * m;
break;
}
}
cout << sum;
} | #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.end());
long long sum = 0;
for (int i = 0; i < n; i++) {
if (m - A[i].second > 0) {
sum += A[i].first * A[i].second;
m -= A[i].second;
} else {
sum += A[i].first * m;
break;
}
}
cout << sum;
}
| [
"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 (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define ll long long int
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n], b[n];
rep(i, n) { cin >> a[i] >> b[i]; }
vector<pair<int, int>> shop(n);
rep(p, n) { shop[p] = make_pair(a[p], b[p]); }
sort(shop.begin(), shop.end());
ll sum = 0;
int honsuu = 0;
rep(j, n) {
honsuu += shop[j].second;
sum += shop[j].first * shop[j].second;
if (honsuu >= m) {
cout << sum - (honsuu - m) * shop[j].first;
exit(0);
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define ll long long int
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll a[n], b[n];
rep(i, n) { cin >> a[i] >> b[i]; }
vector<pair<ll, ll>> shop(n);
rep(p, n) { shop[p] = make_pair(a[p], b[p]); }
sort(shop.begin(), shop.end());
ll sum = 0;
ll honsuu = 0;
rep(j, n) {
honsuu += shop[j].second;
sum += shop[j].first * shop[j].second;
if (honsuu >= m) {
cout << sum - (honsuu - m) * shop[j].first;
exit(0);
}
}
return 0;
} | [
"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, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
#define al(d) d.begin(), d.end()
#define fill(n) std::setfill('0') << std::right << std::setw(n)
template <typename T> using vec = std::vector<T>;
using vi = vec<int>;
using vvi = vec<vi>;
using pii = std::pair<int, int>;
using ll = long long;
using ld = long double;
using namespace std;
const int MOD = 1000000007;
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
template <class T> vector<T> getv(int n) {
vector<T> vec;
rep(i, n) {
T input;
cin >> input;
vec.emplace_back(input);
}
return vec;
}
using AdjList = vector<vector<int>>;
using Weight = int;
using Flow = int;
struct Edge {
int src, dst;
Weight weight;
Flow cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;
void add_edge(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
}
// Recieve edge(=(int,int)) as an adj list.
AdjList getadj(int N, int M) {
// Initialize all lists of the graph as a empty vector.
vector<int> init;
vector<vector<int>> graph(N, init);
rep(i, M) {
int a, b;
cin >> a >> b;
graph[a - 1].emplace_back(b - 1);
graph[b - 1].emplace_back(a - 1);
}
// rep(i,N)
// putv(graph[i]);
return graph;
}
ll Manhattan_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
void out(bool ans) {
if (ans == true)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Out(bool ans) {
if (ans == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void OUT(bool ans) {
if (ans == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcd(const ll a, const ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll lcm(const ll a, const ll b) { return a * (b / gcd(a, b)); }
// イテレーティブな方法で適宜組んだ方が時間量領域量ともにセーブできる
// ll lcmv(vector<ll> vec){
// int t = vec.size();
// if(t==2)
// return lcm(vec[0],vec[1]);
// ll v = vec[t-1];
// vec.pop_back();
// return lcm(lcmv(vec),v);
// }
// ll gcdv(vector<ll> vec){
// int t = vec.size();
// if(t==1)
// return vec[0];
// if(t==2)
// return gcd(vec[0],vec[1]);
// ll v = vec[t-1];
// vec.pop_back();
// return gcd(gcdv(vec),v);
// }
// $\min\{s\in\mathbb{N}:p^s|n\}$
// nをpで何回割れるか
ll hmt_p_divide_n(ll p, ll n) {
ll s = 0;
while (n % p == 0) {
n /= p;
s++;
}
return s;
}
int digit(ll n) {
int cntr = 0;
while (n > 0) {
n /= 10;
cntr++;
}
return cntr;
}
int main() {
int N, M;
cin >> N >> M;
vec<pii> weight_value;
int weight, value;
rep(i, N) {
cin >> weight >> value;
weight_value.emplace_back(make_pair(weight, value));
}
sort(weight_value.begin(), weight_value.end());
ll sum = 0;
int num = 0;
int i = 0;
while (num < M) {
num += weight_value[i].second;
sum += (ll)weight_value[i].first * weight_value[i].second;
i++;
}
i--;
sum -= (num - M) * weight_value[i].first;
cout << sum << endl;
}
| #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, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
#define al(d) d.begin(), d.end()
#define fill(n) std::setfill('0') << std::right << std::setw(n)
template <typename T> using vec = std::vector<T>;
using vi = vec<int>;
using vvi = vec<vi>;
using pii = std::pair<int, int>;
using ll = long long;
using ld = long double;
using namespace std;
const int MOD = 1000000007;
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
template <class T> vector<T> getv(int n) {
vector<T> vec;
rep(i, n) {
T input;
cin >> input;
vec.emplace_back(input);
}
return vec;
}
using AdjList = vector<vector<int>>;
using Weight = int;
using Flow = int;
struct Edge {
int src, dst;
Weight weight;
Flow cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;
void add_edge(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
}
// Recieve edge(=(int,int)) as an adj list.
AdjList getadj(int N, int M) {
// Initialize all lists of the graph as a empty vector.
vector<int> init;
vector<vector<int>> graph(N, init);
rep(i, M) {
int a, b;
cin >> a >> b;
graph[a - 1].emplace_back(b - 1);
graph[b - 1].emplace_back(a - 1);
}
// rep(i,N)
// putv(graph[i]);
return graph;
}
ll Manhattan_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
void out(bool ans) {
if (ans == true)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Out(bool ans) {
if (ans == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void OUT(bool ans) {
if (ans == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcd(const ll a, const ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll lcm(const ll a, const ll b) { return a * (b / gcd(a, b)); }
// イテレーティブな方法で適宜組んだ方が時間量領域量ともにセーブできる
// ll lcmv(vector<ll> vec){
// int t = vec.size();
// if(t==2)
// return lcm(vec[0],vec[1]);
// ll v = vec[t-1];
// vec.pop_back();
// return lcm(lcmv(vec),v);
// }
// ll gcdv(vector<ll> vec){
// int t = vec.size();
// if(t==1)
// return vec[0];
// if(t==2)
// return gcd(vec[0],vec[1]);
// ll v = vec[t-1];
// vec.pop_back();
// return gcd(gcdv(vec),v);
// }
// $\min\{s\in\mathbb{N}:p^s|n\}$
// nをpで何回割れるか
ll hmt_p_divide_n(ll p, ll n) {
ll s = 0;
while (n % p == 0) {
n /= p;
s++;
}
return s;
}
int digit(ll n) {
int cntr = 0;
while (n > 0) {
n /= 10;
cntr++;
}
return cntr;
}
int main() {
int N, M;
cin >> N >> M;
vec<pii> weight_value;
int weight, value;
rep(i, N) {
cin >> weight >> value;
weight_value.emplace_back(make_pair(weight, value));
}
sort(weight_value.begin(), weight_value.end());
ll sum = 0;
ll num = 0;
int i = 0;
while (num < M) {
num += weight_value[i].second;
sum += (ll)weight_value[i].first * weight_value[i].second;
i++;
}
i--;
sum -= (ll)(num - M) * weight_value[i].first;
cout << sum << endl;
}
| [
"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"
//?
#define cesp(x) cerr << (x) << " "
//?
#define pb push_back
//最後に追加
// void push_back(const T& x); // (1)
// void push_back(T&& x); // (2) C++11
#define mp make_pair
// make_pair
//メイン関数
//デバッグ
//;と:のミス
//;を忘れずに
//,と.のミス
// structの作成
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//入力
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> v(N);
for (ll i = 0; i < N; i++) {
cin >> v[i].first >> v[i].second;
}
//入力終わり
// priceをキーに昇順でソート
sort(v.begin(), v.end());
//最安×本数を計算して、足していき、望みの本数になったら終了
//答えの数字
int honsu_all = 0;
int price_all = 0;
int tmp_honsu;
int tmp_price;
ll j = 0;
while (j < N) {
tmp_honsu = v[j].second;
tmp_price = v[j].first;
honsu_all += tmp_honsu;
price_all += tmp_honsu * tmp_price;
// honsu_all>Mのときは、差額分をそのときのpriceで割って、その余りが0なら商、
//余りが0以外なら商＋1本を追加
if (honsu_all >= M) {
price_all -= (honsu_all - M) * tmp_price;
break;
}
j++;
}
// co(kotae);
co(price_all);
return 0;
} | #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"
//?
#define cesp(x) cerr << (x) << " "
//?
#define pb push_back
//最後に追加
// void push_back(const T& x); // (1)
// void push_back(T&& x); // (2) C++11
#define mp make_pair
// make_pair
//メイン関数
//デバッグ
//;と:のミス
//;を忘れずに
//,と.のミス
// structの作成
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//入力
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> v(N);
for (ll i = 0; i < N; i++) {
cin >> v[i].first >> v[i].second;
}
//入力終わり
// priceをキーに昇順でソート
sort(v.begin(), v.end());
//最安×本数を計算して、足していき、望みの本数になったら終了
//答えの数字
ll honsu_all = 0;
ll price_all = 0;
ll tmp_honsu;
ll tmp_price;
ll j = 0;
while (j < N) {
tmp_honsu = v[j].second;
tmp_price = v[j].first;
honsu_all += tmp_honsu;
price_all += tmp_honsu * tmp_price;
// honsu_all>Mのときは、差額分をそのときのpriceで割って、その余りが0なら商、
//余りが0以外なら商＋1本を追加
if (honsu_all >= M) {
price_all -= (honsu_all - M) * tmp_price;
break;
}
j++;
}
// co(kotae);
co(price_all);
return 0;
} | [
"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(), pairs.end());
int sum = 0;
long long res = 0;
for (int i = 0; sum < M; i++) {
int m = pairs[i].second;
if (sum + m > M)
m = M - sum;
sum += pairs[i].second;
res += pairs[i].first * m;
}
cout << res << endl;
return 0;
} | #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(pairs.begin(), pairs.end());
int sum = 0;
long long res = 0;
for (int i = 0; sum < M; i++) {
int m = pairs[i].second;
if (sum + m > M)
m = M - sum;
sum += pairs[i].second;
res += pairs[i].first * m;
}
cout << res << endl;
return 0;
} | [
"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(), pairs.end());
int sum = 0;
int res = 0;
for (int i = 0; sum < M; i++) {
int m = pairs[i].second;
if (sum + m > M)
m = M - sum;
sum += pairs[i].second;
res += pairs[i].first * m;
}
cout << res << endl;
return 0;
} | #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(pairs.begin(), pairs.end());
int sum = 0;
long long res = 0;
for (int i = 0; sum < M; i++) {
int m = pairs[i].second;
if (sum + m > M)
m = M - sum;
sum += pairs[i].second;
res += pairs[i].first * m;
}
cout << res << endl;
return 0;
} | [
"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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
ll N, M;
cin >> N >> M;
ll A[N];
ll B[N];
pair<int, int> p;
vector<pair<int, int>> vec;
FOR(i, 0, N - 1) {
cin >> A[i] >> B[i];
p.first = A[i];
p.second = B[i];
vec.push_back(p);
}
sort(vec.begin(), vec.end());
ll tmp = 0;
ll ans = 0;
FOR(i, 0, N - 1) {
if (tmp + vec[i].second <= M) {
ans = ans + vec[i].first * vec[i].second;
tmp = tmp + vec[i].second;
} else if (tmp < M) {
ans = ans + vec[i].first * (M - tmp);
tmp = M;
}
}
cout << ans << endl;
return 0;
}
| #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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
ll N, M;
cin >> N >> M;
ll A[N];
ll B[N];
pair<ll, ll> p;
vector<pair<ll, ll>> vec;
FOR(i, 0, N - 1) {
cin >> A[i] >> B[i];
p.first = A[i];
p.second = B[i];
vec.push_back(p);
}
sort(vec.begin(), vec.end());
ll tmp = 0;
ll ans = 0;
FOR(i, 0, N - 1) {
if (tmp + vec[i].second <= M) {
ans = ans + vec[i].first * vec[i].second;
tmp = tmp + vec[i].second;
} else if (tmp < M) {
ans = ans + vec[i].first * (M - tmp);
tmp = M;
}
}
cout << ans << endl;
return 0;
}
| [] | 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, const PandC &y) { return x.p < y.p; });
int count = 0;
for (int i = 0; i < N; i++) {
int M_remain = M - count;
if (M_remain > pc_list[i].c) {
answer += pc_list[i].p * pc_list[i].c;
count += pc_list[i].c;
} else {
answer += pc_list[i].p * M_remain;
break;
}
}
cout << answer;
}
| #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 PandC &x, const PandC &y) { return x.p < y.p; });
int count = 0;
for (int i = 0; i < N; i++) {
long M_remain = M - count;
if (M_remain > pc_list[i].c) {
answer += pc_list[i].p * pc_list[i].c;
count += pc_list[i].c;
} else {
answer += pc_list[i].p * M_remain;
break;
}
}
cout << answer;
} | [
"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_me_dont_worry \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// Use cout.flush() for interactive problems.
// Use this for increased stack size: g++ -o a.exe -Wl,--stack=256000000 -O2
// source.cpp
inline long long MAX2(long long a, long long int b) {
return (a) > (b) ? (a) : (b);
}
inline long long MAX3(long long a, long long b, long long c) {
return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c));
}
inline long long MIN2(long long a, long long b) {
return (a) < (b) ? (a) : (b);
}
inline long long MIN3(long long a, long long b, long long c) {
return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c));
}
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
int main() {
she_told_me_dont_worry set<pll> pq;
ll n, m;
cin >> n >> m;
ll a[n + 5], b[n + 5];
int i;
FOR0(i, n) {
cin >> a[i] >> b[i];
pq.insert(mp(a[i], b[i]));
}
ll cur = 0;
ll ans = 0;
while (cur < m) {
pll cp = *pq.begin();
pq.erase(pq.begin());
ll req = m - cur;
ll use = MIN2(req, cp.ss);
cur += use;
ans += cp.ff * use;
}
cout << ans;
cerr << endl
<< "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n';
} | #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_me_dont_worry \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// Use cout.flush() for interactive problems.
// Use this for increased stack size: g++ -o a.exe -Wl,--stack=256000000 -O2
// source.cpp
inline long long MAX2(long long a, long long int b) {
return (a) > (b) ? (a) : (b);
}
inline long long MAX3(long long a, long long b, long long c) {
return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c));
}
inline long long MIN2(long long a, long long b) {
return (a) < (b) ? (a) : (b);
}
inline long long MIN3(long long a, long long b, long long c) {
return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c));
}
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
int main() {
she_told_me_dont_worry multiset<pll> pq;
ll n, m;
cin >> n >> m;
ll a[n + 5], b[n + 5];
int i;
FOR0(i, n) {
cin >> a[i] >> b[i];
pq.insert(mp(a[i], b[i]));
}
ll cur = 0;
ll ans = 0;
while (cur < m) {
pll cp = *pq.begin();
pq.erase(pq.begin());
ll req = m - cur;
ll use = MIN2(req, cp.ss);
cur += use;
ans += cp.ff * use;
}
cout << ans;
cerr << endl
<< "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n';
} | [
"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[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
int buy = min(m, AB[i].second);
ans += buy * AB[i].first;
m -= buy;
}
cout << ans;
return 0;
} | #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[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
int buy = min(m, AB[i].second);
ans += (long long)buy * AB[i].first;
m -= buy;
}
cout << ans;
return 0;
} | [
"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[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
int buy = min(m, AB[i].second);
ans = buy * AB[i].first;
m -= buy;
}
cout << ans;
return 0;
} | #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[i] = make_pair(A[i], B[i]);
}
sort(AB.begin(), AB.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
int buy = min(m, AB[i].second);
ans += (long long)buy * AB[i].first;
m -= buy;
}
cout << ans;
return 0;
} | [
"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, Node + n, cmp);
ll ans = 0;
int i = 0;
while (m > 0) {
if (m >= Node[i].b) {
m -= Node[i].b;
ans += (ll)Node[i].b * Node[i].a;
} else
ans += Node[i].a * m, m = 0;
i++;
}
printf("%lld\n", ans);
return 0;
}
| #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(Node, Node + n, cmp);
ll ans = 0;
int i = 0;
while (m > 0) {
if (m >= Node[i].b) {
m -= Node[i].b;
ans += Node[i].b * Node[i].a;
} else
ans += Node[i].a * m, m = 0;
i++;
}
printf("%lld\n", ans);
return 0;
}
| [
"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, Node + n, cmp);
ll ans = 0;
int i = 0;
while (m > 0) {
if (m >= Node[i].b) {
m -= Node[i].b;
ans += Node[i].b * Node[i].a;
} else
ans += Node[i].a * m, m = 0;
i++;
}
printf("%lld\n", ans);
return 0;
}
| #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(Node, Node + n, cmp);
ll ans = 0;
int i = 0;
while (m > 0) {
if (m >= Node[i].b) {
m -= Node[i].b;
ans += Node[i].b * Node[i].a;
} else
ans += Node[i].a * m, m = 0;
i++;
}
printf("%lld\n", ans);
return 0;
}
| [
"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[i]);
}
sort(AB.begin(), AB.end()); // ソートアルゴリズム
long long ans = 0;
for (int i = 0; i < N; ++i) {
int buy = min(M, AB[i].second); // 残り本数か、店で買える上限
ans += (long long)buy * AB[i].first;
M--; // 残り本数を減らす
}
cout << ans << endl;
} | #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[i]);
}
// ソートする
sort(AB.begin(), AB.end());
// 順にとっていく
long long ans = 0;
for (int i = 0; i < N; ++i) {
int buy = min(M, AB[i].second); // 買う個数
ans += (long long)buy * AB[i].first;
M -= buy;
}
cout << ans << endl;
}
| [] | 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[i]);
}
sort(AB.begin(), AB.end()); // ソートアルゴリズム
long long ans = 0;
for (int i = 0; i < N; ++i) {
int buy = min(M, AB[i].second); // 残り本数か、店で買える上限
ans += (long long)buy * AB[i].first;
M--; // 残り本数を減らす
}
cout << ans << endl;
} | #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[i]);
}
sort(AB.begin(), AB.end()); // ソートアルゴリズム
long long ans = 0;
for (int i = 0; i < N; ++i) {
int buy = min(M, AB[i].second); // 残り本数か、店で買える上限
ans += (long long)buy * AB[i].first;
M -= buy; // 残り本数を減らす
}
cout << ans << endl;
} | [] | 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 = 0) {
cout << i;
break;
}
}
return 0;
}
| #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 == 0) {
cout << i;
break;
}
}
return 0;
}
| [
"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.push_back(i);
}
}
cout << ans[k - 1] << endl;
return 0;
}
| #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.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 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;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i < min(A, B) + 1; i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
}
}
reverse(all(vec));
cout << vec[K] << endl;
return 0;
}
| #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;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i < min(A, B) + 1; i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
}
}
reverse(all(vec));
cout << vec[K - 1] << endl;
return 0;
}
| [
"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;
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_back(i);
}
}
reverse(all(vec));
cout << vec[K] << endl;
return 0;
}
| #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;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> vec;
for (int i = 1; i < min(A, B) + 1; i++) {
if (A % i == 0 && B % i == 0) {
vec.push_back(i);
}
}
reverse(all(vec));
cout << vec[K - 1] << endl;
return 0;
}
| [
"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 <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
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)
int count(int N) {
int ans = 0;
while (N) {
ans++;
N /= 10;
}
return ans;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = min(A, B); i >= 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
}
}
return 0;
}
| #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 <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
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)
int count(int N) {
int ans = 0;
while (N) {
ans++;
N /= 10;
}
return ans;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = min(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
}
if (K == 0) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"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 {
vb[i]++;
if (N / i != i)
vb[N / i]++;
}
}
}
return;
}
int main() {
long long a, b, k;
cin >> a >> b >> k;
enum_divisors(a, 1);
// for (int x:va) cout << x << " ";
// cout<<endl;
enum_divisors(b, 0);
// for (int x:vb) cout << x << " ";
int cnt = 0;
for (int i = 100; i >= 1; i++) {
if (va[i] > 0 && vb[i] > 0) {
cnt++;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
return 0;
} | #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 {
vb[i]++;
if (N / i != i)
vb[N / i]++;
}
}
}
return;
}
int main() {
long long a, b, k;
cin >> a >> b >> k;
enum_divisors(a, 1);
// for (int x:va) cout << x << " ";
// cout<<endl;
enum_divisors(b, 0);
// for (int x:vb) cout << x << " ";
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (va[i] > 0 && vb[i] > 0) {
cnt++;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
return 0;
} | [] | 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)) {
cnt += 1;
}
}
cout << ans << endl;
}
| #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)) {
cnt += 1;
}
}
cout << ans << endl;
}
| [
"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) {
K--;
}
if (K == 0) {
cout << 100 - i << endl;
break;
}
}
} | #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) {
K--;
}
if (K == 0) {
cout << 100 - i << endl;
break;
}
}
} | [
"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 + x, greater<int>());
int ans = x[k - 1];
cout << ans << endl;
} | #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 + x, greater<int>());
int ans = x[k - 1];
cout << ans << endl;
} | [
"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_REP(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2)(__VA_ARGS__)
#define IN(type, n) \
type n; \
cin >> n
#define INALL(type, v) \
REP(i, v.size()) { \
IN(type, _tmp); \
v.at(i) = _tmp; \
}
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
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 (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
int main() {
IN(int, A);
IN(int, B);
IN(int, K);
int rng = A;
chmin(rng, B);
int count = 0;
REP(i, 1, rng + 1) {
if ((A % i == 0) && (B % i == 0)) {
count++;
if (count == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| #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_REP(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2)(__VA_ARGS__)
#define IN(type, n) \
type n; \
cin >> n
#define INALL(type, v) \
REP(i, v.size()) { \
IN(type, _tmp); \
v.at(i) = _tmp; \
}
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
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 (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
int main() {
IN(int, A);
IN(int, B);
IN(int, K);
int rng = A;
chmin(rng, B);
int count = 0;
RREP(i, 1, rng + 1) {
if ((A % i == 0) && (B % i == 0)) {
count++;
if (count == K) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| [
"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 < (n); i++)
int main() {
int A, B;
int K;
cin >> A >> B >> K;
int ans = 0;
int cnt = 0;
int temp = 0;
int c = min(A, B);
int d = max(A, B);
vector<int> v;
for (int i = 1; i <= c; i++) {
if (c % i == 0 && d % i == 0) {
v.push_back(i);
}
}
cout << v[K - 1] << endl;
}
| #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 < (n); i++)
int main() {
int A, B;
int K;
cin >> A >> B >> K;
int ans = 0;
int cnt = 0;
int temp = 0;
int c = min(A, B);
int d = max(A, B);
vector<int> v;
for (int i = 1; i <= c; i++) {
if (c % i == 0 && d % 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,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;
return 0;
}
| [] | 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.end());
sort(ad.begin(), ad.end());
vector<int> cd;
for (int i = 0; i < ad.size() - 1; i++) {
if (ad[i] == ad[i + 1]) {
cd.push_back(i);
}
}
reverse(cd.begin(), cd.end());
cout << cd[k - 1] << endl;
} | #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.end());
sort(ad.begin(), ad.end());
vector<int> cd;
for (int i = 0; i < ad.size() - 1; i++) {
if (ad[i] == ad[i + 1]) {
cd.push_back(ad[i]);
}
}
reverse(cd.begin(), cd.end());
cout << cd[k - 1] << endl;
} | [
"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_back(i);
}
}
cout << vec.at(K - 1) << endl;
} | #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_back(i);
}
}
cout << vec.at(vec.size() - K) << endl;
} | [
"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 Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
/*全てのライブラリをインクルード*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
int c = gcd(a, b);
if (k == 1) {
cout << c << endl;
return 0;
}
for (int i = 1; i < c; i++) {
if (c % i == 0) {
count++;
}
if (count == k) {
cout << c / i << endl;
return 0;
}
}
return 0;
} | // 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 Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
/*全てのライブラリをインクルード*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
int c = gcd(a, b);
if (k == 1) {
cout << c << endl;
return 0;
}
for (int i = 1; i <= c; i++) {
if (c % i == 0) {
count++;
}
if (count == k) {
cout << c / i << endl;
return 0;
}
}
return 0;
} | [
"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);
}
}
sort(v.begin(), v.end());
cout << v[c - 1] << endl;
} else {
for (int i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.rbegin(), v.rend());
cout << v[c - 1] << endl;
}
return 0;
} | // بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
// لآ اِلَهَ اِلّا اللّهُ مُحَمَّدٌ رَسُوُل اللّهِ
#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);
}
}
sort(v.rbegin(), v.rend());
cout << v[c - 1] << endl;
} else {
for (int i = 1; i <= a; i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.rbegin(), v.rend());
cout << v[c - 1] << endl;
}
return 0;
} | [
"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(i);
}
}
for (int i = 0; i < k - 1; i++) {
d.pop();
}
cout << d.front() << endl;
} | #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(i);
}
}
for (int i = 0; i < k - 1; i++) {
d.pop();
}
cout << d.front() << endl;
} | [
"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 == k) {
cout << i << endl;
return 0;
}
}
}
}
// 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;
// }
// }
// }
// assert ( false );
// }
| #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 == k) {
cout << i << endl;
return 0;
}
}
}
}
// 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;
// }
// }
// }
// assert ( false );
// }
| [
"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 == k) {
cout << i << endl;
break;
}
}
}
}
| #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 == k) {
cout << i << endl;
return 0;
}
}
}
}
// 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;
// }
// }
// }
// assert ( false );
// }
| [
"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 gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll A, B, K;
cin >> A >> B >> K;
ll x = gcd(A, B);
vector<ll> v = divisor(x);
cout << v.at(K - 1) << endl;
} | #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 gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll A, B, K;
cin >> A >> B >> K;
ll x = gcd(A, B);
vector<ll> v = divisor(x);
cout << v.at(v.size() - K) << endl;
} | [
"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 % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end(), greater<int>());
int vsize = v.size();
int ans = v.at(vsize - k);
cout << ans << endl;
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
| // 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 % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end(), greater<int>());
int vsize = v.size();
int ans = v.at(k - 1);
cout << ans << endl;
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
| [
"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() - k] << endl;
}
| #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() - k] << endl;
}
| [
"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) {
ans.push_back(i);
}
}
cout << ans[ans.size() - 4] << endl;
return 0;
}
| #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) {
ans.push_back(i);
}
}
cout << ans[ans.size() - K] << endl;
return 0;
}
| [
"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);
}
}
cout << x[k - 1] << endl;
} | #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);
}
}
cout << x[k - 1] << endl;
return 0;
} | [
"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) ((s).substr((f), (t) - (f)))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, k;
cin >> a >> b >> k;
ll cnt = 0;
for (ll i = 1;; i++) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #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) ((s).substr((f), (t) - (f)))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, k;
cin >> a >> b >> k;
ll cnt = 0;
for (ll i = 1111;; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"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")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
inline void init_main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
#pragma endregion
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
};
Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
using mint = Fp<MOD>;
inline ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
init_main();
ll a, b, k;
cin >> a >> b >> k;
k--;
for (ll i = 1;; i++) {
if (a % i == 0 && b % i == 0) {
if (k == 0) {
cout << i << endl;
return 0;
} else {
k--;
}
}
}
return 0;
}
| #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")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
inline void init_main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
#pragma endregion
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
};
Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
using mint = Fp<MOD>;
inline ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
init_main();
ll a, b, k;
cin >> a >> b >> k;
k--;
for (ll i = a * b;; i--) {
if (a % i == 0 && b % i == 0) {
if (k == 0) {
cout << i << endl;
return 0;
} else {
k--;
}
}
}
return 0;
}
| [
"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; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)
#define foreach(i, vec) for (auto &&i : vec)
#define all(x) (x).begin(), (x).end()
#define SORT(x) sort(all(x))
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) \
int x; \
cin >> x
#define cill(x) \
LL x; \
cin >> x
#define cis(x) \
string x; \
cin >> x
#define co(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define truecheck assert
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
typedef long long LL;
typedef long long int64;
typedef std::vector<int> VI;
typedef std::vector<VI> VVI;
typedef std::vector<LL> VL;
typedef std::vector<VL> VVL;
typedef std::vector<string> VS;
typedef std::pair<int, int> PII;
typedef std::pair<int64, int64> PLL;
typedef std::queue<int> QI;
typedef std::priority_queue<int> PQI;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline void vcin(T &v, U n) {
rep(i, n) {
typename T::value_type a;
cin >> a;
v.pb(a);
}
}
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
// M_PI 3.1415...
int main() {
fastcin();
cout << fixed << setprecision(10);
cill(a);
cill(b);
cill(k);
LL ans = 0;
rREP(i, 1, 101) {
if (a % i == 0 && b % i == 0)
ans++;
if (ans == k)
co(i);
break;
}
return 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; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)
#define foreach(i, vec) for (auto &&i : vec)
#define all(x) (x).begin(), (x).end()
#define SORT(x) sort(all(x))
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) \
int x; \
cin >> x
#define cill(x) \
LL x; \
cin >> x
#define cis(x) \
string x; \
cin >> x
#define co(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define truecheck assert
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
typedef long long LL;
typedef long long int64;
typedef std::vector<int> VI;
typedef std::vector<VI> VVI;
typedef std::vector<LL> VL;
typedef std::vector<VL> VVL;
typedef std::vector<string> VS;
typedef std::pair<int, int> PII;
typedef std::pair<int64, int64> PLL;
typedef std::queue<int> QI;
typedef std::priority_queue<int> PQI;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline void vcin(T &v, U n) {
rep(i, n) {
typename T::value_type a;
cin >> a;
v.pb(a);
}
}
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
// M_PI 3.1415...
int main() {
fastcin();
cout << fixed << setprecision(10);
cill(a);
cill(b);
cill(k);
LL ans = 0;
rREP(i, 1, 101) {
if (a % i == 0 && b % i == 0)
ans++;
if (ans == k) {
co(i);
break;
}
}
return 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 = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define rvisort(v) sort(v.begin(), v.end(), greater<int>());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using ul = unsigned long;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
map<ll, ll> primeFact(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
void printv(vi &v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vll &v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(vi &v) {
int total = 0;
rep(i, v.size()) total += v[i];
return total;
}
int main() {
// init(); // mint初期化
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int c = a;
if (a > b)
c = b;
int cnt = 0;
int ans = 0;
reps(i, c) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | #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 = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define rvisort(v) sort(v.begin(), v.end(), greater<int>());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using ul = unsigned long;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 4000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
mint comb(int n, int k) { return c[n][k]; }
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
map<ll, ll> primeFact(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n]++;
return res;
}
void printv(vi &v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vll &v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(vi &v) {
int total = 0;
rep(i, v.size()) total += v[i];
return total;
}
int main() {
// init(); // mint初期化
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int c = a;
if (a > b)
c = b;
int cnt = 0;
int ans = 0;
rreps(i, c) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | [
"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> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
vec ans = divisor(gcd(a, b));
sort(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
} | #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> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
return res;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
vec ans = divisor(gcd(a, b));
sort(ans.rbegin(), ans.rend());
cout << ans[k - 1] << endl;
} | [
"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;
if (count == K) {
cout << i << endl;
return 0;
}
}
} | #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 (count == K) {
cout << i << endl;
return 0;
}
}
} | [
"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<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
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 (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
int a, b, k, cnt = 0;
R a >> b >> k;
REP(i, 1, 100) {
if (a % i == 0 && b % i == 0) {
cnt += 1;
if (cnt == k) {
co(i);
return 0;
}
}
}
} | #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<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
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 (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
int a, b, k, cnt = 0;
R a >> b >> k;
repr(i, 100) {
if (a % i == 0 && b % i == 0) {
cnt += 1;
if (cnt == k) {
co(i);
return 0;
}
}
}
} | [
"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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800 / 2
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr double dabs(double a, double b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
bool issame(int x, int y) { return root(x) == root(y); }
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
std::vector<ll> enum_div(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
// グラフセット
struct Edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<ll>>;
#define def 0
template <class V, int NV> struct SegTree { //[l,r)
V comp(V &l, V &r) { return max(l, r); };
vector<V> val;
SegTree() { val = vector<V>(NV * 2, def); }
V get(int x, int y, int l = 0, int r = NV, int k = 1) {
if (r <= x || y <= l)
return def;
if (x <= l && r <= y)
return val[k];
auto a = get(x, y, l, (l + r) / 2, k * 2);
auto b = get(x, y, (l + r) / 2, r, k * 2 + 1);
return comp(a, b);
}
void update(int i, V v) {
i += NV;
val[i] = v;
while (i > 1)
i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);
}
void add(int i, V v) { update(i, val[i + NV] + v); }
V operator[](int x) { return get(x, x + 1); }
};
typedef vector<vector<long long>> matrix;
matrix mul_mod(matrix A, matrix B) {
int H = A.size();
int W = B[0].size();
int K = A[0].size();
matrix C(H, vector<ll>(W, 0));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
for (int k = 0; k < K; k++) {
C[i][j] += A[i][k] * B[k][j];
C[i][j] %= MOD;
}
}
}
return C;
}
matrix pow_mod_matrix(matrix A, ll p) {
matrix ret = matrix(A.size(), vector<long long>(A.size(), 0));
for (int i = 0; i < A.size(); i++)
ret[i][i] = 1;
while (p > 0) {
if (p & 1)
ret = mul_mod(ret, A);
A = mul_mod(A, A);
p >>= 1;
}
return ret;
}
// std::setprecision(30)<<ans<<endl;
int main() {
ll N, M, K;
cin >> N >> M >> K;
ll ans = 0;
FOR(i, 1, 100) {
if (gcd(N, M) % i == 0)
K--;
ans = i;
if (K == 0)
break;
}
cout << ans << endl;
return 0;
}
| #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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800 / 2
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr double dabs(double a, double b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
bool issame(int x, int y) { return root(x) == root(y); }
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
std::vector<ll> enum_div(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
// グラフセット
struct Edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<ll>>;
#define def 0
template <class V, int NV> struct SegTree { //[l,r)
V comp(V &l, V &r) { return max(l, r); };
vector<V> val;
SegTree() { val = vector<V>(NV * 2, def); }
V get(int x, int y, int l = 0, int r = NV, int k = 1) {
if (r <= x || y <= l)
return def;
if (x <= l && r <= y)
return val[k];
auto a = get(x, y, l, (l + r) / 2, k * 2);
auto b = get(x, y, (l + r) / 2, r, k * 2 + 1);
return comp(a, b);
}
void update(int i, V v) {
i += NV;
val[i] = v;
while (i > 1)
i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);
}
void add(int i, V v) { update(i, val[i + NV] + v); }
V operator[](int x) { return get(x, x + 1); }
};
typedef vector<vector<long long>> matrix;
matrix mul_mod(matrix A, matrix B) {
int H = A.size();
int W = B[0].size();
int K = A[0].size();
matrix C(H, vector<ll>(W, 0));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
for (int k = 0; k < K; k++) {
C[i][j] += A[i][k] * B[k][j];
C[i][j] %= MOD;
}
}
}
return C;
}
matrix pow_mod_matrix(matrix A, ll p) {
matrix ret = matrix(A.size(), vector<long long>(A.size(), 0));
for (int i = 0; i < A.size(); i++)
ret[i][i] = 1;
while (p > 0) {
if (p & 1)
ret = mul_mod(ret, A);
A = mul_mod(A, A);
p >>= 1;
}
return ret;
}
// std::setprecision(30)<<ans<<endl;
int main() {
ll N, M, K;
cin >> N >> M >> K;
ll ans = 0;
RFOR(i, 100, 1) {
if (gcd(N, M) % i == 0)
K--;
ans = i;
if (K == 0)
break;
}
cout << ans << endl;
return 0;
}
| [
"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);
}
cout << p[k - 1] << endl;
return 0;
} | #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);
}
cout << p[p.size() - k] << endl;
return 0;
} | [
"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;
for (int i = 1; i < n; i++) {
if (a % i == 0 && b % i == 0)
arr.push_back(i);
}
sort(arr.rbegin(), arr.rend());
Cout(arr[k]);
return 0;
} | #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;
for (int i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0)
arr.push_back(i);
}
sort(arr.rbegin(), arr.rend());
Cout(arr[k]);
return 0;
} | [
"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--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
ll a, b, k;
cin >> a >> b >> k;
vll d(0);
for (int i = 100; i >= 1; i--) {
if (a % i == b % i == 0) {
d.pb(i);
}
}
COUT(d[k - 1]);
}
| #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--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
ll a, b, k;
cin >> a >> b >> k;
vll d(0);
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.pb(i);
}
}
COUT(d[k - 1]);
}
| [
"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] = i;
count++;
}
}
cout << divisor[k - 1] << endl;
}
| #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 << endl;
divisor[count] = i;
count++;
}
}
cout << divisor[count - k] << endl;
}
| [
"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 += 1;
if (cnt == k) {
ans = i;
break;
}
}
}
cout << ans << endl;
} | #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 += 1;
if (cnt == k) {
ans = i;
break;
}
}
}
cout << ans << endl;
} | [
"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) {
cout << big / i << endl;
}
}
}
}
| #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) {
cout << big / i << endl;
}
}
}
} | [
"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);
ll a, b, k;
cin >> a >> b >> k;
ll g = __gcd(a, b);
ll cnt = 0;
for (int i = g; i; i--) {
if (g % i == 0) {
cnt++;
if (cnt = k)
return cout << i, 0;
}
}
return (0);
} | #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);
ll a, b, k;
cin >> a >> b >> k;
ll g = __gcd(a, b);
ll cnt = 0;
for (int i = g; i; i--) {
if (g % i == 0) {
cnt++;
if (cnt == k)
return cout << i, 0;
}
}
return (0);
} | [
"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) {
ans++;
}
}
} | #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) {
ans++;
}
}
} | [
"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;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI = 3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for (int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y)-1) / (y))
#define MOD 1000000007ULL
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int C = gcd(A, B);
int ans;
for (int div = C; div >= 1 && K > 0; --div) {
if (C % div == 0) {
--K;
if (K == 0)
ans = C / div;
}
}
cout << ans << "\n";
return 0;
}
| #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;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI = 3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for (int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y)-1) / (y))
#define MOD 1000000007ULL
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int C = gcd(A, B);
int ans;
for (int div = C; div >= 1 && K > 0; --div) {
if (C % div == 0) {
--K;
if (K == 0)
ans = div;
}
}
cout << ans << "\n";
return 0;
}
| [
"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++;
}
cout << ans << endl;
} | #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++;
}
cout << ans << endl;
} | [
"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 <complex>
#include <cstdio>
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ll> pdl;
typedef pair<ld, ld> pdd;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
// typedef boost::multiprecision::cpp_int bigint;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll A, B, C;
cin >> A >> B >> C;
ll c = 0;
ll p = min(A, B);
while (c < C) {
if (A % p == 0 && B % p == 0)
c++;
p--;
}
cout << p << endl;
return 0;
} | #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 <complex>
#include <cstdio>
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ll> pdl;
typedef pair<ld, ld> pdd;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
// typedef boost::multiprecision::cpp_int bigint;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll A, B, C;
cin >> A >> B >> C;
ll c = 0;
ll p = min(A, B);
while (c < C) {
if (A % p == 0 && B % p == 0)
c++;
p--;
}
cout << p + 1 << endl;
return 0;
} | [
"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 1000000007
#define fcout cout << fixed << setprecision(15) // 15桁まで表示
#define str string
typedef std::pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<ui, ui> puu;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<str> vs;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int floor(int a, int b) { return (a + b - 1) / b; };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
int main() {
int a, b, k, ans = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
ans++;
if (ans == k)
;
cout << i << endl;
break;
}
}
} | #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 1000000007
#define fcout cout << fixed << setprecision(15) // 15桁まで表示
#define str string
typedef std::pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<ui, ui> puu;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<str> vs;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int floor(int a, int b) { return (a + b - 1) / b; };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
int main() {
int a, b, k, ans = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
ans++;
if (ans == k) {
cout << i << endl;
break;
}
}
}
}
| [] | 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 1000000007
#define fcout cout << fixed << setprecision(15) // 15桁まで表示
#define str string
typedef std::pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<ui, ui> puu;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<str> vs;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int floor(int a, int b) { return (a + b - 1) / b; };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
int main() {
int a, b, k, ans = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i <= 1; i--) {
if (a % i == 0 && b % i == 0) {
ans++;
if (ans == k)
;
cout << i << endl;
break;
}
}
} | #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 1000000007
#define fcout cout << fixed << setprecision(15) // 15桁まで表示
#define str string
typedef std::pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<ui, ui> puu;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<str> vs;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; };
int lcm(int a, int b) { return a * b / gcd(a, b); };
int floor(int a, int b) { return (a + b - 1) / b; };
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
int main() {
int a, b, k, ans = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
ans++;
if (ans == k) {
cout << i << endl;
break;
}
}
}
}
| [
"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 && b % i == 0) {
++count;
if (count == k) {
cout << i;
return 0;
}
}
}
return 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 && b % i == 0) {
++count;
if (count == k) {
cout << i;
return 0;
}
}
}
return 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.