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 |
|---|---|---|---|---|---|---|---|
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 <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl << endl;
#define show2d(v) \
rep(i, v.size()) { \
rep(j, v[i].size()) cout << " " << v[i][j]; \
cout << endl; \
} \
cout << endl;
using namespace std;
typedef long long ll;
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
cout << n - k - 1 << endl;
return 0;
}
| // 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 <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl << endl;
#define show2d(v) \
rep(i, v.size()) { \
rep(j, v[i].size()) cout << " " << v[i][j]; \
cout << endl; \
} \
cout << endl;
using namespace std;
typedef long long ll;
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| [
"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;
return 0;
} | #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;
return 0;
} | [
"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>
#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
#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 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};
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)]; //親をとってきたい]
}
// 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;
}
int main() {
// 前処理
COMinit();
ll N, K;
cin >> N >> K;
cout << COM(N, K) << 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
#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 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};
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)]; //親をとってきたい]
}
// 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;
}
int main() {
// 前処理
COMinit();
ll N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
return 0;
}
| [
"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; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 1000000000000000001;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
int main() {
int k, n;
cin >> k >> n;
cout << n - k + 1 << endl;
return 0;
}
| #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; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 1000000000000000001;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
int main() {
int k, n;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| [
"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 <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int N, K;
int main() {
scanf("%d", &N, &K);
printf("%d\n", N - K + 1);
return 0;
}
| #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 <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int N, K;
int main() {
scanf("%d%d", &N, &K);
printf("%d\n", N - K + 1);
return 0;
}
| [
"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); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(2e9);
const int mod = inf + 7;
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
max(0, n - k + 1);
}
int main() {
Red;
solve();
return 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); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(2e9);
const int mod = inf + 7;
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
cout << max(0, n - k + 1);
}
int main() {
Red;
solve();
return 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;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
uni gojoho(uni A, uni B) {
uni R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
unli gojoho(unli A, unli B) {
unli R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
int gojoho(int A, int B) {
int R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
int main() {
int K, N, ans;
scanf("%d%d", &N, &K);
ans = K - N + 1;
printf("%d", ans);
return (0);
} | #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;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
uni gojoho(uni A, uni B) {
uni R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
unli gojoho(unli A, unli B) {
unli R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
int gojoho(int A, int B) {
int R = 1;
if (A > B) {
while (R != 0) {
R = A % B;
A = B;
B = R;
}
return A;
} else {
while (R != 0) {
R = B % A;
B = A;
A = R;
}
return B;
}
}
int main() {
int K, N, ans;
scanf("%d%d", &N, &K);
ans = N - K + 1;
printf("%d", ans);
return (0);
}
| [
"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 < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000000007ll;
int main() {
int k, n;
cin >> k >> n;
cout << (n - k + 1) << endl;
return 0;
}
| #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 < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
const ll MOD = 1000000007ll;
int main() {
int k, n;
cin >> n >> k;
cout << (n - k + 1) << endl;
return 0;
}
| [
"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(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, n;
cin >> k >> n;
cout << n - k + 1 << endl;
return 0;
} | #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(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, n;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | [
"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 / G; ++j) {
if (i * R + j * G > N)
continue;
intt d = N - i * R - j * G;
if (d % B != 0)
continue;
++ans;
}
}
std::cout << ans << std::endl;
return 0;
} | #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 < N / G + 1; ++j) {
if (i * R + j * G > N)
continue;
intt d = N - i * R - j * G;
if (d % B != 0)
continue;
++ans;
}
}
std::cout << ans << std::endl;
return 0;
} | [
"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 % b;
a = b;
b = c;
}
return a;
} //最大公約数
int lcm(int a, int b) {
int c = gcd(a, b);
a /= c;
return a * b;
} //最小公倍数
int nCr(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
} //コンビネーション
int nHr(int a, int b) { return nCr(a + b - 1, b); } // 重複組み合わせ
int fact(int a) {
int i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
} //階乗
int pow(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
} // a~bまでの階乗
int dsum(int x) {
int r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
} //数字の各位の和
int dsumb(int x, int b) {
int r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
} // b進数の各位の和？
int sankaku(int x) { return ((1 + x) * x) / 2; } //三角数 xまでの和
//以下long long ver
long long llmax(long long a, long long b) {
if (a > b) {
return a;
}
return b;
}
long long llmin(long long a, long long b) {
if (a < b) {
return a;
}
return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
long long llceil(long long a, long long b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
long long c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
long long lllcm(long long a, long long b) {
long long c = llgcd(a, b);
a /= c;
return a * b;
}
long long llnCr(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
long long i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
long long llpow(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
long long lldsum(long long x) {
long long r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
long long lldsumb(long long x, long long b) {
long long r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
// double
double dbmax(double a, double b) {
if (a > b) {
return a;
}
return b;
}
double dbmin(double a, double b) {
if (a < b) {
return a;
}
return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define forr(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define clean(arr, val) memset(arr, val, sizeof(arr))
#define forn(i, n) forr(i, 0, n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
bool chmin(int a, int b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(int a, int b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define SORT(c) sort((c).begin(), (c).end());
#define ANS(ans) cout << (ans) << endl;
string split(string s, ll n, char x) {
// n文字目は前の文字列
string a, b, c, d;
a = s;
b = s;
if (x == 'f') {
return c = a.erase(n);
} else if (x == 'l') {
return d = b.substr(n);
}
}
/*CODE START HERE*/
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll count = 0;
for (int i = 0; i < n; i++) {
if (r * i > n) {
continue;
}
forn(j, n) {
if ((n - i * r - j * g) < 0) {
continue;
}
if ((n - i * r - j * g) % b == 0) {
count++;
}
}
}
ANS(count);
} | #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 % b;
a = b;
b = c;
}
return a;
} //最大公約数
int lcm(int a, int b) {
int c = gcd(a, b);
a /= c;
return a * b;
} //最小公倍数
int nCr(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
} //コンビネーション
int nHr(int a, int b) { return nCr(a + b - 1, b); } // 重複組み合わせ
int fact(int a) {
int i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
} //階乗
int pow(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
} // a~bまでの階乗
int dsum(int x) {
int r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
} //数字の各位の和
int dsumb(int x, int b) {
int r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
} // b進数の各位の和？
int sankaku(int x) { return ((1 + x) * x) / 2; } //三角数 xまでの和
//以下long long ver
long long llmax(long long a, long long b) {
if (a > b) {
return a;
}
return b;
}
long long llmin(long long a, long long b) {
if (a < b) {
return a;
}
return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
long long llceil(long long a, long long b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
long long c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
long long lllcm(long long a, long long b) {
long long c = llgcd(a, b);
a /= c;
return a * b;
}
long long llnCr(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
long long i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
long long llpow(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
long long lldsum(long long x) {
long long r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
long long lldsumb(long long x, long long b) {
long long r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
// double
double dbmax(double a, double b) {
if (a > b) {
return a;
}
return b;
}
double dbmin(double a, double b) {
if (a < b) {
return a;
}
return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define forr(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define clean(arr, val) memset(arr, val, sizeof(arr))
#define forn(i, n) forr(i, 0, n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
bool chmin(int a, int b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(int a, int b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define SORT(c) sort((c).begin(), (c).end());
#define ANS(ans) cout << (ans) << endl;
string split(string s, ll n, char x) {
// n文字目は前の文字列
string a, b, c, d;
a = s;
b = s;
if (x == 'f') {
return c = a.erase(n);
} else if (x == 'l') {
return d = b.substr(n);
}
}
/*CODE START HERE*/
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll count = 0;
for (int i = 0; i < n + 1; i++) {
if (r * i > n) {
continue;
}
forn(j, n + 1) {
if ((n - i * r - j * g) < 0) {
continue;
}
if ((n - i * r - j * g) % b == 0) {
count++;
}
}
}
ANS(count);
} | [
"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 = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
//よくあるmodくん
const ll MOD = 1000000007; // = 10^9 + 7
//データ構造
//隣接リスト用構造体（有向グラフ向け）
struct edge {
ll to; // E.toでその辺の終点へアクセスできる
ll cost; // e.costでその辺の重みにアクセスできる
};
// Union_Find木
struct UnionFind {
vector<int> UF; // UF.at(i) : iの親の番号
vector<int> SIZE; // SIZE.at(root(i)) : iと連結されてる要素の数
UnionFind(int N) : UF(N), SIZE(N, 1) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(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の根が同じ(=同じ木にある)時はそのまま
}
// xとyの根が同じでない(=同じ木にない)時：小さい方の根を大きい方の根につける
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
} else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { // xと連結されてる要素の数を返す
return SIZE.at(root(x));
}
};
//関数 (計算量)
// ctoi (O(1))
int ctoi(char c) {
if (c == '0')
return 0;
if (c == '1')
return 1;
if (c == '2')
return 2;
if (c == '3')
return 3;
if (c == '4')
return 4;
if (c == '5')
return 5;
if (c == '6')
return 6;
if (c == '7')
return 7;
if (c == '8')
return 8;
if (c == '9')
return 9;
return -1;
}
// to_char (O(1))
char to_char(int i) {
if (i == 0)
return '0';
if (i == 1)
return '1';
if (i == 2)
return '2';
if (i == 3)
return '3';
if (i == 4)
return '4';
if (i == 5)
return '5';
if (i == 6)
return '6';
if (i == 7)
return '7';
if (i == 8)
return '8';
if (i == 9)
return '9';
return ' ';
}
//二分探索(その要素があるかないか判定するだけならsetとか二分木使う) (0(logN))
ll BS(vector<ll> V, ll Q) {
sort(V.begin(), V.end());
int L = -1; // Q未満の最大の要素
int R = V.size(); // Q以上の最小の要素
while (R - L > 1) {
int M = (L + R) / 2;
if (V.at(M) < Q)
L = M;
else
R = M;
}
if (R == int(V.size()))
return INF; // Qより大きい要素がない時はINFを返す
return V.at(R); // Lを返すとQ未満の最大の要素が出てくる。
}
//素数判定
//一つ一つの判定ではこっちの方が速い(一つ当たりO(√N))
//一方100までに何個あるかなどはEratosthenesの篩の方が良い（O(NlogN))
bool PN(int x) {
if (x <= 1)
return false; // 1や0,-1は素数ではない
if (x == 2)
return true; // √2 + 1 > 2 なので下でやると 2 ％ 2 = 0 となり判定できない
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0)
return false; // 割れたら素数じゃない
}
return true;
}
// A^N mod M を計算する。modしたくなかったらM = LINFとかにすればよい (O(√N))
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1)
ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
//メイン処理
int main() {
cout << fixed << setprecision(16); //精度向上
//ここまでテンプレ
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i < 3000; i++) {
for (int j = 0; j < 3000; j++) {
if ((N - i * R - j * G) >= 0 && (N - i * R - j * G) % B == 0) {
ans++;
}
}
}
cout << ans << endl;
} | #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 = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
//よくあるmodくん
const ll MOD = 1000000007; // = 10^9 + 7
//データ構造
//隣接リスト用構造体（有向グラフ向け）
struct edge {
ll to; // E.toでその辺の終点へアクセスできる
ll cost; // e.costでその辺の重みにアクセスできる
};
// Union_Find木
struct UnionFind {
vector<int> UF; // UF.at(i) : iの親の番号
vector<int> SIZE; // SIZE.at(root(i)) : iと連結されてる要素の数
UnionFind(int N) : UF(N), SIZE(N, 1) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(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の根が同じ(=同じ木にある)時はそのまま
}
// xとyの根が同じでない(=同じ木にない)時：小さい方の根を大きい方の根につける
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
} else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { // xと連結されてる要素の数を返す
return SIZE.at(root(x));
}
};
//関数 (計算量)
// ctoi (O(1))
int ctoi(char c) {
if (c == '0')
return 0;
if (c == '1')
return 1;
if (c == '2')
return 2;
if (c == '3')
return 3;
if (c == '4')
return 4;
if (c == '5')
return 5;
if (c == '6')
return 6;
if (c == '7')
return 7;
if (c == '8')
return 8;
if (c == '9')
return 9;
return -1;
}
// to_char (O(1))
char to_char(int i) {
if (i == 0)
return '0';
if (i == 1)
return '1';
if (i == 2)
return '2';
if (i == 3)
return '3';
if (i == 4)
return '4';
if (i == 5)
return '5';
if (i == 6)
return '6';
if (i == 7)
return '7';
if (i == 8)
return '8';
if (i == 9)
return '9';
return ' ';
}
//二分探索(その要素があるかないか判定するだけならsetとか二分木使う) (0(logN))
ll BS(vector<ll> V, ll Q) {
sort(V.begin(), V.end());
int L = -1; // Q未満の最大の要素
int R = V.size(); // Q以上の最小の要素
while (R - L > 1) {
int M = (L + R) / 2;
if (V.at(M) < Q)
L = M;
else
R = M;
}
if (R == int(V.size()))
return INF; // Qより大きい要素がない時はINFを返す
return V.at(R); // Lを返すとQ未満の最大の要素が出てくる。
}
//素数判定
//一つ一つの判定ではこっちの方が速い(一つ当たりO(√N))
//一方100までに何個あるかなどはEratosthenesの篩の方が良い（O(NlogN))
bool PN(int x) {
if (x <= 1)
return false; // 1や0,-1は素数ではない
if (x == 2)
return true; // √2 + 1 > 2 なので下でやると 2 ％ 2 = 0 となり判定できない
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0)
return false; // 割れたら素数じゃない
}
return true;
}
// A^N mod M を計算する。modしたくなかったらM = LINFとかにすればよい (O(√N))
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1)
ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
//メイン処理
int main() {
cout << fixed << setprecision(16); //精度向上
//ここまでテンプレ
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
if ((N - i * R - j * G) >= 0 && (N - i * R - j * G) % B == 0) {
ans++;
}
}
}
cout << ans << endl;
}
| [
"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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r, g, b, target;
cin >> r >> g >> b >> target;
long long ans = 0;
for (int i = 0; i < 3000; i++) {
for (int j = 0; j < 3000; j++) {
int curr = (r * i) + (g * j);
if (curr > target)
break;
if ((target - curr) % b == 0)
ans++;
}
}
cout << ans;
} | #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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r, g, b, target;
cin >> r >> g >> b >> target;
int ans = 0;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
int curr = (r * i) + (g * j);
if (curr > target)
break;
if ((target - curr) % b == 0)
ans++;
}
}
cout << ans;
} | [
"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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r, g, b, target;
cin >> r >> g >> b >> target;
int ans = 0;
for (int i = 0; i < 3000; i++) {
for (int j = 0; j < 3000; j++) {
int curr = (r * i) + (g * j);
if (curr > target)
break;
if ((target - curr) % b == 0)
ans++;
}
}
cout << ans;
} | #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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r, g, b, target;
cin >> r >> g >> b >> target;
int ans = 0;
for (int i = 0; i <= 3000; i++) {
for (int j = 0; j <= 3000; j++) {
int curr = (r * i) + (g * j);
if (curr > target)
break;
if ((target - curr) % b == 0)
ans++;
}
}
cout << ans;
} | [
"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)
#define ALL(c) begin(c), end(c)
int _ = (
#ifndef LOCAL
std::cin.tie(nullptr), std::ios::sync_with_stdio(false),
#endif
std::cout.precision(10), std::cout.setf(std::ios::fixed));
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T> using vec = std::vector<T>;
using namespace std;
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll res = 0;
FOR(r, 0, 3000) {
FOR(g, 0, 3000) {
const ll b = (N - (R * r + G * g)) / B;
if (b >= 0 && R * r + G * g + B * b == N) {
res++;
}
}
}
cout << res << endl;
return 0;
}
| // #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)
#define ALL(c) begin(c), end(c)
int _ = (
#ifndef LOCAL
std::cin.tie(nullptr), std::ios::sync_with_stdio(false),
#endif
std::cout.precision(10), std::cout.setf(std::ios::fixed));
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T> using vec = std::vector<T>;
using namespace std;
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll res = 0;
FOR(r, 0, 3001) {
FOR(g, 0, 3001) {
const ll b = (N - (R * r + G * g)) / B;
if (b >= 0 && R * r + G * g + B * b == N) {
res++;
}
}
}
cout << res << endl;
return 0;
}
| [
"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;
} else if (k == 0) {
return 1;
} else if (k == 1) {
return n;
} else
return C(n - 1, k - 1) + C(n - 1, k);
}
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
lint ans = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R + g * G) % B == 0 && N - r * R + g * G >= 0) {
ans++;
}
}
}
cout << ans << endl;
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;
} else if (k == 0) {
return 1;
} else if (k == 1) {
return n;
} else
return C(n - 1, k - 1) + C(n - 1, k);
}
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
lint ans = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
if ((N - r * R - g * G) % B == 0 && N - r * R + g * G >= 0) {
ans++;
}
}
}
cout << ans << endl;
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 = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
#define TEN5 100000 // 10^5
#define TEN9 1000000000 // 10^9
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, 3000) {
rep(j, 3000) {
int v = i * r + j * g;
if (v <= n && (n - v) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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 = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
#define TEN5 100000 // 10^5
#define TEN9 1000000000 // 10^9
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, 3001) {
rep(j, 3001) {
int v = i * r + j * g;
if (v <= n && (n - v) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"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++;
}
}
}
cout << ans << endl;
} | #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++;
}
}
}
cout << ans << endl;
} | [
"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 each(i, ...) for (auto &&i : __VA_ARGS__)
#define ALL(vec) (vec).begin(), (vec).end()
#define sum(...) accumulate(ALL(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(ALL(__VA_ARGS__), 0.0)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
template <class T> inline auto max(const T &a) { return *max_element(ALL(a)); }
template <class T> inline auto min(const T &a) { return *min_element(ALL(a)); }
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
//----***定数***----
#define MOD 1000000007
#define INF 100000000000000000
#define EPS 1e-9
const vector<vector<int>> DXY = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
//----***パーツ***----
#define fi first
#define se second
#define pb push_back
#define re return
#define br break
//----***入出力***---
void print() { std::cout << "\n"; }
template <class T> void print(const T &x) { std::cout << x << "\n"; }
template <class T, class... Args> void print(const T &x, const Args &...args) {
std::cout << x << " ";
print(args...);
}
#define debug(var) \
do { \
std::cerr << #var << " ↓ " \
<< "\n"; \
view(var); \
} while (0);
#define dbg cerr << "🥺🥺🥺🥺🥺🥺" << endl;
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
//----***初期時読み込み***----
struct initial {
initial() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} initial_;
signed main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r * R < N + 2; r++) {
for (int g = 0; r * R + g * G < N + 2; g++) {
// for(int b=0;r*R+g*G+b*B<N+2;b++){
// print(r,g,b,"=",r*R+g*G+b*B);
if ((N - r * R - g * G) % B == 0) {
ans++;
//}
}
}
}
print(ans);
}
| #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 each(i, ...) for (auto &&i : __VA_ARGS__)
#define ALL(vec) (vec).begin(), (vec).end()
#define sum(...) accumulate(ALL(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(ALL(__VA_ARGS__), 0.0)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
template <class T> inline auto max(const T &a) { return *max_element(ALL(a)); }
template <class T> inline auto min(const T &a) { return *min_element(ALL(a)); }
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
//----***定数***----
#define MOD 1000000007
#define INF 100000000000000000
#define EPS 1e-9
const vector<vector<int>> DXY = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
//----***パーツ***----
#define fi first
#define se second
#define pb push_back
#define re return
#define br break
//----***入出力***---
void print() { std::cout << "\n"; }
template <class T> void print(const T &x) { std::cout << x << "\n"; }
template <class T, class... Args> void print(const T &x, const Args &...args) {
std::cout << x << " ";
print(args...);
}
#define debug(var) \
do { \
std::cerr << #var << " ↓ " \
<< "\n"; \
view(var); \
} while (0);
#define dbg cerr << "🥺🥺🥺🥺🥺🥺" << endl;
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
//----***初期時読み込み***----
struct initial {
initial() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} initial_;
signed main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; r * R + g * G <= N; g++) {
// for(int b=0;r*R+g*G+b*B<N+2;b++){
// print(r,g,"=",r*R+g*G);
if ((N - r * R - g * G) % B == 0) {
ans++;
//}
}
}
}
print(ans);
}
| [
"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 ((n - i * num[0] - j * num[1]) > 0 &&
(n - i * num[0] - j * num[1]) % num[2] == 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #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 ((n - i * num[0] - j * num[1]) >= 0 &&
(n - i * num[0] - j * num[1]) % num[2] == 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | [
"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() {
int r, g, b, n, ans = 0;
cin >> r >> g >> b >> n;
rep(i, n + 1) {
rep(j, n + 1) {
int m = n - i * r - j * g;
if (m % b == 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #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() {
int r, g, b, n, ans = 0;
cin >> r >> g >> b >> n;
rep(i, n + 1) {
rep(j, n + 1) {
int m = n - i * r - j * g;
if (0 <= m && m % b == 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | [
"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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, 3000) REP(g, 3000) {
int x = N - (r * R) - (g * G);
if (x >= 0 && x % B == 0)
ans++;
}
print(ans);
} | #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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, 3001) REP(g, 3001) {
int x = N - (r * R) - (g * G);
if (x >= 0 && x % B == 0)
ans++;
}
print(ans);
} | [
"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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, N) REP(g, N) {
int x = N - (r * R) - (g * G);
if (x >= 0 && (N - x) % B == 0)
ans++;
}
print(ans);
} | #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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, 3001) REP(g, 3001) {
int x = N - (r * R) - (g * G);
if (x >= 0 && x % B == 0)
ans++;
}
print(ans);
} | [
"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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, N) REP(g, N) {
int x = N - (r * R) - (g * G);
if (x >= 0 && x % B == 0)
ans++;
}
print(ans);
} | #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
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
REP(r, 3001) REP(g, 3001) {
int x = N - (r * R) - (g * G);
if (x >= 0 && x % B == 0)
ans++;
}
print(ans);
} | [
"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 = 1000010;
const ll mod = 1e9 + 7;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
for (int i = 0; i < n / r; i++)
for (int j = 0; j < n / g; j++) {
if ((n - i * r - j * g) % b == 0 && (n - i * r - j * g) >= 0)
ans++;
}
cout << ans << endl;
return 0;
} | #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 = 1000010;
const ll mod = 1e9 + 7;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
for (int i = 0; i <= n / r; i++)
for (int j = 0; j <= n / g; j++) {
if ((n - i * r - j * g) % b == 0 && (n - i * r - j * g) >= 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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 REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NEXP(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define popb(n) pop_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { \
if ((V).size() - 1 != i) { \
cout << (V)[i] << " "; \
} else { \
cout << (V)[i] << endl; \
} \
}
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
using ll = long long;
using Graph = vector<vector<int>>;
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1LL) {
for (int i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (int i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
// 文字を全て大文字にします
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
// 文字をstring型で一文字取得します
string get1ch(string str, int key) { return str.substr(key, 1); }
// 素因数分解 (O(sqrt(n)))
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// 素数判定 (O(sqrt(n)))
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
// 進数変換 (O(log n))
template <typename T> vector<T> convert_base(T x, T b) {
vector<T> ret;
T t = 1, k = abs(b);
while (x) {
ret.emplace_back((x * t) % k);
if (ret.back() < 0)
ret.back() += k;
x -= ret.back() * t;
x /= k;
t *= b / k;
}
if (ret.empty())
ret.emplace_back(0);
reverse(begin(ret), end(ret));
return ret;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int modPow(int a, int n) {
if (n == 1)
return a % MOD;
if (n % 2 == 1)
return (a * modPow(a, n - 1)) % MOD;
int t = modPow(a, n / 2);
return (t * t) % MOD;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// デフォルト変数定義
int n = 0, m = 0, a = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
int r, g, b;
IN4(r, g, b, n);
int ans = 0;
REP(i, 3000) {
REP(j, 3000) {
x = i * r + j * g;
if (n >= x && (n - x) % b == 0)
++ans;
}
}
OUT(ans);
} | #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 REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NEXP(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define popb(n) pop_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { \
if ((V).size() - 1 != i) { \
cout << (V)[i] << " "; \
} else { \
cout << (V)[i] << endl; \
} \
}
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
using ll = long long;
using Graph = vector<vector<int>>;
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1LL) {
for (int i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (int i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
// 文字を全て大文字にします
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
// 文字をstring型で一文字取得します
string get1ch(string str, int key) { return str.substr(key, 1); }
// 素因数分解 (O(sqrt(n)))
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// 素数判定 (O(sqrt(n)))
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
// 進数変換 (O(log n))
template <typename T> vector<T> convert_base(T x, T b) {
vector<T> ret;
T t = 1, k = abs(b);
while (x) {
ret.emplace_back((x * t) % k);
if (ret.back() < 0)
ret.back() += k;
x -= ret.back() * t;
x /= k;
t *= b / k;
}
if (ret.empty())
ret.emplace_back(0);
reverse(begin(ret), end(ret));
return ret;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int modPow(int a, int n) {
if (n == 1)
return a % MOD;
if (n % 2 == 1)
return (a * modPow(a, n - 1)) % MOD;
int t = modPow(a, n / 2);
return (t * t) % MOD;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// デフォルト変数定義
int n = 0, m = 0, a = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
int r, g, b;
IN4(r, g, b, n);
int ans = 0;
REP(i, 3001) {
REP(j, 3001) {
x = i * r + j * g;
if (n >= x && (n - x) % b == 0)
++ans;
}
}
OUT(ans);
} | [
"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) {
for (int i = 31; i >= 0; i--) {
cout << (a >> i & 1);
}
cout << endl;
}
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t;
} else {
return modpow(m, n - 1) * m;
}
}
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
REP(i, 3000) {
REP(j, 3000) {
if (i * r + j * g <= n) {
// cout << i << " " << j << endl;
if ((n - i * r - j * g) % b == 0) {
// cout << i << " " << j << n - i * r + j * g << endl;
ans++;
}
}
}
}
cout << ans << endl;
} | #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) {
for (int i = 31; i >= 0; i--) {
cout << (a >> i & 1);
}
cout << endl;
}
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t;
} else {
return modpow(m, n - 1) * m;
}
}
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
REP(i, 3001) {
REP(j, 3001) {
if (i * r + j * g <= n) {
// cout << i << " " << j << endl;
if ((n - i * r - j * g) % b == 0) {
// cout << i << " " << j << n - i * r + j * g << endl;
ans++;
}
}
}
}
cout << ans << endl;
} | [
"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 long mod = 2e9 + 7;
const long double PI = acos(0);
// }}} End Header
int main() {
ll R, G, B, n, ans = 0;
cin >> R >> G >> B >> n;
for (ll r = 0; r < 3000; r++) {
for (ll g = 0; g < 3000; g++) {
if ((n - R * r - G * g) % B == 0 && (n - R * r - G * g) / B >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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 long mod = 2e9 + 7;
const long double PI = acos(0);
// }}} End Header
int main() {
ll R, G, B, n, ans = 0;
cin >> R >> G >> B >> n;
for (ll r = 0; r <= n; r++) {
for (ll g = 0; g <= n; g++) {
if ((n - R * r - G * g) % B == 0 && (n - R * r - G * g) / B >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"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 << endl;
return 0;
} | #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 << endl;
return 0;
} | [
"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 << endl;
return 0;
} | #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 << endl;
return 0;
} | [
"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>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repm(i, s, n) for (int i = s; i < n; i++)
#define setprc(d) setprecision(d)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9 + 7;
// ----------------------------------------------------------------
// String Functions
// ----------------------------------------------------------------
int ctoi(char c) {
if (isdigit(c))
return c - '0';
else if (islower(c))
return c - 'a';
else if (isupper(c))
return c - 'A';
else
return -1;
}
char itocd(int i) {
char c = i + '0';
if (isdigit(c))
return c;
else
return 0x00;
}
char itocl(int i) {
char c = i + 'a';
if (islower(c))
return c;
else
return 0x00;
}
char itocu(int i) {
char c = i + 'A';
if (isupper(c))
return c;
else
return 0x00;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Dynamical Programming
// ----------------------------------------------------------------
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;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Graph Theory
// ----------------------------------------------------------------
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra() {}
void BellmanFord() {}
void WarshallFloyd() {}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Mathematical Functions
// ----------------------------------------------------------------
ll gcd(ll A, ll B) {
if (A % B == 0) {
return (B);
} else {
return (gcd(B, A % B));
}
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
ll divtimes(ll N, ll D) {
ll res = 0;
while (N % D == 0) {
N /= D;
res++;
}
return res;
}
ll powMod(ll B, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = powMod(B, P / 2);
return t * t % MOD;
}
return B * powMod(B, P - 1) % MOD;
}
/* ----------------------------------
Factorial, Permutation, Combination
---------------------------------- */
const int FAC_INIT_SIZE = 1e6 + 9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; 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;
}
}
ll factMod(ll N) { return fac[N] % MOD; }
ll factInvMod(ll N) { return finv[N] % MOD; }
ll permMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else
return factMod(N) * factInvMod(N - K) % MOD;
}
ll combMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else if (N < FAC_INIT_SIZE) {
return factMod(N) * (factInvMod(K) * factInvMod(N - K) % MOD) % MOD;
} else {
ll ans = 1;
ll Ks = K < N - K ? K : N - K;
for (ll i = N; i > N - Ks; i--) {
ans *= i;
ans %= MOD;
}
return ans * factInvMod(Ks) % MOD;
}
}
/* ----------------------------------
Sieve of Eratosthenes
---------------------------------- */
vector<bool> isprime;
void sieveInit(int size) {
int sb = size + 9;
isprime.resize(sb);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for (int i = 2; i < sb; i++) {
if (i % 2 == 0)
isprime[i] = false;
else
isprime[i] = true;
}
for (int i = 3; i * i <= sb; i += 2) {
if (isprime[i]) {
int m = 3 * i;
while (m < sb) {
isprime[m] = false;
m += 2 * i;
}
} else {
continue;
}
}
}
// ----------------------------------------------------------------
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int C[3], N;
cin >> C[0] >> C[1] >> C[2] >> N;
sort(C, C + 3);
int res = 0;
rep(i, N) {
rep(j, N) {
ll d = N - i * C[2] - j * C[1];
if (d >= 0 && d % C[0] == 0)
res++;
}
}
cout << res << endl;
}
| #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>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repm(i, s, n) for (int i = s; i < n; i++)
#define setprc(d) setprecision(d)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9 + 7;
// ----------------------------------------------------------------
// String Functions
// ----------------------------------------------------------------
int ctoi(char c) {
if (isdigit(c))
return c - '0';
else if (islower(c))
return c - 'a';
else if (isupper(c))
return c - 'A';
else
return -1;
}
char itocd(int i) {
char c = i + '0';
if (isdigit(c))
return c;
else
return 0x00;
}
char itocl(int i) {
char c = i + 'a';
if (islower(c))
return c;
else
return 0x00;
}
char itocu(int i) {
char c = i + 'A';
if (isupper(c))
return c;
else
return 0x00;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Dynamical Programming
// ----------------------------------------------------------------
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;
}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Graph Theory
// ----------------------------------------------------------------
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra() {}
void BellmanFord() {}
void WarshallFloyd() {}
// ----------------------------------------------------------------
// ----------------------------------------------------------------
// Mathematical Functions
// ----------------------------------------------------------------
ll gcd(ll A, ll B) {
if (A % B == 0) {
return (B);
} else {
return (gcd(B, A % B));
}
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
ll divtimes(ll N, ll D) {
ll res = 0;
while (N % D == 0) {
N /= D;
res++;
}
return res;
}
ll powMod(ll B, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = powMod(B, P / 2);
return t * t % MOD;
}
return B * powMod(B, P - 1) % MOD;
}
/* ----------------------------------
Factorial, Permutation, Combination
---------------------------------- */
const int FAC_INIT_SIZE = 1e6 + 9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_INIT_SIZE; 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;
}
}
ll factMod(ll N) { return fac[N] % MOD; }
ll factInvMod(ll N) { return finv[N] % MOD; }
ll permMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else
return factMod(N) * factInvMod(N - K) % MOD;
}
ll combMod(ll N, ll K) {
if (N < 0 || K < 0 || N < K)
return 0;
else if (N < FAC_INIT_SIZE) {
return factMod(N) * (factInvMod(K) * factInvMod(N - K) % MOD) % MOD;
} else {
ll ans = 1;
ll Ks = K < N - K ? K : N - K;
for (ll i = N; i > N - Ks; i--) {
ans *= i;
ans %= MOD;
}
return ans * factInvMod(Ks) % MOD;
}
}
/* ----------------------------------
Sieve of Eratosthenes
---------------------------------- */
vector<bool> isprime;
void sieveInit(int size) {
int sb = size + 9;
isprime.resize(sb);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for (int i = 2; i < sb; i++) {
if (i % 2 == 0)
isprime[i] = false;
else
isprime[i] = true;
}
for (int i = 3; i * i <= sb; i += 2) {
if (isprime[i]) {
int m = 3 * i;
while (m < sb) {
isprime[m] = false;
m += 2 * i;
}
} else {
continue;
}
}
}
// ----------------------------------------------------------------
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int C[3], N;
cin >> C[0] >> C[1] >> C[2] >> N;
sort(C, C + 3);
int res = 0;
rep(i, N + 1) {
rep(j, N + 1) {
ll d = N - i * C[2] - j * C[1];
if (d >= 0 && d % C[0] == 0)
res++;
}
}
cout << res << endl;
}
| [
"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 + 1) {
int sum = i * r + j * g;
if (sum > n && ((n - sum) % b) == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | #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 + 1) {
int sum = i * r + j * g;
if (sum <= n && (n - sum) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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 ((n - r * x - g * y) % b == 0 && (n - r * x - g * y) % b >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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 ((n - r * x - g * y) % b == 0 && n - r * x - g * y >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"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) {
int res = n - i * r + j * g;
if (res % b == 0)
ans++;
}
}
cout << ans << endl;
} | #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) {
int res = n - i * r - j * g;
if (res >= 0 && res % b == 0)
ans++;
}
}
cout << ans << endl;
} | [
"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++;
}
}
cout << 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++;
}
}
cout << 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)
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;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, n + 1) {
rep(j, n + 1) {
if (i * r + j * g > n)
continue;
int B = n - i * r - j * g;
if (B / b != 0)
continue;
if (i * r + j * g + B / b == n)
ans++;
}
}
print(ans);
}
| #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)
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;
}
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9 + 7;
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
rep(i, n + 1) {
rep(j, n + 1) {
if (i * r + j * g > n)
continue;
int B = n - i * r - j * g;
if (B % b != 0)
continue;
if (i * r + j * g + B == n)
ans++;
}
}
print(ans);
}
| [
"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 setout(n, x) setw(n) << setfill(x)
#define Fixed(n) fixed << setprecision(n)
#define pb(x, a) (x).push_back(a)
#define fb(x, a) (x).flont_back(a)
#define eb(x, a) (x).emplaes_back(a)
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const long long mod = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int r, g, b, n, cnt = 0, ans;
cin >> r >> g >> b >> n;
rep(i, 0, 3000) rep(j, 0, 3000) {
ans = i * r + j * g;
if (ans <= n && (n - ans) % b == 0)
++cnt;
}
cout << cnt << '\n';
} | #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 setout(n, x) setw(n) << setfill(x)
#define Fixed(n) fixed << setprecision(n)
#define pb(x, a) (x).push_back(a)
#define fb(x, a) (x).flont_back(a)
#define eb(x, a) (x).emplaes_back(a)
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const long long mod = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int r, g, b, n, cnt = 0, ans;
cin >> r >> g >> b >> n;
rep(i, 0, 3001) rep(j, 0, 3001) {
ans = i * r + j * g;
if (ans <= n && (n - ans) % b == 0)
++cnt;
}
cout << cnt << '\n';
} | [
"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;
return 0;
} | [
"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;
return 0;
} | [
"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
if (temp >= 0 && temp % b == 0) {
++ans;
}
}
}
cout << ans << 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; // 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 = bz
if (temp >= 0 && temp % b == 0) {
++ans;
}
}
}
cout << ans << endl;
return 0;
} | [
"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
if (temp >= 0 && temp % b == 0) {
++ans;
}
}
}
cout << ans << 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; // 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 = bz
if (temp >= 0 && temp % b == 0) {
++ans;
}
}
}
cout << ans << endl;
return 0;
} | [
"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<int, int>
#define priq priority_queue<int>
#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)))
#define tii tuple<int, int, int>
signed main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
REP(i, 0, max(0LL, N / R)) {
REP(j, 0, min((N - i * R) / G, 0LL)) {
if ((N - i * R - j * G) % B == 0)
ans++;
}
}
cout << ans << endl;
}
| #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<int, int>
#define priq priority_queue<int>
#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)))
#define tii tuple<int, int, int>
signed main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
REP(i, 0, max(0LL, N / R)) {
REP(j, 0, max((N - i * R) / G, 0LL)) {
if ((N - i * R - j * G) % B == 0)
ans++;
}
}
cout << ans << endl;
}
| [
"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>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N) {
rep(g, N) {
int v = N - r * R - g * G;
if (v >= 0 && v % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | #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>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N + 1) {
rep(g, N + 1) {
int v = N - r * R - g * G;
if (v >= 0 && v % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N) {
rep(g, N) {
int v = N - r * R - g * G;
if (v > 0 && v % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | #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>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N + 1) {
rep(g, N + 1) {
int v = N - r * R - g * G;
if (v >= 0 && v % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"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 << endl;
return 0;
} | #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;
return 0;
} | [
"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 <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define EPS 1e-9
const int INF = 1050000000;
const long long LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
const int MINF = -1050000000;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; i <= n / r; ++i) {
for (int j = 0; j <= n / g; ++j) {
if (((n - i * r - j * g) % b) == 0 && n >= (i * r - j * g))
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| #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 <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define EPS 1e-9
const int INF = 1050000000;
const long long LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
const int MINF = -1050000000;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
for (int i = 0; i <= n / r; ++i) {
for (int j = 0; j <= n / g; ++j) {
if (((n - i * r - j * g) % b) == 0 && n >= (i * r + j * g))
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| [
"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 namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<i64>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<i64, i64>;
//////////////////////////////////////////////////
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
i64 ret = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; R * r + G * g <= N; g++) {
int k = N - R * r + G * g;
if (k % B == 0)
ret++;
}
}
cout << ret << endl;
return 0;
}
| #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 namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<i64>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<i64, i64>;
//////////////////////////////////////////////////
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
i64 ret = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; R * r + G * g <= N; g++) {
int k = N - (R * r + G * g);
if (k % B == 0) {
// cout << r << " " << g << " " << k / B << endl;
ret++;
}
}
}
cout << ret << endl;
return 0;
}
| [] | 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, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
int x, y, z;
int i, j, k;
repin(i, n) {
x = r * i;
if (x == n) {
ans++;
break;
} else if (n < x) {
break;
}
repin(j, n) {
y = g * j;
if (x + y == n) {
ans++;
break;
} else if (n < x + y) {
break;
}
z = n - (x + y);
if (z % b == 0)
ans += z / b;
}
}
Out(ans);
return 0;
}
| #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, z) for ((x) = (y)-1; (z) <= (x); (x)--)
#define repi(x, y, z) for ((x) = (z); (x) < (y); (x)++)
#define repiin(x, y, z) for ((x) = (z); (x) <= (y); (x)++)
#define reps(x, y, z) for ((x) = 0; (x) < (y); (x) += (z))
#define repis(x, y, z, s) for ((x) = (z); (x) < (y); (x) += (s))
#define repiins(x, y, z, s) for ((x) = (z); (x) <= (y); (x) += (s))
#define repit(x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define repit2(x) \
for (__typeof((x).begin()) it2 = (x).begin(); it2 != (x).end(); it2++)
#define nepit(x) \
for (__typeof((x).rbegin()) it = (x).rbegin(); it != (x).rend(); it++)
#define All(x) (x).begin(), (x).end()
#define Mem0(x) memset(x, 0, sizeof(x))
#define Mem1(x) memset(x, -1, sizeof(x))
// can be applied to string type
#define Unique(v) v.resize(unique(All(v)) - v.begin())
#define peq(p0, p1) (p0.first == p1.first && p0.second == p1.second)
#define End '\n'
#define Out(x) cout << (x) << End
#define YES cout << "YES" << End
#define NO cout << "NO" << End
#define Yes cout << "Yes" << End
#define No cout << "No" << End
template <typename T> void Outln(const string &sep, const T &val) {
cout << val << End;
}
template <typename T, typename... Args>
void Outln(const string &sep, const T &val, Args... args) {
cout << val << sep;
Outln(sep, std::forward<Args>(args)...);
}
template <typename T> void OutN(T x) {
size_t i, len = x.size() - 1;
for (i = 0; i < len; i++)
cout << x[i] << " ";
cout << x[len] << '\n';
}
#define OutaN(x) \
do { \
size_t i, len = sizeof(x) / sizeof(__typeof(x[0])) - 1; \
for (i = 0; i < len; i++) \
cout << x[i] << " "; \
cout << x[len] << '\n'; \
} while (0);
template <typename T> void Outit(T x) {
auto end = x.end();
end--;
for (auto it = x.begin(); it != end; it++)
cout << *it << " ";
cout << *end << '\n';
}
template <typename T> void Debug(const T &val) { cerr << val << End; }
template <typename T, typename... Args> void Debug(const T &val, Args... args) {
cerr << val << ' ';
Debug(std::forward<Args>(args)...);
}
template <typename T> inline bool Max(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool Min(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
// can be applied to string type
#define Sort(v) sort(All(v))
#define SortR(v) sort(All(v), std::greater<__typeof(v[0])>())
// array sorters
#define Sart(a) sort(a, a + sizeof(a) / sizeof(__typeof(a[0])));
#define SartR(a) \
sort(a, a + sizeof(a) / sizeof(__typeof(a[0])), \
std::greater<__typeof(a[0])>())
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define lb std::lower_bound
#define ub std::upper_bound
#define lbi(v, x) lb(All(v), (x)) - v.begin()
#define ubi(v, x) ub(All(v), (x)) - v.begin()
inline bool isSame(const string &a, const string &b) {
return a.compare(b) == 0;
}
inline bool isLess(const string &a, const string &b) {
return a.compare(b) < 0;
}
inline bool isGreater(const string &a, const string &b) {
return a.compare(b) > 0;
}
inline string Str(const char &ch, const int &n) { return string(n, ch); }
inline string Str(const int &n, const char &ch) { return string(n, ch); }
vector<string> getStrLine() {
vector<string> v;
string str;
getline(cin, str);
istringstream iss(str);
for (string word; iss >> word;)
v.push_back(word);
return v;
}
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
/*** ATCODER, CODECHEF and TOPCODER ***/
// -2147483648 <= INT <= 2147483647
// -9223372036854775808 <= LONG <= 9223372036854775807
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
/*** CODEFORCES ***/
// -2147483648 <= INT <= 2147483647
// -2147483648 <= LONG <= 2147483647
// -9223372036854775808 <= LLONG <= 9223372036854775807
/*** END ***/
#define LOCAL 0
int main() {
#if LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout.precision(18);
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
int x, y, z;
int i, j, k;
repin(i, n) {
x = r * i;
if (x == n) {
ans++;
break;
} else if (n < x) {
break;
}
repin(j, n) {
y = g * j;
if (x + y == n) {
ans++;
break;
} else if (n < x + y) {
break;
}
z = n - (x + y);
if (z % b == 0)
ans++;
}
}
Out(ans);
return 0;
}
| [
"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 < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int res = 0;
rep(i, n / r + 1) {
rep(j, (n - i * r) / b + 1) {
if ((i * r + j * b) % g == 0)
res++;
}
}
cout << res << endl;
return 0;
}
| #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 < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
int res = 0;
rep(i, n / r + 1) {
rep(j, (n - i * r) / g + 1) {
if ((n - i * r - j * g) % b == 0)
res++; // cout<<i<<j<<endl;}
}
}
cout << res << endl;
return 0;
}
| [
"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;
return 0;
} | #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;
return 0;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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) {
count++;
break;
}
}
}
cout << count << endl;
}
| #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)
count++;
}
}
cout << count << endl;
}
| [] | 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;
return 0;
}
| [
"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;
}
}
}
cout << sum;
return 0;
} | #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;
}
}
}
cout << sum;
return 0;
} | [
"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;
while (c[2] * i <= n) {
j = 0;
while (c[2] * i + c[1] * j <= n) {
if ((n - c[2] * i + c[1] * j) % c[0] == 0)
cnt++;
j++;
}
i++;
}
cout << cnt << endl;
return 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;
while (c[2] * i <= n) {
j = 0;
while (c[2] * i + c[1] * j <= n) {
if ((n - c[2] * i - c[1] * j) % c[0] == 0)
cnt++;
j++;
}
i++;
}
cout << cnt << endl;
return 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 << endl;
} | [
"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 << endl;
}
| #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 << endl;
}
| [
"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 << ans << endl;
}
| #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 << endl;
}
| [
"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++;
}
}
}
}
cout << ans << endl;
} | #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++;
}
}
}
}
cout << ans << endl;
} | [
"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> // iota, gcd, lcm
#include <queue> // queue
#include <stack> // stack
#include <string> // string
#include <unordered_map> // hashed by keys
#include <vector> // vectors
#define _for(i, n) for (int i = 0; i <= n; i++)
typedef long long ll; // at least int64 > 9*10^18
typedef unsigned long long ull; // at least uint64
using namespace std;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int rmax = n / R;
int gmax = n / G;
int bmax = n / B;
int count = 0;
_for(r, rmax) _for(g, gmax - r * R / G) if ((n - r * R - g * G) % B == 0)
count++;
cout << count << endl;
return 0;
} | #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> // iota, gcd, lcm
#include <queue> // queue
#include <stack> // stack
#include <string> // string
#include <unordered_map> // hashed by keys
#include <vector> // vectors
#define _for(i, n) for (int i = 0; i <= n; i++)
typedef long long ll; // at least int64 > 9*10^18
typedef unsigned long long ull; // at least uint64
using namespace std;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int rmax = n / R;
int gmax = n / G;
int bmax = n / B;
int count = 0;
_for(r, rmax) _for(g, (n - r * R) / G) if ((n - r * R - g * G) % B == 0)
count++;
cout << count << endl;
return 0;
} | [
"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> // iota, gcd, lcm
#include <queue> // queue
#include <stack> // stack
#include <string> // string
#include <unordered_map> // hashed by keys
#include <vector> // vectors
#define _for(i, n) for (int i = 0; i <= n; i++)
typedef long long ll; // at least int64 > 9*10^18
typedef unsigned long long ull; // at least uint64
using namespace std;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int rmax = n / R;
int gmax = n / G;
int bmax = n / B;
int count = 0;
_for(r, rmax) _for(g, gmax - r * R / G) if ((n - r * R - g * G) % B) count++;
cout << count << endl;
return 0;
} | #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> // iota, gcd, lcm
#include <queue> // queue
#include <stack> // stack
#include <string> // string
#include <unordered_map> // hashed by keys
#include <vector> // vectors
#define _for(i, n) for (int i = 0; i <= n; i++)
typedef long long ll; // at least int64 > 9*10^18
typedef unsigned long long ull; // at least uint64
using namespace std;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int rmax = n / R;
int gmax = n / G;
int bmax = n / B;
int count = 0;
_for(r, rmax) _for(g, (n - r * R) / G) if ((n - r * R - g * G) % B == 0)
count++;
cout << count << endl;
return 0;
} | [
"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];
// cout << RGB[0] << RGB[1] << RGB[2] << endl;
for (int r = 0; r <= Min2; r++) {
if (r * RGB[2] > N)
break;
for (int g = 0; g <= Min1; g++) {
if (r * RGB[2] + g * RGB[1] > N)
break;
if ((N - r * RGB[2] + g * RGB[1]) % RGB[0] == 0)
ans++;
}
}
cout << ans << endl;
} | #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];
// cout << RGB[0] << RGB[1] << RGB[2] << endl;
for (int r = 0; r <= Min2; r++) {
if (r * RGB[2] > N)
break;
for (int g = 0; g <= Min1; g++) {
if (r * RGB[2] + g * RGB[1] > N)
break;
if ((N - r * RGB[2] - g * RGB[1]) % RGB[0] == 0)
ans++;
}
}
cout << ans << endl;
} | [
"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];
if (k >= 0)
num++;
}
}
printf("%d\n", num);
return 0;
}
| #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];
if (k % a[0] == 0)
num++;
}
}
printf("%d\n", num);
return 0;
}
| [
"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 * R + g * G <= N; g++) {
if (r * R + g * G == N) {
num++;
break;
}
// for(int b=0; r*R + g*G + b*B <= N; b++){
int temp = N - r * R + g * G;
if (temp % B == 0) {
num++;
// }
}
}
}
// cout << (a+b+c) << " " << s << endl;
cout << num << endl;
return 0;
} | #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 * R + g * G <= N; g++) {
if (r * R + g * G == N) {
num++;
break;
}
int temp = N - r * R - g * G;
if (temp % B == 0) {
num++;
}
}
}
// cout << (a+b+c) << " " << s << endl;
cout << num << endl;
return 0;
} | [
"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.