problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> k >> n;
cout << n - k << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> n >> k;
cout << n - k + 1 << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 864,530 | 864,529 | u211227348 | cpp |
p03047 | #include <iostream>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int res;
res = n - k - 1;
cout << res << endl;
} | #include <iostream>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int res;
res = n - (k - 1);
cout << res << endl;
}
| [] | 864,531 | 864,532 | u647067734 | cpp |
p03047 | // diverta2019_a
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <un... | // diverta2019_a
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <un... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,533 | 864,534 | u180077477 | cpp |
p03047 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int dy[4] = {1, 0, -1, 0}, dx[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
cout << min(n, k) << endl... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int dy[4] = {1, 0, -1, 0}, dx[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
cout << n + 1 - k << endl... | [
"call.remove",
"io.output.change",
"call.arguments.change"
] | 864,541 | 864,542 | u946090308 | cpp |
p03047 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m;
cin >> n >> m;
cout << n + 1 - 1;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, m;
cin >> n >> m;
cout << n + 1 - m;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 864,545 | 864,546 | u724880258 | cpp |
p03047 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
} | [
"expression.operation.binary.add"
] | 864,555 | 864,556 | u596187345 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 500010
#define pb push_back
ll arr[mx];
ll brr[mx];
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
cout << n - m - 1 << endl;
// cout << fixed << showpoint;
// cout << setprecision(12);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 500010
#define pb push_back
ll arr[mx];
ll brr[mx];
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
cout << n - (m - 1) << endl;
// cout << fixed << showpoint;
// cout << setprecision(12);
}
| [] | 864,557 | 864,558 | u040027067 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N, K;
cout << N - K + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
}
| [] | 864,559 | 864,560 | u221582238 | cpp |
p03047 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"call.remove",
"io.output.change"
] | 864,561 | 864,562 | u043443359 | cpp |
p03047 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | [
"expression.operation.binary.remove"
] | 864,563 | 864,564 | u591824072 | cpp |
p03047 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
cout << b - a + 1;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
cout << a - b + 1;
return 0;
}
| [
"expression.operation.binary.remove"
] | 864,565 | 864,566 | u048840514 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int result = N - K - 1;
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int result = N - K + 1;
cout << result << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 864,569 | 864,570 | u111653921 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
cout << N - K - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
cout << N - K + 1 << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,597 | 864,598 | u111559399 | cpp |
p03047 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << n - ((k + 1) / 2) << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| [] | 864,601 | 864,602 | u355923883 | cpp |
p03047 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int n, k;
cin >> n, k;
int ans = n - k + 1;
cout << ans;
// Your code here!
return 0;
}
| #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int ans = n - k + 1;
cout << ans;
// Your code here!
return 0;
} | [] | 864,608 | 864,609 | u171872002 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << B - A + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A - B + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 864,612 | 864,613 | u277354326 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << B - A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A - B + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 864,614 | 864,613 | u277354326 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int n, k;
int main() {
cin >> n >> k;
cout << n - n % k;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int n, k;
int main() {
cin >> n >> k;
cout << n - (k - 1);
return 0;
} | [
"io.output.change"
] | 864,621 | 864,622 | u651116403 | cpp |
p03047 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
cout << n - k + 1 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
cout << k - n + 1 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 864,623 | 864,624 | u712658424 | cpp |
p03047 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
N = N - K - 1;
cout << N << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
N = N - K + 1;
cout << N << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 864,631 | 864,632 | u780684946 | cpp |
p03047 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
cout << (N + 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;
int main() {
int N, K;
cin >> N >> K;
cout << (N - K + 1) << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,637 | 864,638 | u944316525 | cpp |
p03047 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | [
"literal.string.change",
"call.arguments.change"
] | 864,641 | 864,642 | u810616694 | cpp |
p03047 | #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"io.output.change"
] | 864,643 | 864,644 | u235396011 | cpp |
p03047 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N, K;
cout << N - K + 1 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
return 0;
} | [] | 864,653 | 864,654 | u300866293 | cpp |
p03047 | #include <iostream>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
cout << n - k + 1 << endl;
} | #include <iostream>
using namespace std;
int main() {
int k, n;
cin >> n >> k;
cout << n - k + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 864,665 | 864,666 | u018742029 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B - 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A - B + 1;
} | [
"expression.operation.binary.remove"
] | 864,672 | 864,673 | u456753570 | cpp |
p03047 | #include <stdio.h>
int main(void) {
int n = 0, k = 0, a = 0;
scanf("%d, %d", &n, &k);
if (n < k) {
a = 0;
} else {
a = n - (k - 1);
}
printf("%d\n", a);
}
| #include <stdio.h>
int main(void) {
int n = 0, k = 0, a = 0;
scanf("%d %d", &n, &k);
if (n < k) {
a = 0;
} else {
a = n - (k - 1);
}
printf("%d\n", a);
}
| [
"literal.string.change",
"call.arguments.change"
] | 864,681 | 864,682 | u165974862 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N, K;
cout << 1 + (N - K) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
cout << 1 + (N - K) << endl;
return 0;
} | [] | 864,685 | 864,686 | u335770593 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
cout << n - k - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
cout << n - (k - 1) << endl;
return 0;
} | [] | 864,696 | 864,697 | u604008502 | cpp |
p03047 | #include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned short int unsi;
typedef unsigned int uni;
typedef unsigned long int unli;
using namespace std;
unsi gojoho(unsi A, unsi B) {
unsi R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
... | #include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned short int unsi;
typedef unsigned int uni;
typedef unsigned long int unli;
using namespace std;
unsi gojoho(unsi A, unsi B) {
unsi R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
... | [
"expression.operation.binary.remove",
"assignment.change"
] | 864,716 | 864,717 | u848871413 | cpp |
p03047 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
cout << N - K - 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
cout << N - K + 1 << '\n';
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,733 | 864,734 | u009579822 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
int N, K;
cin >> N, K;
cout << N - K + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
return 0;
} | [
"io.output.newline.add"
] | 864,735 | 864,736 | u703669948 | cpp |
p03047 | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
scanf("&d", &K);
printf("%d", N - K + 1);
return 0;
}
| #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
printf("%d\n", N - K + 1);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 864,745 | 864,746 | u745781608 | cpp |
p03047 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main() {
int k, n;
cin >> k >> n;
cout << n - k + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main() {
int k, n;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 864,747 | 864,748 | u819160021 | cpp |
p03047 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K - 1;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,753 | 864,754 | u588369531 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"expression.operation.binary.remove"
] | 864,755 | 864,756 | u462560753 | cpp |
p03047 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"expression.operation.binary.remove"
] | 864,757 | 864,758 | u423143252 | cpp |
p03048 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
intt R, G, B, N;
std::cin >> R >> G >> B >> N;
intt ans = 0;
for (intt i = 0; i < N / R; ++i) {
for (intt j = 0; j < N / ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
intt R, G, B, N;
std::cin >> R >> G >> B >> N;
intt ans = 0;
for (intt i = 0; i < N / R + 1; ++i) {
for (intt j = 0; j < ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 864,767 | 864,768 | u917678406 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 864,776 | 864,777 | u946082956 | cpp |
p03048 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 100000000000000000; // = 10^17
// ABC文字列
const string ABC = "ABCDEFGHIJ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 100000000000000000; // = 10^17
// ABC文字列
const string ABC = "ABCDEFGHIJ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,778 | 864,779 | u453366189 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,780 | 864,781 | u513402782 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,782 | 864,781 | u513402782 | cpp |
p03048 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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)
#def... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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)
#def... | [
"literal.number.change",
"call.arguments.change"
] | 864,783 | 864,784 | u045091221 | cpp |
p03048 | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 864,785 | 864,786 | u692704469 | cpp |
p03048 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"literal.number.change",
"call.arguments.change"
] | 864,787 | 864,788 | u366581326 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a = 0, t;
cin >> r >> g >> b >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
t = n - r * i - g * j;
if (t % b == 0 && 0 <= t / b && t / b <= n)
a++;
}
}
cout << a;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a = 0, t;
cin >> r >> g >> b >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
t = n - r * i - g * j;
if (t % b == 0 && 0 <= t / b && t / b <= n)
a++;
}
}
cout << a;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,796 | 864,797 | u222643545 | cpp |
p03048 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(void) {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for (ll r = 0; r * R < N; r++) {
for (ll g = 0; g * G < N; g++) {
ll bn = N - r * R - g * G;
if (bn >= 0 && bn <= N && bn % B == 0) {
ans++;
}
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(void) {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for (ll r = 0; r * R <= N; r++) {
for (ll g = 0; g * G <= N; g++) {
ll bn = N - r * R - g * G;
if (bn >= 0 && bn <= N && bn % B == 0) {
ans++;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,807 | 864,808 | u803684095 | cpp |
p03048 | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 864,811 | 864,812 | u526459074 | cpp |
p03048 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
vector<ll> num(3);
ll n, ans = 0;
cin >> num[0] >> num[1] >> num[2] >> n;
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
if... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
vector<ll> num(3);
ll n, ans = 0;
cin >> num[0] >> num[1] >> num[2] >> n;
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= n; j++) {
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,817 | 864,818 | u378155378 | cpp |
p03048 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main... | [
"control_flow.branch.if.condition.change"
] | 864,828 | 864,829 | u828388155 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | [
"literal.number.change",
"call.arguments.change"
] | 864,830 | 864,831 | u832995587 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 864,832 | 864,831 | u832995587 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 864,833 | 864,831 | u832995587 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 1000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 1000... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,836 | 864,837 | u980909653 | cpp |
p03048 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define ... | [
"literal.number.change",
"call.arguments.change"
] | 864,838 | 864,839 | u154645927 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) {
return b / c - (a - 1) / c;
}
void print_binary(long long a) ... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) {
return b / c - (a - 1) / c;
}
void print_binary(long long a) ... | [
"literal.number.change",
"call.arguments.change"
] | 864,846 | 864,847 | u687204015 | cpp |
p03048 | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long... | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long... | [
"control_flow.loop.for.condition.change"
] | 864,852 | 864,853 | u971811058 | cpp |
p03048 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i <= (int)n; ++i)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n) rep(j, n) {
int tmp = n - r * i + g * j;
if (tmp % b == 0 && tmp >= 0)
++ans;
}
cout << ans << e... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i <= (int)n; ++i)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n) rep(j, n) {
int tmp = n - r * i - g * j;
if (tmp % b == 0 && tmp >= 0)
++ans;
}
cout << ans << e... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 864,864 | 864,865 | u933962236 | cpp |
p03048 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)n; ++i)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n) rep(j, n) {
int tmp = n - r * i + g * j;
if (tmp % b == 0 && tmp > 0)
++ans;
}
cout << ans << en... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i <= (int)n; ++i)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n) rep(j, n) {
int tmp = n - r * i - g * j;
if (tmp % b == 0 && tmp >= 0)
++ans;
}
cout << ans << e... | [
"preprocessor.define.value.change",
"literal.integer.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,866 | 864,865 | u933962236 | cpp |
p03048 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"expression.operation.binary.add"
] | 864,875 | 864,876 | u947236878 | cpp |
p03048 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n / r + 1) {
rep(j, n / g +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
rep(i, n / r + 1) {
rep(j, n / g +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,877 | 864,878 | u487530783 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = r; i <= n; i += r) {
for (int j = g; j <= n; j += g) {
int x = i + j;
if (n - x <= 0)
continue;
cnt += (n - x) % b == 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; i <= n; i += r) {
for (int j = 0; j <= n; j += g) {
int x = i + j;
if (n - x < 0)
continue;
cnt += (n - x) % b == 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,879 | 864,880 | u691380397 | cpp |
p03048 | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(x, n + 1) {
rep(y, n + 1) {
if... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(x, n + 1) {
rep(y, n + 1) {
if... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 864,885 | 864,886 | u547099897 | cpp |
p03048 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int x, y, z;
int ans = 0;
x = n / r + 1;
y = n / g + 1;
rep(i, x) {
rep(j, y) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int x, y, z;
int ans = 0;
x = n / r + 1;
y = n / g + 1;
rep(i, x) {
rep(j, y) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 864,900 | 864,901 | u816145694 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, num;
int cnt = 0;
cin >> r >> g >> b >> num;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
if (num - (r * i + g * j) >= 0)
continue;
if ((num - (r * i + g * j)) % b == 0)
cnt++;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, num;
int cnt = 0;
cin >> r >> g >> b >> num;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
if (num - (r * i + g * j) < 0)
continue;
if ((num - (r * i + g * j)) % b == 0)
cnt++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,910 | 864,911 | u367131219 | cpp |
p03048 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
te... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 864,918 | 864,919 | u135572611 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
long long count = 0;
for (int r = 0; r < 3000; r++) {
for (int g = 0; g < 3000; g++) {
if ((N - r * R - g * G) % B == 0 && (N - r * R - g * G) >= 0)
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
long long count = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((N - r * R - g * G) % B == 0 && (N - r * R - g * G) >= 0)
count++;
}
}
cout << count << endl;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,922 | 864,923 | u455586058 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
int count = 0;
for (int r = 0; r < 3000; r++) {
for (int g = 0; g < 3000; g++) {
if ((N - r * R - g * G) % B == 0 && (N - r * R - g * G) >= 0)
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
long long count = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if ((N - r * R - g * G) % B == 0 && (N - r * R - g * G) >= 0)
count++;
}
}
cout << count << endl;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 864,924 | 864,923 | u455586058 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i < (n); --i)
#define all(x) (x).begin(), (x).end()
#define gsort(x, n) sort((x), (x + n) greater<int>())
#define rv(s) reverse((s).begin(), (s).end())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i < (n); --i)
#define all(x) (x).begin(), (x).end()
#define gsort(x, n) sort((x), (x + n) greater<int>())
#define rv(s) reverse((s).begin(), (s).end())
#define ... | [
"literal.number.change",
"call.arguments.change"
] | 864,925 | 864,926 | u600244905 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int temp = N - R * i - G * j;
if (temp > 0 && temp % B == 0)
res++;
}
}
cout << res << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int temp = N - R * i - G * j;
if (temp >= 0 && temp % B == 0) {
res++;
}
}
}
cout << res << endl;
re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,952 | 864,953 | u878116546 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int temp = N - R * i - G * j;
if (temp > 0 && temp % B == 0)
res++;
}
}
cout << res << endl;
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
int temp = N - R * i - G * j;
if (temp >= 0 && temp % B == 0) {
res++;
}
}
}
cout << res << endl;
re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 864,954 | 864,953 | u878116546 | cpp |
p03048 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll; // long longをllとして簡略
int main() {
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n; //求めるのは数のみ
int ans = 0;
rep(x, n) {
rep(y, n) {
int temp = n - (r * x) - (g * y); // temp = bz
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll; // long longをllとして簡略
int main() {
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n; //求めるのは数のみ
int ans = 0;
rep(x, n + 1) {
rep(y, n + 1) {
int temp = n - (r * x) - (g * y); // temp... | [
"expression.operation.binary.add"
] | 864,957 | 864,958 | u951073166 | cpp |
p03048 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll; // long longをllとして簡略
int main() {
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n; //求めるのは数のみ
int ans = 1;
rep(x, n) {
rep(y, n) {
int temp = n - (r * x) - (g * y); // temp = bz
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll; // long longをllとして簡略
int main() {
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n; //求めるのは数のみ
int ans = 0;
rep(x, n + 1) {
rep(y, n + 1) {
int temp = n - (r * x) - (g * y); // temp... | [
"literal.number.change",
"variable_declaration.value.change"
] | 864,959 | 864,958 | u951073166 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 864,960 | 864,961 | u347057617 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | [
"expression.operation.binary.add"
] | 864,973 | 864,974 | u948618130 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 864,975 | 864,974 | u948618130 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r < 3000 / R; ++r) {
for (int g = 0; g < 3000 / G; ++g) {
int bB = N - r * R - g * G;
if (bB >= 0 && bB % B == 0)
ans++;
}
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= 3000; ++r) {
for (int g = 0; g <= 3000; ++g) {
int bB = N - r * R - g * G;
if (bB >= 0 && bB % B == 0)
ans++;
}
}
cout << ans << endl;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 864,976 | 864,977 | u871049538 | cpp |
p03048 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 864,987 | 864,988 | u419390395 | cpp |
p03048 | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <chrono>
#include <random>
using nam... | [] | 864,994 | 864,995 | u799443198 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"expression.operation.binary.remove"
] | 865,003 | 865,004 | u518883877 | cpp |
p03048 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 865,005 | 865,006 | u834415466 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r - G * g) / B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r - G * g) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,011 | 865,012 | u426572476 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r + G * g) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r - G * g) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,013 | 865,012 | u426572476 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r + G * g) / B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r - G * g) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,014 | 865,012 | u426572476 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, N;
cin >> P >> Q >> R >> N;
int count = 0;
int x = N / P + 1;
for (int i = 0; i < x; i++) {
for (int j = 0; j < (N - P * i) / Q + 1 && i + j < N + 1; j++) {
int B = N - P * i - Q * j;
if (B % R == 0 && B >= 0) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, N;
cin >> P >> Q >> R >> N;
int count = 0;
int x = N / P + 1;
for (int i = 0; i < x; i++) {
for (int j = 0; j < (N - P * i) / Q + 1 && i + j < N + 1; j++) {
int B = N - P * i - Q * j;
if (B % R == 0 && B >= 0)
cou... | [] | 865,023 | 865,024 | u424602097 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
unsigned ans = 0;
for (int b = 0; b <= N; b++) {
for (int g = 0; g <= N; g++) {
int B_G = b * B + g * G;
if (N >= B_G && (N - B_G) % B == 0) {
ans++;
}
}
}
cout << ans << endl;
}... | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
unsigned ans = 0;
for (int b = 0; b <= N; b++) {
for (int g = 0; g <= N; g++) {
int B_G = b * B + g * G;
if (N >= B_G && (N - B_G) % R == 0) {
ans++;
}
}
}
cout << ans << endl;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 865,036 | 865,037 | u026035020 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
int sum = 0;
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n;
int i = 0, j = 0;
for (i = 0; i <= n / r; i++) {
for (j = 0; j <= n / g; j++) {
if ((n - i * r + j * g) % b == 0 && 0 <= (n - i * r + j * g) / b) {
sum = sum + 1;
}... | #include <iostream>
using namespace std;
int main() {
int sum = 0;
int r, g, b;
cin >> r >> g >> b;
int n;
cin >> n;
int i = 0, j = 0;
for (i = 0; i <= n / r; i++) {
for (j = 0; j <= n / g; j++) {
if ((n - i * r - j * g) % b == 0 && 0 <= (n - i * r - j * g) / b) {
sum = sum + 1;
}... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,038 | 865,039 | u196746947 | cpp |
p03048 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
vector<int> c(3);
rep(i, 3) cin >> c[i];
sort(c.begin(), c.end());
int n;
cin >> n;
int i = 0, j = 0, cnt = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
vector<int> c(3);
rep(i, 3) cin >> c[i];
sort(c.begin(), c.end());
int n;
cin >> n;
int i = 0, j = 0, cnt = 0... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,042 | 865,043 | u732502311 | cpp |
p03048 | #include <iostream>
using namespace std;
int r, g, b, n, ans, i, j;
int main() {
cin >> r >> g >> b >> n;
for (i = 0; i * r <= n; i++) {
for (j = 0; j * g <= n - i * r; j++) {
if ((n - i * r - j * g) % b == 0)
;
ans++;
}
}
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int r, g, b, n, ans = 0, i, j;
int main() {
cin >> r >> g >> b >> n;
for (i = 0; i * r <= n; i++) {
for (j = 0; j * g <= n - i * r; j++) {
if ((n - i * r - j * g) % b == 0)
ans++;
}
}
cout << ans;
return 0;
} | [
"variable_declaration.value.change"
] | 865,046 | 865,047 | u933723514 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int cnt = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
int tmp = n - r * i - g * j;
if (tmp % b == 0) {
cnt++;
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int cnt = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
int tmp = n - r * i - g * j;
if (tmp % b == 0 && 0 <= tmp) {
cnt++;
}
}
}
cout << cnt << en... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,050 | 865,051 | u628262476 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N, ct, r, g, b;
cin >> R >> G >> B >> N;
ct = 0;
for (r = 0; r * R <= N; r++) {
for (g = 0; g * G <= N - r * R; g++) {
ct = ((N - r * R + g * G) % b == 0) ? ct + 1 : ct;
}
}
cout << ct << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N, ct, r, g, b;
cin >> R >> G >> B >> N;
ct = 0;
for (r = 0; r * R <= N; r++) {
for (g = 0; g * G <= N - r * R; g++) {
ct = ((N - r * R - g * G) % B == 0) ? ct + 1 : ct;
}
}
cout << ct << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change"
] | 865,054 | 865,055 | u954976049 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a, t, x;
cin >> r >> g >> b >> n;
int ans = 0;
for (a = 0; a <= n / r; a++) {
for (t = 0; t <= n - a * r; t++) {
if ((n - r * a - g * t) % b == 0 && n - r * a - g * t <= 0) {
ans++;
}
}
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a, t, x;
cin >> r >> g >> b >> n;
int ans = 0;
for (a = 0; a <= n / r; a++) {
for (t = 0; t <= n - a * r; t++) {
if ((n - r * a - g * t) % b == 0 && n - r * a - g * t >= 0) {
ans++;
}
}
}
cout << ans <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 865,058 | 865,059 | u876404872 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a, t, x;
cin >> r >> g >> b >> n;
int ans = 0;
for (int a = 0; a <= n / r; a++) {
for (int t = 0; t < n - a; t++) {
if ((n - r * a - g * t) % b == 0 && n - r * a - g * t <= 0) {
ans++;
}
}
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n, a, t, x;
cin >> r >> g >> b >> n;
int ans = 0;
for (a = 0; a <= n / r; a++) {
for (t = 0; t <= n - a * r; t++) {
if ((n - r * a - g * t) % b == 0 && n - r * a - g * t >= 0) {
ans++;
}
}
}
cout << ans <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 865,060 | 865,059 | u876404872 | cpp |
p03048 | #include <iostream>
using namespace std;
int main(void) {
int R, G, B, N, tmp, count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; R * i <= N; i++) {
for (int j = 0; R * i + G * j <= N; j++) {
tmp = N - (R * i + G * j);
if (N % tmp == 0)
count++;
}
}
cout << count << "\n";
} | #include <iostream>
using namespace std;
int main(void) {
int R, G, B, N, tmp, count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; R * i <= N; i++) {
for (int j = 0; R * i + G * j <= N; j++) {
tmp = N - (R * i + G * j);
if (tmp % B == 0)
count++;
}
}
cout << count << "\n";
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 865,077 | 865,078 | u572193732 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N; i += R) {
for (int j = 0; i + j <= N; j += G) {
int a = N - (i * R + j * G);
if (a % B == 0) {
if (a >= 0) {
ans++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N; i += R) {
for (int j = 0; i + j <= N; j += G) {
int a = N - (i + j);
if (a % B == 0) {
if (a >= 0) {
ans++;
}
}
}
}
... | [
"expression.operation.binary.remove"
] | 865,084 | 865,085 | u341309363 | cpp |
p03048 | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iot... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iot... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 865,109 | 865,110 | u128456980 | cpp |
p03048 | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iot... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iot... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 865,111 | 865,110 | u128456980 | cpp |
p03048 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0, R, G, B, N;
vector<int> RGB(3);
cin >> RGB[0] >> RGB[1] >> RGB[2] >> N;
std::sort(RGB.begin(), RGB.end());
int Min0 = N / RGB[0];
int Min1 = N / RGB[1];
int Min2 = N / RGB[2];
// ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0, R, G, B, N;
vector<int> RGB(3);
cin >> RGB[0] >> RGB[1] >> RGB[2] >> N;
std::sort(RGB.begin(), RGB.end());
int Min0 = N / RGB[0];
int Min1 = N / RGB[1];
int Min2 = N / RGB[2];
// ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 865,118 | 865,119 | u982721500 | cpp |
p03048 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
scanf("%d", &a[i]);
sort(a, a + 3);
int n;
scanf("%d", &n);
int num = 0;
for (int i = 0; i <= n / a[2]; i++) {
for (int j = 0; j <= (n - i * a[2]) / a[1]; j++) {
int k = n - i * a[2] - j * a[1];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
scanf("%d", &a[i]);
sort(a, a + 3);
int n;
scanf("%d", &n);
int num = 0;
for (int i = 0; i <= n / a[2]; i++) {
for (int j = 0; j <= (n - i * a[2]) / a[1]; j++) {
int k = n - i * a[2] - j * a[1];
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 865,123 | 865,124 | u786712982 | cpp |
p03048 | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int R, G, B, N;
// スペース区切りの整数の入力
cin >> R >> G >> B >> N;
if (G < B)
swap(G, B);
if (R < G)
swap(R, G);
int num = 0;
for (int r = 0; r * R <= N; r++) {
if (r * R == N) {
num++;
break;
}
for (int g = 0; r * ... | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int R, G, B, N;
// スペース区切りの整数の入力
cin >> R >> G >> B >> N;
if (G < B)
swap(G, B);
if (R < G)
swap(R, G);
int num = 0;
for (int r = 0; r * R <= N; r++) {
if (r * R == N) {
num++;
break;
}
for (int g = 0; r * ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 865,129 | 865,130 | u954968536 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.