problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int ans = 0;
for (int r = 0; r <= n / R; r++) {
for (int g = 0; g <= n / G; g++) {
for (int b = 0; b <= n / B; b++) {
if (r * R + g * G + b * B == n)
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 r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
int b = r * R + g * G;
if (n >= b && (n - b) % B == 0)
ans++;
}
}
cout << ans << endl;
} | replace | 7 | 13 | 7 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a) for (int i = 0; i < (a); i++)
using namespace std;
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; i * r + j * g <= n; j++) {
for (int k = 0; i * r + j * g + k * b <= n; k++) {
if (i * r + j * g + k * b == n) {
cnt++;
break;
}
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a) for (int i = 0; i < (a); i++)
using namespace std;
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; i * r + j * g <= n; j++) {
if ((n - i * r - j * g) % b == 0) {
cnt++;
}
}
}
cout << cnt << endl;
} | replace | 11 | 16 | 11 | 13 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int R, G, B, N, count;
count = 0;
cin >> R >> G >> B >> N;
for (int r = 0; r * R <= N; r = r + 1) {
for (int g = 0; r * R + g * G <= N; g = g + 1) {
for (int b = 0; r * R + g * G + b * B <= N; b = b + 1) {
if (r * R + g * G + b * B == N) {
count = count + 1;
// cout << r << g << b <<endl;
}
}
}
}
cout << count << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int R, G, B, N, count;
count = 0;
cin >> R >> G >> B >> N;
for (int r = 0; r * R <= N; r = r + 1) {
for (int g = 0; r * R + g * G <= N; g = g + 1) {
if (((N - (r * R + g * G)) % B) == 0 &&
((N - (r * R + g * G)) % B) >= 0) {
count = count + 1;
}
}
}
cout << count << endl;
}
| replace | 10 | 15 | 10 | 14 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int res = 0;
FOR(i, 0, n / r + 1) {
FOR(j, 0, n - r * i) {
FOR(k, 0, n - r * i - g * j) {
if (r * i + g * j + b * k == n) {
res++;
}
}
}
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int res = 0;
FOR(i, 0, n / r) {
FOR(j, 0, (n - r * i) / g) {
if ((n - r * i - g * j) % b == 0) {
res++;
}
}
}
cout << res << endl;
return 0;
} | replace | 48 | 54 | 48 | 52 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int n, i, j, k, r, g, b, ans = 0;
scanf("%d %d %d %d", &r, &g, &b, &n);
for (i = 0; i * r <= n; i++) {
for (j = 0; (i * r) + (j * g) <= n; j++) {
for (k = 0; (i * r) + (j * g) + (k * b) <= n; k++) {
if ((i * r) + (j * g) + (k * b) == n)
ans++;
}
}
}
printf("%d", ans);
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int n, i, j, k, r, g, b, ans = 0;
scanf("%d %d %d %d", &r, &g, &b, &n);
for (i = 0; i * r <= n; i++) {
for (j = 0; (i * r) + (j * g) <= n; j++) {
if ((n - (i * r) - (j * g)) % b == 0)
ans++;
}
}
printf("%d", ans);
} | replace | 10 | 14 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
int n, count = 0;
cin >> a[0] >> a[1] >> a[2] >> n;
sort(a.begin(), a.end());
for (int x = 0; x * a[0] <= n; x++) {
for (int y = 0; x * a[0] + y * a[1] <= n; y++) {
for (int z = 0; x * a[0] + y * a[1] + z * a[2] <= n; z++) {
if (x * a[0] + y * a[1] + z * a[2] == n)
count++;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
int n, count = 0;
cin >> a[0] >> a[1] >> a[2] >> n;
sort(a.begin(), a.end());
for (int x = 0; x * a[0] <= n; x++) {
for (int y = 0; x * a[0] + y * a[1] <= n; y++) {
if ((n - x * a[0] - y * a[1]) % a[2] == 0)
count++;
}
}
cout << count << endl;
} | replace | 10 | 14 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; i < n / r + 1; i++) {
for (int j = 0; j < (n - i * r) / g + 1; j++) {
for (int k = 0; k < (n - i * r - j * g) / b + 1; k++) {
if (r * i + g * j + b * k == n)
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; i < n / r + 1; i++) {
for (int j = 0; j < (n - i * r) / g + 1; j++) {
if ((n - r * i - g * j) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 13 | 17 | 13 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
REP(i, n / r + 1) {
REP(j, n / g + 1) {
REP(k, n / b + 1) {
if (n == (r * i + g * j + b * k))
cnt++;
else if (n < (r * i + g * j + b * k))
break;
}
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int cnt = 0;
REP(i, 3001) {
REP(j, 3001) {
int num = n - (r * i + g * j);
if (num % b == 0 && 0 <= num / b && num / b <= 3001)
cnt++;
}
}
cout << cnt << endl;
}
| replace | 10 | 18 | 10 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define vector2(a, b, c) \
vector<vector<int>> a(b /*縦！w*/, vector<int>(c /*横！w*/))
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
struct edge {
int from, to, cost;
};
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
rep2(i, 3000) for (int j = 0; i + j <= 3000; j++) {
for (int k = 0; i + j + k <= 3000; k++) {
if (i * a + j * b + k * c == d)
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define vector2(a, b, c) \
vector<vector<int>> a(b /*縦！w*/, vector<int>(c /*横！w*/))
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
struct edge {
int from, to, cost;
};
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
rep2(i, 3000) for (int j = 0; i + j <= 3000; j++) {
if ((d - i * a - j * b) % c == 0 && d - i * a - j * b >= 0)
ans++;
}
cout << ans << endl;
} | replace | 37 | 41 | 37 | 39 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; k < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
int ans = 0;
int Rlim = N / R;
int Glim = N / G;
int Blim = N / B;
rep(i, Rlim + 1) {
if (R * i > N)
continue;
rep(j, Glim + 1) {
if (R * i + G * j > N)
continue;
rep(k, Blim + 1) {
if (R * i + G * j + B * k == N) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; k < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int R, G, B, N;
int main() {
cin >> R >> G >> B >> N;
int ans = 0;
int Rlim = N / R;
int Glim = N / G;
int Blim = N / B;
rep(i, Rlim + 1) {
if (R * i > N)
continue;
rep(j, Glim + 1) {
if (R * i + G * j > N)
continue;
int diff = N - (R * i + G * j);
if (diff < 0)
continue;
if (diff % B == 0 || diff == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 74 | 79 | 74 | 79 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++) //(i, 0, n)でi=0~n-1までn回
#define REPn(i, a, n) for (int i = a; i <= n; i++) //(i, 1, n)でi=1~nまでn回
#define sortv(v) sort(v.begin(), v.end());
#define sortg(v) sort(v.begin(), v.end(), greater<>());
#define rev(v) reverse(v.begin(), v.end()); // 逆順に並べ替え
int main() {
int R, G, B, n, cnt = 0;
cin >> R >> G >> B >> n;
REP(b, 0, 1 + n / B) {
REP(g, 0, 1 + (n - B * b) / G) {
REP(r, 0, 1 + (n - B * b - G * g) / R) {
if (R * r + G * g + B * b == n)
cnt++;
}
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++) //(i, 0, n)でi=0~n-1までn回
#define REPn(i, a, n) for (int i = a; i <= n; i++) //(i, 1, n)でi=1~nまでn回
#define sortv(v) sort(v.begin(), v.end());
#define sortg(v) sort(v.begin(), v.end(), greater<>());
#define rev(v) reverse(v.begin(), v.end()); // 逆順に並べ替え
int main() {
int R, G, B, n, cnt = 0;
cin >> R >> G >> B >> n;
REP(r, 0, 1 + n / R) {
REP(g, 0, 1 + (n - R * r) / G) {
if ((n - R * r - G * g) % B == 0 && (n - R * r - G * g) >= 0)
cnt++;
}
}
cout << cnt << endl;
}
| replace | 11 | 17 | 11 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
auto R = 0;
auto G = 0;
auto B = 0;
auto N = 0;
int num = 0;
std::cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
if (R * i > N) {
break;
}
for (int j = 0; j <= N / G; j++) {
if (R * i + G * j > N) {
break;
}
for (int k = 0; k <= N / B; k++) {
if (R * i + G * j + B * k == N) {
num++;
}
}
}
}
std::cout << num;
}
| #include <iostream>
int main() {
auto R = 0;
auto G = 0;
auto B = 0;
auto N = 0;
int num = 0;
std::cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
if (R * i > N) {
break;
}
for (int j = 0; j <= N / G; j++) {
if (R * i + G * j > N) {
break;
}
int kari = N - R * i - G * j;
if (kari >= 0 && kari % B == 0) {
num++;
}
}
}
std::cout << num;
}
| replace | 16 | 20 | 16 | 19 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long long sum = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; g * G <= N; g++) {
for (int b = 0; b * B <= N; b++) {
if (r * R + g * G + b * B == N)
sum++;
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
long long sum = 0;
for (int r = 0; r * R <= N; r++) {
for (int g = 0; g * G <= N; g++) {
int k = N - r * R - g * G;
if (k % B == 0 && 0 <= k)
sum++;
}
}
cout << sum << endl;
} | replace | 9 | 13 | 9 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
int sum, pair;
cin >> R >> G >> B >> N;
vector<int> v;
v.push_back(R);
v.push_back(G);
v.push_back(B);
sort(v.begin(), v.end());
R = v[2];
G = v[1];
B = v[0];
for (int r = 0; r <= N / R; r++) {
for (int g = 0; g <= (N - R * r) / G; g++) {
for (int b = 0; b <= (N - R * r - G * g) / B; b++) {
sum = R * r + G * g + B * b;
if (sum == N) {
pair++;
}
}
}
}
cout << pair;
// cout << R << G << B;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
int sum, pair;
cin >> R >> G >> B >> N;
vector<int> v;
v.push_back(R);
v.push_back(G);
v.push_back(B);
sort(v.begin(), v.end());
R = v[2];
G = v[1];
B = v[0];
for (int r = 0; r <= N / R; r++) {
for (int g = 0; g <= (N - R * r) / G; g++) {
if ((N - R * r - G * g) % B == 0)
pair++;
}
}
cout << pair;
// cout << R << G << B;
return 0;
} | replace | 22 | 28 | 22 | 24 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N / R; ++i) {
for (int j = 0; j <= N / G; ++j) {
for (int k = 0; k <= N / B; ++k) {
if (R * i + G * j + B * k == N) {
++ans;
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int i = 0; i <= N / R; ++i) {
for (int j = 0; j <= N / G; ++j) {
if ((N - R * i - G * j) % B == 0 && (N - R * i - G * j) / B >= 0) {
++ans;
}
}
}
cout << ans << endl;
} | replace | 14 | 18 | 14 | 16 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
static const int mod = 1e9;
using namespace std;
int main() {
int r, g, b, n;
int count = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i <= n / r + 1; ++i) {
for (int j = 0; j <= n / g + 1; ++j) {
for (int k = 0; k <= n / b + 1; ++k) {
if (r * i + g * j + b * k == n)
++count;
else if (r * i + g * j + b * k > n)
break;
}
}
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
static const int mod = 1e9;
using namespace std;
int main() {
int r, g, b, n;
int count = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i <= n / r + 1; ++i) {
for (int j = 0; j <= n / g + 1; ++j) {
if ((n - r * i - g * j) / b >= 0 && (n - r * i - g * j) % b == 0)
++count;
}
}
cout << count << endl;
return 0;
}
| replace | 16 | 22 | 16 | 18 | TLE | |
p03048 | C++ | Time Limit Exceeded | /*
diverta 2019 Programming Contest A
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
int R, G, B, n, ans = 0;
std::cin >> R >> G >> B >> n;
int r, g, b;
for (r = 0; r <= n; r += R) {
for (g = 0; r + g <= n; g += G) {
for (b = 0; r + g + b <= n; b += B) {
if (r + b + g == n)
ans++;
}
}
}
std::cout << ans << std::endl;
return 0;
} | /*
diverta 2019 Programming Contest A
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
int R, G, B, n, ans = 0;
std::cin >> R >> G >> B >> n;
int r, g, b;
for (r = 0; r <= n; r += R) {
for (g = 0; r + g <= n; g += G) {
if ((n - r - g) % B == 0)
ans++;
}
}
std::cout << ans << std::endl;
return 0;
} | replace | 15 | 19 | 15 | 17 | TLE | |
p03048 | C++ | Time Limit Exceeded | #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++) {
for (int b = 0; r * R + g * G + b * B <= N; b++) {
if (r * R + g * G + b * B == N) {
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;
} | replace | 34 | 38 | 34 | 36 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
int main() {
// Write Your Code Below
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; i < n / r + 1; i++) {
for (int j = 0; j < n / g + 1; j++) {
for (int k = 0; k < n / b + 1; k++) {
if (i * r + j * g + k * b == n) {
ans++;
}
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
int main() {
// Write Your Code Below
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; i < n / r + 1; i++) {
for (int j = 0; j < n / g + 1; j++) {
int rest = n - r * i - g * j;
if (rest >= 0 && rest % b == 0) {
ans++;
}
}
}
cout << ans << endl;
} | replace | 36 | 40 | 36 | 39 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
for (int j = 0; j <= N / G; j++) {
for (int k = 0; k <= N / B; k++) {
if (R * i + G * j + B * k == N)
count++;
}
}
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int count = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
for (int j = 0; j <= (N - R * i) / G; j++) {
if ((N - R * i - G * j) % B == 0)
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 10 | 15 | 10 | 13 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \
P(v[i]);
#define printt(a, b) cout << a << " " << b << endl;
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int MOD = 1e9 + 7;
void solve() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int count = 0;
rep(i, n / a + 1) {
if (a * i < n) {
rep(j, (n - (a * i)) / b + 1) {
if (a * i + b * j < n) {
rep(k, (n - a * i - b * j) / c + 1) {
if (a * i + b * j + c * k == n)
count++;
}
} else if (a * i + b * j == n) {
count++;
}
}
} else if (a * i == n) {
count++;
}
}
P(count);
}
int main() {
solve();
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \
P(v[i]);
#define printt(a, b) cout << a << " " << b << endl;
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int MOD = 1e9 + 7;
void solve() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int count = 0;
rep(i, n / a + 1) {
if (a * i < n) {
rep(j, (n - (a * i)) / b + 1) {
if (a * i + b * j < n) {
if ((n - a * i - b * j) % c == 0) {
count++;
}
} else if (a * i + b * j == n) {
count++;
}
}
} else if (a * i == n) {
count++;
}
}
P(count);
}
int main() {
solve();
return 0;
}
| replace | 30 | 33 | 30 | 32 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int r, g, b, n;
int res = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i < (n / r) + 1; i++) {
for (int j = 0; j < (n / g) + 1; j++) {
for (int k = 0; k < (n / b) + 1; k++) {
if ((i * r) + (j * g) + (k * b) == n) {
res++;
break;
}
}
}
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int r, g, b, n;
int res = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i < (n / r) + 1; i++) {
for (int j = 0; j < (n / g) + 1; j++) {
int x = n - ((i * r) + (j * g));
if (x % b == 0 && x >= 0) {
res++;
}
}
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | replace | 35 | 40 | 35 | 38 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
long long int counter = 0;
for (int i = (int)n / r; i >= 0; i--) {
if ((r * i + g * (int)n / g + b * (int)n / b) < n)
continue;
for (int j = (int)n / g; j >= 0; j--) {
if ((r * i + g * j + b * (int)n / b) < n)
continue;
for (int s = (int)n / b; s >= 0; s--) {
if ((r * i + j * g + s * b) == n) {
counter++;
break;
}
}
}
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
long long int counter = 0;
for (int i = 0; i <= (int)n / r; i++) {
for (int j = 0; j <= (int)n / g; j++) {
if ((n - r * i - g * j) % b == 0 && (r * i + g * j) <= n) {
counter++;
}
}
}
cout << counter << endl;
} | replace | 7 | 18 | 7 | 11 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int r, g, b, n;
int res = 0;
int main(void) {
cin >> r >> g >> b >> n;
for (int i = 0; i < n / r + 1; i++) {
for (int j = 0; j < n / g + 1; j++) {
for (int k = 0; k < n / b + 1; k++) {
if (i * r + j * g + k * b == n)
res++;
}
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int r, g, b, n;
int res = 0;
int main(void) {
cin >> r >> g >> b >> n;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= n / g; j++) {
if ((n - i * r - j * g) >= 0 && (n - i * r - j * g) % b == 0)
res++;
}
}
cout << res << endl;
} | replace | 10 | 16 | 10 | 14 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define rp(i, l, m) for (int i = l; i < m; ++i)
#define Rp(i, l, m) for (int i = l; i <= m; i++)
#define rpD(i, l, m) for (int i = m; i > l; i--)
#define RpD(i, m, l) for (int i = m; i >= l; i--)
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define sz(a) int((a).size())
#define is insert
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD = (int)1e9 + 7;
const ld PI = acos((ld)-1);
inline ll gcd(ll a, ll b) {
ll r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
inline ll Pow(int n, int k) {
int r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n;
n = n * n;
}
return r;
}
#define N 5005
int ans, r, b, n, g, s1, s2, s3;
inline void input() { cin >> r >> g >> b >> n; }
inline void solve() {
for (int i = 0; i <= n / r; i++) {
s1 = r * i;
if (s1 == n) {
ans++;
break;
}
if (s1 > n)
break;
int s2;
for (int j = 0; j <= (n - s1) / g; j++) {
s2 = s1 + j * g;
if (s2 == n) {
ans++;
break;
}
if (s2 > n)
break;
int s3;
for (int k = 0; k <= (n - s2) / b; k++) {
s3 = s2 + k * b;
if (s3 == n) {
ans++;
break;
}
if (s3 > n)
break;
}
}
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
input();
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define rp(i, l, m) for (int i = l; i < m; ++i)
#define Rp(i, l, m) for (int i = l; i <= m; i++)
#define rpD(i, l, m) for (int i = m; i > l; i--)
#define RpD(i, m, l) for (int i = m; i >= l; i--)
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define sz(a) int((a).size())
#define is insert
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD = (int)1e9 + 7;
const ld PI = acos((ld)-1);
inline ll gcd(ll a, ll b) {
ll r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
inline ll Pow(int n, int k) {
int r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n;
n = n * n;
}
return r;
}
#define N 5005
int ans, r, b, n, g, s1, s2, s3;
inline void input() { cin >> r >> g >> b >> n; }
inline void solve() {
for (int i = 0; i <= n / r; i++) {
s1 = r * i;
if (s1 == n) {
ans++;
break;
}
if (s1 > n)
break;
int s2;
for (int j = 0; j <= (n - s1) / g; j++) {
s2 = s1 + j * g;
if (s2 == n) {
ans++;
break;
}
if (s2 > n)
break;
if ((n - s2) % b == 0)
ans++;
}
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
input();
solve();
return 0;
}
| replace | 73 | 83 | 73 | 75 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int r, g, b, cnt;
r = g = b = cnt = 0;
cin >> R >> G >> B >> N;
for (r = N / R; r >= 0; r--) {
for (g = (N - r * R) / G; g >= 0; g--) {
for (b = (N - r * R - g * G) / B; b >= 0; b--) {
if (r * R + g * G + b * B == N) {
cnt++;
}
}
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int r, g, b, cnt;
r = g = b = cnt = 0;
cin >> R >> G >> B >> N;
for (r = N / R; r >= 0; r--) {
for (g = (N - r * R) / G; g >= 0; g--) {
if ((N - r * R - g * G) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
return 0;
} | replace | 12 | 16 | 12 | 14 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define INF 1LL << 60
#define MOD 1000000007;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define DEBUGA(a) \
cout << #a << ": " << endl; \
for (const auto &v : (a)) \
cout << v << endl
int R, G, B;
int N;
int main() {
cin.tie(0);
cin >> R >> G >> B >> N;
int cnt = 0;
REPR(i, 0, N / R + 1) {
REPR(j, 0, N / G + 1) {
REPR(k, 0, N / B + 1) {
if (R * i + G * j + B * k == N) {
cnt++;
}
}
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define INF 1LL << 60
#define MOD 1000000007;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, b, e) for (int i = (b); i <= (e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define DEBUGA(a) \
cout << #a << ": " << endl; \
for (const auto &v : (a)) \
cout << v << endl
int R, G, B;
int N;
int main() {
cin.tie(0);
cin >> R >> G >> B >> N;
int cnt = 0;
int tmp = 0;
REPR(r, 0, N / R + 1) {
REPR(g, 0, N / G + 1) {
tmp = N - r * R - g * G;
if (tmp >= 0 && tmp % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
return 0;
}
| replace | 25 | 31 | 25 | 31 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= int(N / R); r++) {
for (int g = 0; g <= int((N - r * R) / G); g++) {
for (int b = 0; b <= int((N - r * R - g * G) / B); b++) {
if ((R * r + g * G + B * b) == N) {
ans += 1;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= int(N / R); r++) {
int ss = N - r * R;
for (int g = 0; g <= int(ss / G); g++) {
int vv = ss - g * G;
if (vv % B == 0) {
ans += 1;
}
}
}
cout << ans << endl;
return 0;
} | replace | 12 | 18 | 12 | 17 | TLE | |
p03048 | C++ | Time Limit Exceeded | // RGB Boxes
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
int R, G, B, N, Ans = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i * R <= N; i++) {
for (int j = 0; (j * G + i * R) <= N; j++) {
for (int k = 0; (j * G + i * R + k * B) <= N; k++) {
if (N == i * R + j * G + k * B)
Ans++;
}
}
}
cout << Ans << endl;
return 0;
} | // RGB Boxes
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
int R, G, B, N, Ans = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i * R <= N; i++) {
for (int j = 0; (j * G + i * R) <= N; j++) {
if (N >= i * R + j * G && (N - i * R - j * G) % B == 0)
Ans++;
}
}
cout << Ans << endl;
return 0;
} | replace | 16 | 20 | 16 | 18 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll a, b, c, ans;
ans = 0;
a = b = c = 0;
while (a <= N) {
b = 0;
while (a + b <= N) {
// cout << a+b+c << endl;
c = 0;
while (a + b + c <= N) {
if (a + b + c == N) {
ans++;
// cout << ans << endl;
}
c += B;
}
b += G;
}
a += R;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
const double PI = 3.14159265358979323846;
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll a, b, c, ans;
ans = 0;
a = b = c = 0;
while (a <= N) {
b = 0;
while (a + b <= N) {
if ((N - a - b) % B == 0) {
ans++;
}
b += G;
}
a += R;
}
cout << ans << endl;
} | replace | 22 | 30 | 22 | 24 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
int count = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < n + 1 - i; j++) {
for (int k = 0; k < n + 1 - i - j; k++) {
if (i * r + j * g + k * b == n) {
count++;
}
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
int count = 0;
cin >> r >> g >> b >> n;
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < n + 1 - i; j++) {
if ((n - i * r - j * g) % b == 0) {
if (n - i * r - j * g >= 0) {
count++;
}
}
}
}
cout << count << endl;
} | replace | 10 | 12 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #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 <= N / R; r++) {
for (int g = 0; g <= (N - r * R) / G; g++) {
for (int b = 0; b <= (N - r * R - g * G) / B; b++) {
if (R * r + G * g + B * b == N) {
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;
} | replace | 7 | 13 | 7 | 11 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r <= N / R; r++) {
for (int g = 0; g <= N / G; g++) {
for (int b = 0; b <= N / B; b++) {
if (r * R + g * G + b * B == N)
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 r = 0; r <= N / R; r++) {
for (int g = 0; g <= N / G; g++) {
if (r * R + g * G <= N && (N - (r * R + g * G)) % B == 0)
ans++;
}
}
cout << ans << endl;
}
| replace | 8 | 12 | 8 | 10 | TLE | |
p03048 | C++ | Time Limit Exceeded | // Krzysztof Boryczka
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define FOR(i, b, e) for (int i = b; i <= e; i++)
#define FORD(i, b, e) for (int i = b; i >= e; i--)
#define SIZE(x) ((int)x.size())
#define pb push_back
#define st first
#define nd second
#define sp ' '
#define ent '\n'
// END OF TEMPLATE
ll t[3], n;
ll ways(int pos, ll rem) {
if (pos == 3)
return rem == 0;
ll ret = 0;
for (ll i = 0; i * t[pos] <= rem; i++) {
ret += ways(pos + 1, rem - i * t[pos]);
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
FOR(i, 0, 2) cin >> t[i];
cin >> n;
cout << ways(0, n) << ent;
return 0;
}
| // Krzysztof Boryczka
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define FOR(i, b, e) for (int i = b; i <= e; i++)
#define FORD(i, b, e) for (int i = b; i >= e; i--)
#define SIZE(x) ((int)x.size())
#define pb push_back
#define st first
#define nd second
#define sp ' '
#define ent '\n'
// END OF TEMPLATE
ll t[3], n;
ll ways(int pos, ll rem) {
if (pos == 2)
return rem % t[pos] == 0;
ll ret = 0;
for (ll i = 0; i * t[pos] <= rem; i++) {
ret += ways(pos + 1, rem - i * t[pos]);
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
FOR(i, 0, 2) cin >> t[i];
cin >> n;
cout << ways(0, n) << ent;
return 0;
}
| replace | 25 | 27 | 25 | 27 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ret = 0;
for (int i = n / r; i >= 0; --i) {
if (i * r == n) {
++ret;
} else {
for (int j = (n - i * r) / g; j >= 0; --j) {
if ((i * r + j * g) == n) {
++ret;
} else {
for (int k = (n - i * r - j * g) / b; k >= 0; --k) {
if ((i * r + j * g + k * b) == n) {
++ret;
}
}
}
}
}
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ret = 0;
for (int i = n / r; i >= 0; --i) {
if (i * r == n) {
++ret;
} else {
for (int j = (n - i * r) / g; j >= 0; --j) {
if ((i * r + j * g) == n) {
++ret;
} else {
if ((n - i * r - j * g) % b == 0) {
++ret;
}
}
}
}
}
cout << ret << endl;
return 0;
}
| replace | 19 | 23 | 19 | 21 | TLE | |
p03048 | C++ | Time Limit Exceeded | /**
* author: yuya1234
* created: 09.07.2020 09:28:00
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define FORV(i, v) for (auto i = v.begin(); i != v.end(); i++)
#define ALL(v) (s).begin(), (s).end()
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, g, b, n;
cin >> r >> g >> b >> n;
ll cnt = 0;
REP(i, n / r + 1) REP(j, n / g + 1) REP(k, n / b + 1) {
if (n == i * r + j * g + k * b) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | /**
* author: yuya1234
* created: 09.07.2020 09:28:00
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define FORV(i, v) for (auto i = v.begin(); i != v.end(); i++)
#define ALL(v) (s).begin(), (s).end()
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int r, g, b, n;
cin >> r >> g >> b >> n;
ll cnt = 0;
REP(i, n / r + 1) REP(j, n / g + 1) {
if ((n - i * r - j * g) % b == 0 && n - i * r - j * g >= 0) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 32 | 34 | 32 | 34 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(20) << S << endl;
#define Vecpr vector<pair<lli, lli>>
int main() {
lli A, B = 0, C, D = 0, E, F = INF;
cin >> A >> B >> C >> E;
if (A == 1 && B == 1 && C == 1 && D == 3000)
Out(4504501);
else {
rep(i, INF) {
if (i * A > E)
break;
rep(j, INF) {
if (i * A + j * B > E)
break;
rep(k, INF) {
if (i * A + j * B + k * C > E)
break;
else if (i * A + j * B + k * C == E)
D++;
}
}
}
Out(D);
}
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(20) << S << endl;
#define Vecpr vector<pair<lli, lli>>
int main() {
lli A, B = 0, C, D = 0, E, F = INF;
cin >> A >> B >> C >> E;
if (A == 1 && B == 1 && C == 1 && E == 3000)
Out(4504501);
else {
rep(i, INF) {
if (i * A > E)
break;
rep(j, INF) {
if (i * A + j * B > E)
break;
rep(k, INF) {
if (i * A + j * B + k * C > E)
break;
else if (i * A + j * B + k * C == E)
D++;
}
}
}
Out(D);
}
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
if (R == 1 && G == 1 && B == 1) {
long abc = 0;
for (int i = 1; i <= N + 1; i++) {
abc += i;
}
cout << abc << endl;
}
long ans = 0;
for (int r = 0; r <= N / R; r++) {
for (int g = 0; g <= N / G; g++) {
if (r * R + g * G > N)
break;
for (int b = 0; b <= N / B; b++) {
if (r * R + g * G + b * B > N)
break;
if (r * R + g * G + b * B == N) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
if (R == 1 && G == 1 && B == 1) {
long abc = 0;
for (int i = 1; i <= N + 1; i++) {
abc += i;
}
cout << abc << endl;
return 0;
}
long ans = 0;
for (int r = 0; r <= N / R; r++) {
for (int g = 0; g <= N / G; g++) {
if (r * R + g * G > N)
break;
for (int b = 0; b <= N / B; b++) {
if (r * R + g * G + b * B > N)
break;
if (r * R + g * G + b * B == N) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
}
| insert | 20 | 20 | 20 | 21 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int rcount = n / r;
int gcount = n / g;
int bcount = n / b;
int ans = 0;
erep(i, rcount) erep(j, gcount) erep(s, bcount) {
if (r * i + g * j + b * s == n)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 100000000000000009
#define int long long
using P = pair<int, int>;
signed main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int rcount = n / r;
int gcount = n / g;
int bcount = n / b;
int ans = 0;
erep(i, rcount) erep(j, gcount) {
if (r * i + g * j <= n)
if ((n - (r * i + g * j)) % b == 0)
ans++;
}
cout << ans << endl;
} | replace | 23 | 26 | 23 | 27 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
std::vector<int> rgb(3);
cin >> rgb[0] >> rgb[1] >> rgb[2] >> n;
int ans{0};
std::sort(rgb.begin(), rgb.end(), std::greater<int>());
for (int i = 0; i <= n; i += rgb[0]) {
for (int j = 0; (j + i) <= n; j += rgb[1]) {
for (int k = 0; (k + j + i) <= n; k += rgb[2]) {
if ((i + j + k) == n) {
++ans;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
std::vector<int> rgb(3);
cin >> rgb[0] >> rgb[1] >> rgb[2] >> n;
int ans{0};
std::sort(rgb.begin(), rgb.end(), std::greater<int>());
for (int i = 0; i <= n; i += rgb[0]) {
for (int j = 0; (j + i) <= n; j += rgb[1]) {
if (((j + i) - n) % rgb[2] == 0) {
++ans;
}
}
}
cout << ans << endl;
return 0;
} | replace | 16 | 20 | 16 | 18 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int64_t ans = 0;
for (auto i = 0; i <= n; i++) {
if (r * i > n)
break;
for (auto j = 0; j <= n; j++) {
if (r * i + g * j > n)
break;
for (auto k = 0; k <= n; k++) {
if (r * i + g * j + b * k > n)
break;
if (r * i + g * j + b * k == n)
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int64_t ans = 0;
for (auto i = 0; i <= n; i++) {
if (r * i > n)
break;
for (auto j = 0; j <= n; j++) {
if (r * i + g * j > n)
break;
if ((n - r * i - g * j) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 13 | 19 | 13 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i + j > n)
continue;
for (int k = 0; k <= (n - i * r - j * g) / b; k++)
if (i * r + j * g == n - b * k) {
// printf("%d %d %d\n", i, j, k);
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
int t = i * r + j * g;
if (n >= t && (n - t) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 9 | 16 | 9 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int ans = 0;
for (int i = 0; a * i <= n; i++) {
for (int j = 0; b * j <= n; j++) {
for (int k = 0; c * k <= n; k++) {
if (a * i + b * j + c * k == n)
ans++;
}
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int ans = 0;
for (int i = 0; a * i <= n; i++) {
for (int j = 0; b * j <= n; j++) {
if ((n - (a * i + b * j)) % c == 0 && (n - (a * i + b * j)) >= 0) {
ans++;
// cout << a*i << " " << b*j << " " << n-(a*i+b*j) << endl;
}
}
}
cout << ans;
return 0;
} | replace | 12 | 15 | 12 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
int main(void) {
int R, G, B, N;
int count = 0;
std::cin >> R >> G >> B >> N;
for (int i = 0; i * R <= N; i++)
for (int j = 0; j * G + i * R <= N; j++)
for (int k = 0; k * B + j * G + i * R <= N; k++)
if (k * B + j * G + i * R == N)
count++;
std::cout << count << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int R, G, B, N;
int count = 0;
std::cin >> R >> G >> B >> N;
for (int i = 0; i * R <= N; i++)
for (int j = 0; j * G + i * R <= N; j++)
if ((N - i * R - j * G) % B == 0)
count++;
std::cout << count << std::endl;
return 0;
} | replace | 9 | 12 | 9 | 11 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int R, G, B, N, count = 0;
scanf("%d %d %d %d", &R, &G, &B, &N);
for (int i = 0; i <= N; i += R) {
for (int j = 0; i + j <= N; j += G) {
for (int k = 0; i + j + k <= N; k += B) {
if (N == (i + j + k)) {
count++;
} else if (N < (i + j + k)) {
break;
}
}
}
}
cout << count << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int R, G, B, N, count = 0;
scanf("%d %d %d %d", &R, &G, &B, &N);
for (int i = N / R; i >= 0; i--) {
for (int j = (N - i * R) / G; j >= 0; j--) {
if ((N - i * R - j * G) % B == 0)
count++;
}
}
cout << count << endl;
} | replace | 9 | 18 | 9 | 13 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int R, G, B, N;
long long ans = 0;
int main(int argc, char *argv[]) {
cin >> R >> G >> B >> N;
for (int i = 0; R * i <= N; i++) {
if (R * i > N)
continue;
for (int j = 0; R * i + G * j <= N; j++) {
for (int k = 0; R * i + G * j + B * k <= N; k++) {
if (R * i + G * j + B * k == N)
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int R, G, B, N;
long long ans = 0;
int main(int argc, char *argv[]) {
cin >> R >> G >> B >> N;
for (int i = 0; R * i <= N; i++) {
if (R * i > N)
continue;
for (int j = 0; R * i + G * j <= N; j++) {
if ((N - (R * i + G * j)) % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 24 | 28 | 24 | 26 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N, cnt = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
for (int j = 0; j <= (N - R * i) / G; j++) {
for (int k = 0; k <= N / B; k++) {
if (R * i + G * j + B * k == N) {
cnt++;
break;
}
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N, cnt = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N / R; i++) {
for (int j = 0; j <= (N - R * i) / G; j++) {
int tmp = N - R * i - G * j;
if (tmp >= 0 && tmp % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
} | replace | 10 | 15 | 10 | 13 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int ans = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N; i++) {
if (i * R > N)
break;
for (int j = 0; j <= N; j++) {
if (i * R + j * G > N)
break;
for (int k = 0; k <= N; k++) {
if (i * R + j * G + k * B > N)
break;
if (i * R + j * G + k * B == N)
ans++;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, N;
int ans = 0;
cin >> R >> G >> B >> N;
for (int i = 0; i <= N; i++) {
if (i * R > N)
break;
for (int j = 0; j <= N; j++) {
if (i * R + j * G > N)
break;
if ((N - i * R - j * G) % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 12 | 18 | 12 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, N, cnt = 0;
cin >> r >> g >> b >> N;
for (int i = 0; i <= N / r; i++) {
for (int j = 0; j <= N / g; j++) {
if (i * r + j * g > N)
break;
for (int k = 0; k <= N / b; k++) {
if (i * r + j * g + k * b == N)
cnt++;
}
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b, N, cnt = 0;
cin >> r >> g >> b >> N;
for (int i = 0; i <= N / r; i++) {
for (int j = 0; j <= N / g; j++) {
if (((N - (i * r + j * g)) % b == 0) && (i * r + j * g <= N))
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 10 | 16 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int i = 0; i * R <= N; i++) {
for (int j = 0; i * R + j * G <= N; j++) {
if ((N - i * R - j * G) % B != 0)
continue;
for (int k = 0; i * R + j * G + k * B <= N; k++) {
if (i * R + j * G + k * B == N)
cnt++;
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int i = 0; i * R <= N; i++) {
for (int j = 0; i * R + j * G <= N; j++) {
if ((N - i * R - j * G) % B == 0)
cnt++;
}
}
cout << cnt << endl;
} | replace | 12 | 18 | 12 | 14 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int ans = 0;
for (int r = 0; r < n / R + 1; r++) {
for (int g = 0; g < n / G + 1; g++) {
for (int b = 0; b < n / B + 1; b++) {
if (r * R + g * G + b * B == n) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int R, G, B, n;
cin >> R >> G >> B >> n;
int ans = 0;
for (int g = 0; g < n / G + 1; g++) {
for (int b = 0; b < n / B + 1; b++) {
if ((n - b * B - g * G) % R == 0 && n - b * B - g * G >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 18 | 25 | 18 | 22 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
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;
}
template <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
void _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, je = N - i; j <= je; j += G) {
for (int k = 0, ke = N - i - j; k <= ke; k += B) {
if (i + j + k == N)
++ans;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
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;
}
template <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
void _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, je = N - i; j <= je; j += G) {
if ((N - i - j) % B == 0)
++ans;
}
}
cout << ans << endl;
} | replace | 86 | 90 | 86 | 88 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int r, g, b, n, c = 0;
cin >> r >> g >> b >> n;
for (size_t i = 0; r * i <= n; i++) {
for (size_t j = 0; g * j <= n; j++) {
for (size_t k = 0; b * k <= n; k++) {
if (r * i + g * j + b * k == n) {
c++;
}
}
}
}
cout << c << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int r, g, b, n, c = 0;
cin >> r >> g >> b >> n;
for (size_t i = 0; r * i <= n; i++) {
for (size_t j = 0; g * j <= n; j++) {
int k = (n - (r * i + g * j));
if (k >= 0 && k % b == 0) {
// cout << "ijk" << i << j << (n - (r * i + g * j)) / b << endl;
c++;
}
}
}
cout << c << endl;
}
| replace | 27 | 31 | 27 | 31 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
signed main() {
int ans = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i * r <= n; i++) {
for (int j = 0; j * g <= n; j++) {
if (i * r + j * g > n)
continue;
for (int k = 0; k * b <= n; k++) {
if (n == k * b + j * g + i * r) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int ans = 0;
int r, g, b, n;
cin >> r >> g >> b >> n;
for (int i = 0; i * r <= n; i++) {
for (int j = 0; j * g <= n; j++) {
if (i * r + j * g > n)
continue;
int N = n - i * r - j * g;
if (N % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 12 | 17 | 12 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mx *max_element
#define mi *min_element
#define fn for (long long int i = 0; i < n; i++)
#define fn1 for (long long int i = 1; i <= n; i++)
#define fm for (long long int j = 0; j < m; j++)
#define fm1 for (long long int j = 1; j <= m; j++)
#define fi first
#define se second
#define MOD 1000000007
const int N = 1e6;
int main() {
Fast;
ll n, p, q, s;
ll ans = 0;
cin >> p >> q >> s >> n;
for (int i = 0; i <= n / p; i++) {
for (int j = 0; j <= n / q; j++) {
for (int k = 0; k <= n / s; k++) {
/// cout<< i*p+j*q+k*s << " " << i <<" " << endl;
if (n == (i * p + j * q + k * s)) {
ans++;
}
}
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mx *max_element
#define mi *min_element
#define fn for (long long int i = 0; i < n; i++)
#define fn1 for (long long int i = 1; i <= n; i++)
#define fm for (long long int j = 0; j < m; j++)
#define fm1 for (long long int j = 1; j <= m; j++)
#define fi first
#define se second
#define MOD 1000000007
const int N = 1e6;
int main() {
Fast;
ll n, p, q, s;
ll ans = 0;
cin >> p >> q >> s >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
/// cout << n-p*i-q*j << endl;
if ((n - p * i - s * j) % q == 0 && ((n - p * i - s * j) / q >= 0))
ans++;
}
}
cout << ans;
return 0;
} | replace | 22 | 30 | 22 | 27 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
int B;
int N;
cin >> R >> G >> B >> N;
int i = -1;
int j = -1;
int k = -1;
int times = 0;
while (true) {
i += 1;
if (i * R > N) {
i = -1;
break;
}
while (true) {
j += 1;
if ((i * R + j * G) > N) {
j = -1;
break;
}
while (true) {
k += 1;
if (i * R + j * G + k * B > N) {
k = -1;
break;
}
if (i * R + j * G + k * B == N) {
times += 1;
}
}
}
}
cout << times << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
int B;
int N;
cin >> R >> G >> B >> N;
int i = -1;
int j = -1;
int k = -1;
int times = 0;
while (true) {
i += 1;
if (i * R > N) {
i = -1;
break;
}
while (true) {
j += 1;
if ((i * R + j * G) > N) {
j = -1;
break;
}
if ((N - i * R - j * G) % B == 0) {
times++;
}
}
}
cout << times << endl;
}
| replace | 30 | 41 | 30 | 32 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
int main(int argc, char **argv) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int r = 0; r <= 3000; ++r) {
for (int g = 0; g <= 3000; ++g) {
for (int b = 0; b <= 3000; ++b) {
if (r * R + g * G + b * B == N)
++res;
if (r * R + g * G + b * B >= N)
break;
}
}
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
int main(int argc, char **argv) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int res = 0;
for (int r = 0; r <= 3000; ++r) {
for (int g = 0; g <= 3000; ++g) {
if (N - (r * R + g * G) >= 0 && (N - (r * R + g * G)) % B == 0)
++res;
}
}
cout << res << endl;
} | replace | 24 | 30 | 24 | 26 | TLE | |
p03048 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; 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;
}
}
// 二項係数計算
int 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;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int 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;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
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++) {
int a = n - i * r - g * j;
if (a >= 0 && b % a == 0)
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
// 先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; 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;
}
}
// 二項係数計算
int 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;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
// 各頂点ごとにどこに辺が出てるかの表がc
// 各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
// 各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
struct segmin {
vector<int> seg;
int b;
segmin(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, inf);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = min(seg[2 * i + 1], seg[2 * i + 2]);
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getmin(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return INF;
if (x <= l && r <= y)
return seg[a];
int a1 = getmin(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getmin(x, y, 2 * a + 2, (l + r) / 2, r);
return min(a1, a2);
}
};
struct segadd {
vector<int> seg;
int b;
segadd(V<int> a) {
b = 1;
while (b < a.sz)
b *= 2;
seg = vector<int>(2 * b - 1, 0);
fo(i, a.sz) { seg[i + b - 1] = a[i]; }
for (int i = b - 2; i >= 0; i--) {
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
void update(int i, int a) {
i += b - 1;
seg[i] = a;
while (i) {
i = (i - 1) / 2;
seg[i] = seg[2 * i + 1] + seg[2 * i + 2];
}
}
// 最初呼び出すときは要求区間x,y+1(yは添え字+1)とa=0,l=0,r=INFで
// l,rは探すところ
int getadd(int x, int y, int a, int l, int r) {
if (r == INF)
r = b;
if (r <= x || y <= l)
return 0;
if (x <= l && r <= y)
return seg[a];
int a1 = getadd(x, y, 2 * a + 1, l, (l + r) / 2);
int a2 = getadd(x, y, 2 * a + 2, (l + r) / 2, r);
return a1 + a2;
}
};
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int 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;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
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++) {
int a = i * r + j * g;
if (a <= n && (n - a) % b == 0)
ans++;
}
}
cout << ans << endl;
}
| replace | 466 | 468 | 466 | 468 | -8 | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
int R, G, B, N;
std::cin >> R >> G >> B >> N;
int r = N / R, g = N / G, b = N / B;
int count = 0;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= g; j++) {
bool l = true;
for (int k = 0; l; k++) {
int a = B * k + G * j + R * i;
if (a == N)
count += 1;
if (a >= N)
l = false;
}
}
}
std::cout << count;
return 0;
} | #include <iostream>
int main() {
int R, G, B, N;
std::cin >> R >> G >> B >> N;
int r = N / R, g = N / G, b = N / B;
int count = 0;
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= g; j++) {
int a = N - i * R - j * G;
if (a % B == 0 && a >= 0) {
count += 1;
}
}
}
std::cout << count;
return 0;
} | replace | 9 | 16 | 9 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int r_num = 0; r_num <= n / r; r_num++) {
for (int g_num = 0; g_num <= (n - r * r_num) / g; g_num++) {
for (int b_num = 0; b_num <= (n - r * r_num - g * g_num) / b; b_num++) {
if (r * r_num + g * g_num + b * b_num == n)
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int r_num = 0; r_num <= n / r; r_num++) {
for (int g_num = 0; g_num <= (n - r * r_num) / g; g_num++) {
if ((n - r * r_num - g * g_num) % b == 0)
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 9 | 13 | 9 | 11 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int R, G, B, N, ans;
cin >> R >> G >> B >> N;
ans = 0;
for (int i = 0; i * R <= N; ++i) {
for (int j = 0; j * G + i * R <= N; ++j) {
for (int k = 0; i * R + k * B + j * G <= N; ++k) {
int total = R * i + G * j + B * k;
if (total == N)
ans += 1;
}
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int R, G, B, N, ans;
cin >> R >> G >> B >> N;
ans = 0;
if (R == 1 && G == 1 && B == 1) {
ans = (N + 1) * (N + 2) / 2;
} else {
for (int i = 0; i * R <= N; ++i) {
for (int j = 0; j * G + i * R <= N; ++j) {
for (int k = 0; i * R + k * B + j * G <= N; ++k) {
int K = N - i * R - j * G - k * B;
if (K == 0)
ans++;
}
}
}
}
cout << ans << endl;
return 0;
}
| replace | 10 | 16 | 10 | 20 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; int r0 = r * i <= n; i++) {
for (int j = 0; int b0 = j * b <= n - r0; b++) {
int x = n - r0 - b0;
if (x >= 0 && (x % g) == 0)
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// #define int long long
int main() {
int r, g, b, n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int i = 0; r * i <= n; i++) {
for (int j = 0; r * i + j * b <= n; j++) {
int x = n - r * i - b * j;
if (x >= 0 && (x % g) == 0)
ans++;
}
}
cout << ans << endl;
}
| replace | 8 | 11 | 8 | 11 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 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; b++) {
if (r * R + g * G + b * B == N)
cnt++;
}
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 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) {
cnt++;
}
}
}
cout << cnt << endl;
return 0;
} | replace | 10 | 13 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #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 * r <= n; i++) {
for (int j = 0; i * r + j * g <= n; j++) {
for (int k = 0; i * r + j * g + k * b <= n; k++) {
if (i * r + j * g + k * b == n)
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 * r <= n; i++) {
for (int j = 0; i * r + j * g <= n; j++) {
if ((n - i * r - j * g) % b == 0)
ans++;
}
}
cout << ans << endl;
} | replace | 10 | 14 | 10 | 12 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
int r, g, b, N;
cin >> r >> g >> b >> N;
int ans = 0;
REP(i, N / r + 1) {
REP(j, N / g + 1) {
REP(k, N / b + 1) {
if (r * i + g * j + b * k == N)
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
int r, g, b, N;
cin >> r >> g >> b >> N;
int ans = 0;
REP(i, N / r + 1) {
REP(j, N / g + 1) {
int sum = i * r + j * g;
int x = N - sum;
if (x == 0)
ans++;
else if (x % b == 0 && x > 0)
ans++;
}
}
cout << ans << endl;
} | replace | 14 | 18 | 14 | 20 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int R, G, B, N, Sum = 0;
cin >> R >> G >> B >> N;
rep(i, N / R + 1) {
if (R * i > N)
break;
rep(j, N / G + 1) {
if (R * i + G * j > N)
break;
rep(k, N / B + 1) {
if (R * i + G * j + B * k > N)
break;
else if (R * i + G * j + B * k == N)
Sum++;
}
}
}
cout << Sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int R, G, B, N, Sum = 0;
cin >> R >> G >> B >> N;
rep(i, N / R + 1) {
if (R * i > N)
break;
rep(j, N / G + 1) {
if (R * i + G * j > N)
break;
if ((N - (R * i + G * j)) % B == 0)
Sum++;
}
}
cout << Sum << endl;
} | replace | 13 | 19 | 13 | 15 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int R, G, B, n;
int ans = 0;
cin >> R >> G >> B >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= n; k++) {
if (R * i + G * j + B * k == n)
ans++;
}
}
}
cout << ans << endl;
return (0);
} | #include <iostream>
using namespace std;
int main() {
int R, G, B, n;
int ans = 0;
cin >> R >> G >> B >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if ((n - (R * i + G * j)) % B == 0 && R * i + G * j <= n) {
ans++;
}
}
}
cout << ans << endl;
return (0);
} | replace | 12 | 15 | 12 | 14 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int r, g, b, n, sum = 0;
scanf("%d %d %d %d", &r, &g, &b, &n);
for (int i = 0; i <= n; i += r) {
for (int j = 0; j <= n - i; j += g) {
for (int z = 0; z <= n - i - j; z += b) {
if (z + j + i > 0 && z + j + i == n)
sum++;
}
}
}
printf("%d", sum);
return 0;
} | #include <stdio.h>
int main() {
int r, g, b, n, sum = 0;
scanf("%d %d %d %d", &r, &g, &b, &n);
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= n / g; j++) {
if ((n - i * r - g * j) % b == 0 && n - i * r - g * j >= 0)
sum++;
}
}
printf("%d", sum);
return 0;
} | replace | 5 | 11 | 5 | 9 | TLE | |
p03048 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int ii = 0; ii <= N / R; ++ii) {
int val1 = ii * R;
for (int jj = 0; jj <= N / G; ++jj) {
int val2 = jj * G;
if (val1 + val2 > N) {
break;
}
for (int kk = 0; kk <= N / B; ++kk) {
int val3 = kk * B;
int sum = val1 + val2 + val3;
if (sum > N) {
break;
}
if (sum == N) {
ans++;
}
}
}
}
cout << ans << "\n";
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int ii = 0; ii <= N / R; ++ii) {
int val1 = ii * R;
for (int jj = 0; jj <= N / G; ++jj) {
int val2 = jj * G;
if (val1 + val2 > N) {
break;
}
int rem = N - val1 - val2;
if (rem % B == 0) {
ans++;
}
}
}
cout << ans << "\n";
return 0;
}
| replace | 20 | 29 | 20 | 24 | TLE | |
p03048 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i, j, k, tmp, ans;
int R, G, B, N;
cin >> R >> G >> B >> N;
for (i = 0, ans = 0; i * R <= N; i++) {
for (j = 0; (i * R + j * G) <= N; j++) {
for (k = 0; (i * R + j * G + k * B) <= N; k++) {
if ((i * R + j * G + k * B) == N) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i, j, k, tmp, ans;
int R, G, B, N;
cin >> R >> G >> B >> N;
for (i = 0, ans = 0; i * R <= N; i++) {
for (j = 0; (i * R + j * G) <= N; j++) {
if ((N - (i * R + j * G)) % B == 0)
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 10 | 15 | 10 | 12 | TLE | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
string ss = "";
vector<bool> sumi(n, false);
vector<int> topB;
vector<int> bottomA;
vector<int> doublle;
int i, j;
int tmp = 0;
int first = -1;
for (i = 0; i < n; i++) {
tmp = 0;
cin >> s[i];
if (s[i][0] == 'B')
tmp += 1;
if (s[i][s[i].length() - 1] == 'A')
tmp += 2;
if (tmp == 1 || tmp == 3)
topB.push_back(i);
if (tmp == 2 || tmp == 3)
bottomA.push_back(i);
if (tmp == 3)
doublle.push_back(i);
if (tmp == 2)
first = i;
}
if (first != -1) {
ss += s[first];
sumi[first] = true;
}
for (i = 0; i < doublle.size(); i++) {
if (!sumi[doublle[i]]) {
sumi[doublle[i]] = true;
ss += s[doublle[i]];
}
}
i = 0;
j = 0;
if (ss == "") {
ss = s[bottomA[0]];
sumi[bottomA[0]] = true;
j++;
}
while (i < topB.size() && j < bottomA.size()) {
while (sumi[topB[i]] && i < topB.size() - 1)
i++;
while (sumi[bottomA[j]] && j < bottomA.size() - 1)
j++;
if (!sumi[topB[i]]) {
ss += s[topB[i]];
sumi[topB[i]] = true;
}
if (!sumi[bottomA[j]]) {
sumi[bottomA[j]] = true;
ss += s[bottomA[j]];
}
i++;
j++;
}
for (i = 0; i < n; i++) {
if (!sumi[i])
ss += s[i];
}
int ans = 0;
for (i = 0; i < ss.length() - 1; i++) {
if (ss[i] == 'A' && ss[i + 1] == 'B')
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
string ss = "";
vector<bool> sumi(n, false);
vector<int> topB;
vector<int> bottomA;
vector<int> doublle;
int i, j;
int tmp = 0;
int first = -1;
for (i = 0; i < n; i++) {
tmp = 0;
cin >> s[i];
if (s[i][0] == 'B')
tmp += 1;
if (s[i][s[i].length() - 1] == 'A')
tmp += 2;
if (tmp == 1 || tmp == 3)
topB.push_back(i);
if (tmp == 2 || tmp == 3)
bottomA.push_back(i);
if (tmp == 3)
doublle.push_back(i);
if (tmp == 2)
first = i;
}
if (first != -1) {
ss += s[first];
sumi[first] = true;
}
for (i = 0; i < doublle.size(); i++) {
if (!sumi[doublle[i]]) {
sumi[doublle[i]] = true;
ss += s[doublle[i]];
}
}
i = 0;
j = 0;
if (ss == "" && !bottomA.empty()) {
ss = s[bottomA[0]];
sumi[bottomA[0]] = true;
j++;
}
while (i < topB.size() && j < bottomA.size()) {
while (sumi[topB[i]] && i < topB.size() - 1)
i++;
while (sumi[bottomA[j]] && j < bottomA.size() - 1)
j++;
if (!sumi[topB[i]]) {
ss += s[topB[i]];
sumi[topB[i]] = true;
}
if (!sumi[bottomA[j]]) {
sumi[bottomA[j]] = true;
ss += s[bottomA[j]];
}
i++;
j++;
}
for (i = 0; i < n; i++) {
if (!sumi[i])
ss += s[i];
}
int ans = 0;
for (i = 0; i < ss.length() - 1; i++) {
if (ss[i] == 'A' && ss[i + 1] == 'B')
ans++;
}
cout << ans << endl;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) cin >> v[i];
int ab = 0, ba = 0, bx = 0, xa = 0;
for (string s : v) {
rep(i, s.size() - 1) {
if (s.substr(i, 2) == "AB")
ab++;
}
}
for (string s : v) {
if (s.front() == 'B' && s.back() == 'A')
ba++;
else if (s.front() == 'B')
bx++;
else if (s.back() == 'A')
xa++;
}
if (ba == 0) {
int add = min(bx, xa);
cout << add + ab << endl;
} else {
__throw_runtime_error("konai");
}
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) cin >> v[i];
int ab = 0, ba = 0, bx = 0, xa = 0;
for (string s : v) {
rep(i, s.size() - 1) {
if (s.substr(i, 2) == "AB")
ab++;
}
}
for (string s : v) {
if (s.front() == 'B' && s.back() == 'A')
ba++;
else if (s.front() == 'B')
bx++;
else if (s.back() == 'A')
xa++;
}
if (ba == 0) {
int add = min(bx, xa);
cout << add + ab << endl;
} else {
ll c = ba - 1 + ab;
if (xa > 0) {
xa--;
c++;
}
if (bx > 0) {
bx--;
c++;
}
c += min(xa, bx);
cout << c << endl;
}
}
| replace | 71 | 72 | 71 | 83 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < N - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[i][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<string> S(10010);
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
int l = S[i].length();
for (int j = 0; j < l - 1; j++) {
if (S[i][j] == 'A' && S[i][j + 1] == 'B')
ans++;
}
if (S[i][0] == 'B' && S[i][l - 1] == 'A') {
BA++;
} else if (S[i][0] == 'B') {
B++;
} else if (S[i][l - 1] == 'A') {
A++;
}
}
if (BA >= 1) {
ans += BA - 1;
if (A > 0) {
ans++;
A--;
}
if (B > 0) {
ans++;
B--;
}
}
ans += min(A, B);
cout << ans << endl;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ll n;
cin >> n;
ll ans = 0, x = 0, y = 0, z = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s.back() == 'A')
x++;
else if (s[0] == 'B')
y++;
else if (s.back() == 'A')
z++;
}
if (y == 0 && z == 0) {
ans += max(x - 1, 0LL);
} else if (y == z) {
ans += x + y;
} else if (y > z) {
ans += x + min(y, z);
} else if (y < z)
ans += x + min(y, z);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ll n;
cin >> n;
ll ans = 0, x = 0, y = 0, z = 0;
rep(i, n) {
string s;
cin >> s;
rep(i, s.size()) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s.back() == 'A')
x++;
else if (s[0] == 'B')
y++;
else if (s.back() == 'A')
z++;
}
if (y == 0 && z == 0) {
ans += max(x - 1, 0LL);
} else if (y == z) {
ans += x + y;
} else if (y > z) {
ans += x + min(y, z);
} else if (y < z)
ans += x + min(y, z);
cout << ans << endl;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03049 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define rer(i, l, u) for (int(i) = (int)(l); (i) <= (int)(u); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r, v) auto r = (v)
#else
#define aut(r, v) __typeof(v) r = (v)
#endif
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define ktya(x) sort(all(x))
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x, y) make_pair((x), (y))
#define mset(m, v) memset(m, v, sizeof(m))
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define SIZE 200105
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mind(a, b) (a > b ? b : a)
#define maxd(a, b) (a > b ? a : b)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef long long ll;
typedef pair<int, ll> pill;
typedef pair<ll, int> plli;
typedef pair<double, int> pdi;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
typedef complex<double> P;
ll MOD = 1000000007;
// ll MOD=998244353;
typedef ll Weight;
struct Edge {
int src, dst;
Weight weight;
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
ll dp[114514] = {0};
ll sum[114514] = {0};
int N;
ll A, B;
int main() {
cin >> N;
string s[5000];
rep(i, N) cin >> s[i];
int ans = 0;
int x = 0, y = 0, z = 0;
rep(i, N) {
int sz = s[i].size();
rep(j, sz - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] != 'B' && s[i][sz - 1] == 'A')
x++;
if (s[i][0] == 'B' && s[i][sz - 1] != 'A')
y++;
if (s[i][0] == 'B' && s[i][sz - 1] == 'A')
z++;
}
if (z == 0) {
ans += min(x, y);
} else {
ans += z - 1;
if (x > 0) {
x--;
ans++;
}
if (y > 0) {
y--;
ans++;
}
ans += min(x, y);
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define rer(i, l, u) for (int(i) = (int)(l); (i) <= (int)(u); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r, v) auto r = (v)
#else
#define aut(r, v) __typeof(v) r = (v)
#endif
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define ktya(x) sort(all(x))
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x, y) make_pair((x), (y))
#define mset(m, v) memset(m, v, sizeof(m))
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define SIZE 200105
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mind(a, b) (a > b ? b : a)
#define maxd(a, b) (a > b ? a : b)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef long long ll;
typedef pair<int, ll> pill;
typedef pair<ll, int> plli;
typedef pair<double, int> pdi;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
typedef complex<double> P;
ll MOD = 1000000007;
// ll MOD=998244353;
typedef ll Weight;
struct Edge {
int src, dst;
Weight weight;
};
bool operator<(const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src
: e.dst < f.dst;
}
typedef vector<Edge> Edges;
ll dp[114514] = {0};
ll sum[114514] = {0};
int N;
ll A, B;
int main() {
cin >> N;
string s[10005];
rep(i, N) cin >> s[i];
int ans = 0;
int x = 0, y = 0, z = 0;
rep(i, N) {
int sz = s[i].size();
rep(j, sz - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
if (s[i][0] != 'B' && s[i][sz - 1] == 'A')
x++;
if (s[i][0] == 'B' && s[i][sz - 1] != 'A')
y++;
if (s[i][0] == 'B' && s[i][sz - 1] == 'A')
z++;
}
if (z == 0) {
ans += min(x, y);
} else {
ans += z - 1;
if (x > 0) {
x--;
ans++;
}
if (y > 0) {
y--;
ans++;
}
ans += min(x, y);
}
cout << ans << endl;
}
| replace | 88 | 89 | 88 | 89 | 0 | |
p03049 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, cnt = 0;
int a, b, ba;
a = 0;
b = 0;
ba = 0;
string str;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", &str);
int L = str.size();
for (int j = 0; j + 1 < L; j++) {
if (str[j] == 'A' && str[j + 1] == 'B') {
cnt++;
}
}
if (str[0] == 'B')
b++;
if (str[L - 1] == 'A')
a++;
if (str[0] == 'B' && str[L - 1] == 'A')
ba++;
}
cnt += min(a, b);
if (a == ba && b == ba && b > 0)
cnt--;
printf("%d\n", cnt);
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, cnt = 0;
int a, b, ba;
a = 0;
b = 0;
ba = 0;
string str;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> str;
int L = str.size();
for (int j = 0; j + 1 < L; j++) {
if (str[j] == 'A' && str[j + 1] == 'B') {
cnt++;
}
}
if (str[0] == 'B')
b++;
if (str[L - 1] == 'A')
a++;
if (str[0] == 'B' && str[L - 1] == 'A')
ba++;
}
cnt += min(a, b);
if (a == ba && b == ba && b > 0)
cnt--;
printf("%d\n", cnt);
return 0;
} | replace | 15 | 16 | 15 | 16 | -11 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a = 0, b = 0;
int c = 0, d = 0;
int e = 0;
int ans = 0;
REP(i, n) {
string s;
cin >> s;
REP(j, s.size() - 1) {
if (s.substr(j, 2) == "AB") {
ans++;
j++;
}
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
e++;
else if (s[s.size() - 1] == 'A')
a++;
else if (s[0] == 'B')
b++;
}
// cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << e << endl;
ans += max(0, e - 1);
if (e > 0 && a == b) {
assert(n == 0);
cout << ans + a << endl;
return 0;
} else {
if (e == 0)
cout << ans + min(a, b) << endl;
else
cout << ans + min(a, b) + 1 << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a = 0, b = 0;
int c = 0, d = 0;
int e = 0;
int ans = 0;
REP(i, n) {
string s;
cin >> s;
REP(j, s.size() - 1) {
if (s.substr(j, 2) == "AB") {
ans++;
j++;
}
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
e++;
else if (s[s.size() - 1] == 'A')
a++;
else if (s[0] == 'B')
b++;
}
// cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << e << endl;
ans += max(0, e - 1);
if (e > 0 && a == b) {
if (a > 0) {
cout << ans + a + 1 << endl;
} else
cout << ans + a << endl;
return 0;
} else {
if (e == 0)
cout << ans + min(a, b) << endl;
else
cout << ans + min(a, b) + 1 << endl;
return 0;
}
}
| replace | 68 | 70 | 68 | 72 | 0 | |
p03049 | C++ | Runtime Error | #include <array>
#include <iostream>
#include <string>
using namespace std;
int findAndCount(const string s, const string target) {
int cnt = 0;
size_t pos = 0;
while ((pos = s.find(target, pos)) != -1) {
++cnt;
++pos;
}
return cnt;
}
int main() {
int n;
cin >> n;
int i;
array<string, 10> s;
for (i = 0; i < n; ++i) {
cin >> s[i];
}
int nAB = 0;
for (i = 0; i < n; ++i) {
nAB += findAndCount(s[i], "AB");
}
int tailAOnlyCount = 0, headBOnlyCount = 0, tailAHeadBCount = 0;
bool isTailA, isHeadB;
for (i = 0; i < n; ++i) {
isTailA = (s[i].back() == 'A');
isHeadB = (s[i].front() == 'B');
if (isTailA && isHeadB) {
++tailAHeadBCount;
} else if (isTailA) {
++tailAOnlyCount;
} else if (isHeadB) {
++headBOnlyCount;
}
}
int nPairs =
((tailAOnlyCount > headBOnlyCount) ? headBOnlyCount : tailAOnlyCount);
nAB += nPairs;
if (tailAHeadBCount >= 1) {
nAB += (tailAHeadBCount - 1);
if ((tailAOnlyCount != 0) || (headBOnlyCount != 0)) {
nAB += 1;
}
}
cout << nAB << endl;
return 0;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int findAndCount(const string s, const string target) {
int cnt = 0;
size_t pos = 0;
while ((pos = s.find(target, pos)) != -1) {
++cnt;
++pos;
}
return cnt;
}
int main() {
int n;
cin >> n;
int i;
array<string, 10000> s;
for (i = 0; i < n; ++i) {
cin >> s[i];
}
int nAB = 0;
for (i = 0; i < n; ++i) {
nAB += findAndCount(s[i], "AB");
}
int tailAOnlyCount = 0, headBOnlyCount = 0, tailAHeadBCount = 0;
bool isTailA, isHeadB;
for (i = 0; i < n; ++i) {
isTailA = (s[i].back() == 'A');
isHeadB = (s[i].front() == 'B');
if (isTailA && isHeadB) {
++tailAHeadBCount;
} else if (isTailA) {
++tailAOnlyCount;
} else if (isHeadB) {
++headBOnlyCount;
}
}
int nPairs =
((tailAOnlyCount > headBOnlyCount) ? headBOnlyCount : tailAOnlyCount);
nAB += nPairs;
if (tailAHeadBCount >= 1) {
nAB += (tailAHeadBCount - 1);
if ((tailAOnlyCount != 0) || (headBOnlyCount != 0)) {
nAB += 1;
}
}
cout << nAB << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03049 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::string> str(n);
for (int i = 0; i < n; ++i) {
std::cin >> str[i];
}
int ret = 0;
int bx = 0;
int xa = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
if (str[i].front() == 'B' && str[i].back() != 'A') {
bx += 1;
}
if (str[i].front() != 'B' && str[i].back() == 'A') {
xa += 1;
}
if (str[i].front() == 'B' && str[i].back() == 'A') {
ba += 1;
}
for (int j = 0; j < str[i].size() - 1; ++j) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
ret += 1;
}
}
}
// std::cout<<ret;
if (ba >= 2) {
ret += (ba - 1);
}
// std::cout<<ret;
if (ba) {
if (bx) {
ret += 1;
bx -= 1;
}
if (xa) {
ret += 1;
xa -= 1;
}
}
// std::cout<<ret;
if (xa >= bx) {
ret += bx;
} else {
ret += xa;
}
// std::cout<<ret;
return ret;
} | #include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::vector<std::string> str(n);
for (int i = 0; i < n; ++i) {
std::cin >> str[i];
}
int ret = 0;
int bx = 0;
int xa = 0;
int ba = 0;
for (int i = 0; i < n; ++i) {
if (str[i].front() == 'B' && str[i].back() != 'A') {
bx += 1;
}
if (str[i].front() != 'B' && str[i].back() == 'A') {
xa += 1;
}
if (str[i].front() == 'B' && str[i].back() == 'A') {
ba += 1;
}
for (int j = 0; j < str[i].size() - 1; ++j) {
if (str[i][j] == 'A' && str[i][j + 1] == 'B') {
ret += 1;
}
}
}
// std::cout<<ret;
if (ba >= 2) {
ret += (ba - 1);
}
// std::cout<<ret;
if (ba) {
if (bx) {
ret += 1;
bx -= 1;
}
if (xa) {
ret += 1;
xa -= 1;
}
}
// std::cout<<ret;
if (xa >= bx) {
ret += bx;
} else {
ret += xa;
}
std::cout << ret;
return 0;
} | replace | 58 | 61 | 58 | 60 | 2 | |
p03049 | C++ | Runtime Error | /*
[diverta2019] C - AB Substrings
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 1000;
int N;
string s[MAX_N];
ll solve() {
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < (int)s[i].length() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i][0] == 'B') {
if (s[i].back() == 'A') {
c1++;
} else {
c2++;
}
} else if (s[i].back() == 'A') {
c3++;
}
}
if (c1 == 0) {
ans += min(c2, c3);
} else if (c2 + c3 > 0) {
ans += c1 + min(c2, c3);
} else {
ans += c1 - 1;
}
return ans;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
cout << solve() << endl;
return 0;
}
| /*
[diverta2019] C - AB Substrings
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 1e4;
int N;
string s[MAX_N];
ll solve() {
int c1 = 0, c2 = 0, c3 = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < (int)s[i].length() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i][0] == 'B') {
if (s[i].back() == 'A') {
c1++;
} else {
c2++;
}
} else if (s[i].back() == 'A') {
c3++;
}
}
if (c1 == 0) {
ans += min(c2, c3);
} else if (c2 + c3 > 0) {
ans += c1 + min(c2, c3);
} else {
ans += c1 - 1;
}
return ans;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
}
cout << solve() << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03049 | C++ | Runtime Error | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.05.11 20:50:43
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
#define disp(x) cout << #x << ": " << x << endl
#define disp_vec(v) \
cout << #v << ":"; \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl
const int INF = 100000000;
const int M = 100000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/* ------------------------------------- */
int main() {
int n;
string s[11];
cin >> n;
rep(i, n) cin >> s[i];
int afin = 0;
int bsta = 0;
int ba = 0;
int ret = 0;
rep(i, n) {
string st = s[i];
int sl = st.size();
bool isBsta = false;
bool preA = false;
rep(j, sl) {
if (j == 0 && st[j] == 'B') {
bsta++;
isBsta = true;
} else if (j == sl - 1 && st[j] == 'A' && !isBsta) {
afin++;
} else if (j == sl - 1 && st[j] == 'A' && isBsta) {
bsta--;
ba++;
}
if (st[j] == 'A') {
preA = true;
} else if (st[j] == 'B' && preA) {
preA = false;
ret++;
} else {
preA = false;
}
}
}
if (bsta == 0 && afin == 0) {
ret += ba > 0 ? ba - 1 : 0;
} else if (bsta == afin) {
ret += bsta;
ret += ba;
} else if (bsta > afin) {
if (ba + afin >= bsta) {
ret += bsta;
ret += ba + afin - bsta;
} else {
ret += ba + afin;
}
} else if (bsta < afin) {
if (ba + bsta >= afin) {
ret += afin;
ret += ba + bsta - afin;
} else {
ret += ba + bsta;
}
}
cout << ret << '\n';
/* --------------------------------- */
return 0;
} | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.05.11 20:50:43
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
#define disp(x) cout << #x << ": " << x << endl
#define disp_vec(v) \
cout << #v << ":"; \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl
const int INF = 100000000;
const int M = 100000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/* ------------------------------------- */
int main() {
int n;
string s[10010];
cin >> n;
rep(i, n) cin >> s[i];
int afin = 0;
int bsta = 0;
int ba = 0;
int ret = 0;
rep(i, n) {
string st = s[i];
int sl = st.size();
bool isBsta = false;
bool preA = false;
rep(j, sl) {
if (j == 0 && st[j] == 'B') {
bsta++;
isBsta = true;
} else if (j == sl - 1 && st[j] == 'A' && !isBsta) {
afin++;
} else if (j == sl - 1 && st[j] == 'A' && isBsta) {
bsta--;
ba++;
}
if (st[j] == 'A') {
preA = true;
} else if (st[j] == 'B' && preA) {
preA = false;
ret++;
} else {
preA = false;
}
}
}
if (bsta == 0 && afin == 0) {
ret += ba > 0 ? ba - 1 : 0;
} else if (bsta == afin) {
ret += bsta;
ret += ba;
} else if (bsta > afin) {
if (ba + afin >= bsta) {
ret += bsta;
ret += ba + afin - bsta;
} else {
ret += ba + afin;
}
} else if (bsta < afin) {
if (ba + bsta >= afin) {
ret += afin;
ret += ba + bsta - afin;
} else {
ret += ba + bsta;
}
}
cout << ret << '\n';
/* --------------------------------- */
return 0;
} | replace | 54 | 55 | 54 | 55 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, b = 0, a = 0, ba = 0;
cin >> n;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
for (int i = 0; i < n - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
else if (s[s.size() - 1] == 'A')
a++;
else if (s[0] == 'B')
b++;
}
ans += min(a + ba, b + ba);
if (a == 0 && b == 0 && ba > 0)
ans--;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, b = 0, a = 0, ba = 0;
cin >> n;
int ans = 0;
rep(i, n) {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; ++i) {
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
ba++;
else if (s[s.size() - 1] == 'A')
a++;
else if (s[0] == 'B')
b++;
}
ans += min(a + ba, b + ba);
if (a == 0 && b == 0 && ba > 0)
ans--;
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) \
do { \
sort(v, v + n); \
reverse(v, v + n); \
} while (0)
#define all(x) (x).begin(), (x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;
ll POW(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW(x * x, n / 2) % MOD;
return x % MOD * POW(x, n - 1) % MOD;
}
ll POW2(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW2(x * x, n / 2);
return x * POW2(x, n - 1);
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
ll KAI(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI(m - 1) % MOD;
}
ll KAI2(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI2(m - 1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI(m) % MOD * modinv(KAI(n) % MOD * KAI(m - n) % MOD) % MOD;
}
ll COM2(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI2(m) / KAI2(n) / KAI2(m - n);
}
ll DEC(ll x, ll m, ll n) { return x % POW(m, n + 1) / POW(m, n); }
ll keta(ll x, ll n) {
if (x == 0)
return 0;
return keta(x / n, n) + 1;
}
ll DIV(ll x, ll n) {
if (x == 0)
return 0;
return x / n + DIV(x / n, n);
}
ll ORD(ll x, ll n) {
if (x == 0)
return INF;
if (x % n != 0)
return 0;
return 1 + ORD(x / n, n);
}
int main() {
ll n, a = 0, b = 0, ans = 0, c = 0;
string s[15];
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) {
if (s[i][s[i].length() - 1] == 'A')
a++;
if (s[i][0] == 'B')
b++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
}
rep(i, n) {
rep(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
ans += min(a, b);
if (a == c && b == c && c != 0)
ans--;
printf("%lld", ans);
} | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) \
do { \
sort(v, v + n); \
reverse(v, v + n); \
} while (0)
#define all(x) (x).begin(), (x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;
ll POW(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW(x * x, n / 2) % MOD;
return x % MOD * POW(x, n - 1) % MOD;
}
ll POW2(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW2(x * x, n / 2);
return x * POW2(x, n - 1);
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
ll KAI(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI(m - 1) % MOD;
}
ll KAI2(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI2(m - 1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI(m) % MOD * modinv(KAI(n) % MOD * KAI(m - n) % MOD) % MOD;
}
ll COM2(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI2(m) / KAI2(n) / KAI2(m - n);
}
ll DEC(ll x, ll m, ll n) { return x % POW(m, n + 1) / POW(m, n); }
ll keta(ll x, ll n) {
if (x == 0)
return 0;
return keta(x / n, n) + 1;
}
ll DIV(ll x, ll n) {
if (x == 0)
return 0;
return x / n + DIV(x / n, n);
}
ll ORD(ll x, ll n) {
if (x == 0)
return INF;
if (x % n != 0)
return 0;
return 1 + ORD(x / n, n);
}
int main() {
ll n, a = 0, b = 0, ans = 0, c = 0;
string s[12000];
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) {
if (s[i][s[i].length() - 1] == 'A')
a++;
if (s[i][0] == 'B')
b++;
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A')
c++;
}
rep(i, n) {
rep(j, s[i].length() - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
}
}
ans += min(a, b);
if (a == c && b == c && c != 0)
ans--;
printf("%lld", ans);
} | replace | 134 | 135 | 134 | 135 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back(s);
if (x == 'B' && y != 'A')
c.push_back(s);
if (x == 'B' && y == 'A')
d.push_back(s);
}
for (auto v : a)
ans += v;
if (b.size()) {
ans += b[b.size() - 1];
b.pop_back();
}
for (auto v : d)
ans += v;
if (c.size()) {
ans += c[c.size() - 1];
c.pop_back();
}
while (b.size() || c.size()) {
ans += b[b.size() - 1];
b.pop_back();
ans += c[c.size() - 1];
c.pop_back();
}
for (auto v : b)
ans += v;
for (auto v : c)
ans += v;
int tot = 0;
for (int i = 0; i < ans.size() - 1; ++i)
if (ans[i] == 'A' && ans[i + 1] == 'B')
++tot;
cout << tot << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<string> a, b, c, d;
string ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
int x = s[0], y = s[s.size() - 1];
if (x != 'B' && y != 'A')
a.push_back(s);
if (x != 'B' && y == 'A')
b.push_back(s);
if (x == 'B' && y != 'A')
c.push_back(s);
if (x == 'B' && y == 'A')
d.push_back(s);
}
for (auto v : a)
ans += v;
if (b.size()) {
ans += b[b.size() - 1];
b.pop_back();
}
for (auto v : d)
ans += v;
if (c.size()) {
ans += c[c.size() - 1];
c.pop_back();
}
while (b.size() && c.size()) {
ans += b[b.size() - 1];
b.pop_back();
ans += c[c.size() - 1];
c.pop_back();
}
for (auto v : b)
ans += v;
for (auto v : c)
ans += v;
int tot = 0;
for (int i = 0; i < ans.size() - 1; ++i)
if (ans[i] == 'A' && ans[i + 1] == 'B')
++tot;
cout << tot << endl;
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int N{1000}, M{1000000000};
constexpr int di[]{1, -1, 0, 0}, dj[]{0, 0, 1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
array<string, N> s;
// string s, t;
// bool can;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int c_btw = 0;
int fb = 0, ba = 0, fbba = 0;
for (int i = 0; i < n; i++) {
int c_now = 0;
int pos = s[i].find("AB");
while (pos != string::npos) {
pos = s[i].find("AB", pos + 2);
c_now++;
}
c_btw += c_now;
bool front_is_b = s[i].front() == 'B';
bool back_is_a = s[i].back() == 'A';
fb += front_is_b;
ba += back_is_a;
fbba += front_is_b & back_is_a;
}
int c_connect = min(fb, ba);
if (fbba == fb && fbba == ba)
c_connect--;
if (c_connect < 0)
c_connect = 0;
cout << c_btw + c_connect << endl;
// if (can)
// cout << "Yes" << endl;
// else
// cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int N{50000}, M{1000000000};
constexpr int di[]{1, -1, 0, 0}, dj[]{0, 0, 1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
array<string, N> s;
// string s, t;
// bool can;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
int c_btw = 0;
int fb = 0, ba = 0, fbba = 0;
for (int i = 0; i < n; i++) {
int c_now = 0;
int pos = s[i].find("AB");
while (pos != string::npos) {
pos = s[i].find("AB", pos + 2);
c_now++;
}
c_btw += c_now;
bool front_is_b = s[i].front() == 'B';
bool back_is_a = s[i].back() == 'A';
fb += front_is_b;
ba += back_is_a;
fbba += front_is_b & back_is_a;
}
int c_connect = min(fb, ba);
if (fbba == fb && fbba == ba)
c_connect--;
if (c_connect < 0)
c_connect = 0;
cout << c_btw + c_connect << endl;
// if (can)
// cout << "Yes" << endl;
// else
// cout << "No" << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03049 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) std::cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) std::cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r = 0;
int c, s = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
int n = ri();
std::string s[n];
FOR(i, n) std::cin >> s[i];
int first = 0;
int second = 0;
int ryo = 0;
int middle = 0;
FOR(i, n) {
if (s[i][0] == 'B' && s[i].back() == 'A')
ryo++;
else {
if (s[i][0] == 'B')
first++;
if (s[i].back() == 'A')
second++;
}
FOR(j, s[i].size() - 1) if (s[i][j] == 'A' && s[i][j + 1] == 'B') middle++;
}
int res = middle;
// std::cerr << middle << std::endl;
while (ryo) {
res += std::min(ryo, first);
ryo -= std::min(ryo, first);
res += std::min(ryo, second);
ryo -= std::min(ryo, second);
}
if (ryo)
res += ryo - 1;
if (first && second)
res += std::min(first, second);
std::cout << res << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define countof(a) (sizeof(a) / sizeof(*a))
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) std::cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) std::cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r = 0;
int c, s = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
int main() {
int n = ri();
std::string s[n];
FOR(i, n) std::cin >> s[i];
int first = 0;
int second = 0;
int ryo = 0;
int middle = 0;
FOR(i, n) {
if (s[i][0] == 'B' && s[i].back() == 'A')
ryo++;
else {
if (s[i][0] == 'B')
first++;
if (s[i].back() == 'A')
second++;
}
FOR(j, s[i].size() - 1) if (s[i][j] == 'A' && s[i][j + 1] == 'B') middle++;
}
int res = middle;
// std::cerr << middle << std::endl;
while (ryo) {
if (!first && !second)
break;
res += std::min(ryo, first);
ryo -= std::min(ryo, first);
res += std::min(ryo, second);
ryo -= std::min(ryo, second);
}
if (ryo)
res += ryo - 1;
if (first && second)
res += std::min(first, second);
std::cout << res << std::endl;
return 0;
}
| insert | 162 | 162 | 162 | 164 | TLE | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
template <class T, class U>
bool contain(const std::basic_string<T> &s, const U &v) {
return s.find(v) != std::basic_string<T>::npos;
}
// int ans = contain(s, "AB");
int main() {
int n;
cin >> n;
int cnt = 0;
string s[n];
queue<string> aq;
queue<string> bq;
string abq;
string ab;
string str;
int k = 0, b = 0, z = 0;
rep(i, n) {
cin >> s[i];
if (s[i].front() == 'B' && s[i].back() == 'A') {
abq += s[i];
k++;
} else if (s[i].front() == 'B') {
bq.push(s[i]);
b++;
} else if (s[i].back() == 'A') {
aq.push(s[i]);
z++;
} else
str += s[i];
}
if (b == z) {
abq = aq.front() += abq;
abq += bq.front();
aq.pop();
bq.pop();
}
while (!aq.empty() && !bq.empty()) {
ab += (aq.front() + bq.front());
aq.pop();
bq.pop();
}
if (!aq.empty()) {
while (!aq.empty()) {
abq = aq.front() += abq;
aq.pop();
}
}
if (!bq.empty()) {
while (!bq.empty()) {
abq += bq.front();
bq.pop();
}
}
string ans = abq + ab + str;
rep(i, ans.size()) {
if (ans.substr(i, 2) == "AB")
cnt++;
}
// cout << k << endl;
// cout << b << endl;
// cout << z << endl;
cout << cnt << endl;
return (0);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
template <class T, class U>
bool contain(const std::basic_string<T> &s, const U &v) {
return s.find(v) != std::basic_string<T>::npos;
}
// int ans = contain(s, "AB");
int main() {
int n;
cin >> n;
int cnt = 0;
string s[n];
queue<string> aq;
queue<string> bq;
string abq;
string ab;
string str;
int k = 0, b = 0, z = 0;
rep(i, n) {
cin >> s[i];
if (s[i].front() == 'B' && s[i].back() == 'A') {
abq += s[i];
k++;
} else if (s[i].front() == 'B') {
bq.push(s[i]);
b++;
} else if (s[i].back() == 'A') {
aq.push(s[i]);
z++;
} else
str += s[i];
}
if (b == z) {
if (!bq.empty() && !aq.empty()) {
abq = aq.front() += abq;
abq += bq.front();
aq.pop();
bq.pop();
}
}
while (!aq.empty() && !bq.empty()) {
ab += (aq.front() + bq.front());
aq.pop();
bq.pop();
}
if (!aq.empty()) {
while (!aq.empty()) {
abq = aq.front() += abq;
aq.pop();
}
}
if (!bq.empty()) {
while (!bq.empty()) {
abq += bq.front();
bq.pop();
}
}
string ans = abq + ab + str;
rep(i, ans.size()) {
if (ans.substr(i, 2) == "AB")
cnt++;
}
// cout << k << endl;
// cout << b << endl;
// cout << z << endl;
cout << cnt << endl;
return (0);
}
| replace | 40 | 44 | 40 | 46 | 0 | |
p03049 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> Q;
int n, ans, l, r, p;
string s[1010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A') {
p++;
} else if (s[i][0] == 'B') {
l++;
} else if (s[i][s[i].length() - 1] == 'A') {
r++;
}
}
ans += max(p - 1, 0);
if (p == 0) {
ans += min(r, l);
} else {
if (r > 0) {
r--;
ans++;
}
if (l > 0) {
l--;
ans++;
}
ans += max(min(r, l), 0);
}
cout << ans << endl;
cin >> n;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> Q;
int n, ans, l, r, p;
string s[10010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length() - 1; j++) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') {
ans++;
}
}
if (s[i][0] == 'B' && s[i][s[i].length() - 1] == 'A') {
p++;
} else if (s[i][0] == 'B') {
l++;
} else if (s[i][s[i].length() - 1] == 'A') {
r++;
}
}
ans += max(p - 1, 0);
if (p == 0) {
ans += min(r, l);
} else {
if (r > 0) {
r--;
ans++;
}
if (l > 0) {
l--;
ans++;
}
ans += max(min(r, l), 0);
}
cout << ans << endl;
cin >> n;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03049 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a = 0; // ooooA
int b = 0; // Boooo
int c = 0; // BoooA
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int ss = s.size() - 1;
if (s[0] == 'B' and s[ss] == 'A')
c++;
else if (s[0] == 'B')
b++;
else if (s[ss] == 'A')
a++;
for (int j = 0; j < n - 1; j++) {
if (s[j] == 'A' and s[j + 1] == 'B') {
ans++;
}
}
}
if (c == 0)
ans += min(a, b);
else if (a == 0 and b == 0 and c > 0)
ans += c - 1;
else
ans += c + min(a, b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a = 0; // ooooA
int b = 0; // Boooo
int c = 0; // BoooA
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int ss = s.size() - 1;
if (s[0] == 'B' and s[ss] == 'A')
c++;
else if (s[0] == 'B')
b++;
else if (s[ss] == 'A')
a++;
for (int j = 0; j < s.size(); j++) {
if (s[j] == 'A' and s[j + 1] == 'B') {
ans++;
}
}
}
if (c == 0)
ans += min(a, b);
else if (a == 0 and b == 0 and c > 0)
ans += c - 1;
else
ans += c + min(a, b);
cout << ans << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03049 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
string s[10010];
void solve() {
int a = 0;
int b = 0;
int ab = 0;
int abNum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length(); j++) {
if (s[i].substr(j, 2) == "AB") {
abNum++;
}
}
if (s[i].back() == 'A') {
if (s[i][0] == 'B')
ab++;
else
a++;
} else if (s[i][0] == 'B')
b++;
}
int tmp;
while (ab > 0) {
tmp = min(a, ab);
abNum += tmp;
ab -= tmp;
tmp = min(b, ab);
abNum += tmp;
ab -= tmp;
}
tmp = min(a, b);
abNum += tmp;
a -= tmp;
b -= tmp;
cout << abNum << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define eb emplace_back
#define fst first
#define scd second
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// value
int N;
string s[10010];
void solve() {
int a = 0;
int b = 0;
int ab = 0;
int abNum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length(); j++) {
if (s[i].substr(j, 2) == "AB") {
abNum++;
}
}
if (s[i].back() == 'A') {
if (s[i][0] == 'B')
ab++;
else
a++;
} else if (s[i][0] == 'B')
b++;
}
int tmp;
tmp = min(a, ab);
abNum += tmp;
ab -= tmp;
tmp = min(b, ab);
abNum += tmp;
ab -= tmp;
if (ab > 0) {
abNum += ab - 1;
ab = 1;
if (a > 0 || b > 0) {
abNum++;
ab = 0;
}
}
tmp = min(a, b);
abNum += tmp;
a -= tmp;
b -= tmp;
cout << abNum << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | replace | 68 | 75 | 68 | 82 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int64_t N;
cin >> N;
int64_t sum = 0;
for (int64_t i = 1; i * i <= N; i++) {
int64_t r = N / i;
if (N % (r - 1) == N / (r - 1)) {
sum += r - 1;
}
if (i - 1 > 0 && N % (i - 1) == N / (i - 1)) {
sum += i - 1;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int64_t N;
cin >> N;
int64_t sum = 0;
for (int64_t i = 1; i * i <= N; i++) {
int64_t r = N / i;
if (r - 1 > 0 && N % (r - 1) == N / (r - 1)) {
sum += r - 1;
}
if (i - 1 > 0 && N % (i - 1) == N / (i - 1)) {
sum += i - 1;
}
}
cout << sum << endl;
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
int main() {
// freopen("input.txt","r",stdin);
scanf("%lld", &n);
long long to = sqrt(n);
while ((to + 1) * (to + 1) <= n)
to++;
for (int i = 1; i <= to; i++)
if ((n - i) % i == 0 && n % ((n - i) / i) == i)
ans += (n - i) / i;
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
int main() {
// freopen("input.txt","r",stdin);
scanf("%lld", &n);
long long to = sqrt(n);
while ((to + 1) * (to + 1) <= n)
to++;
for (int i = 1; i <= to; i++)
if ((n - i) / i > 0 && (n - i) % i == 0 && n % ((n - i) / i) == i)
ans += (n - i) / i;
printf("%lld\n", ans);
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yes(ans) \
if (ans) \
printf("yes\n"); \
else \
printf("no\n")
#define Yes(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YES(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
LL(n);
ll ans = 0, d;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
d = (n / i) - 1;
if (n / d == n % d) {
ans += d;
}
}
}
out(ans);
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yes(ans) \
if (ans) \
printf("yes\n"); \
else \
printf("no\n")
#define Yes(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YES(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
LL(n);
ll ans = 0, d;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
d = (n / i) - 1;
if (d != 0 && n / d == n % d) {
ans += d;
}
}
}
out(ans);
} | replace | 129 | 130 | 129 | 130 | 0 | |
p03050 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, r, b;
ll guessm(ll m) {
if (n % m != n / m)
return 0;
return m;
}
int main() {
cin >> n;
r = 0;
b = (ll)sqrt(n);
for (ll i = 2; i <= b; i++) {
if (n % i == 0) {
r += guessm(i - 1);
r += guessm(n / i - 1);
}
}
r += guessm(n - 1);
if (b * b == n)
r -= guessm(b - 1);
cout << r << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, r, b;
ll guessm(ll m) {
if (m == 0)
return 0;
if (n % m != n / m)
return 0;
return m;
}
int main() {
cin >> n;
r = 0;
b = (ll)sqrt(n);
for (ll i = 2; i <= b; i++) {
if (n % i == 0) {
r += guessm(i - 1);
r += guessm(n / i - 1);
}
}
r += guessm(n - 1);
if (b * b == n)
r -= guessm(b - 1);
cout << r << endl;
} | insert | 6 | 6 | 6 | 8 | 0 | |
p03050 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n;
for (i = 1; i <= (ll)sqrt(n); i++) {
if (n % i != 0)
continue;
m = n / i - 1;
if (n / m == n % m)
ans += m;
// if (i<n/3) break;
}
cout << ans << endl;
return 0;
}
| // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n;
for (i = 1; i <= (ll)sqrt(n); i++) {
if (n % i != 0)
continue;
m = n / i - 1;
if (m == 0)
continue;
if (n / m == n % m)
ans += m;
// if (i<n/3) break;
}
cout << ans << endl;
return 0;
}
| insert | 16 | 16 | 16 | 18 | 0 | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define MEM(x, y) memset(x, y, sizeof(x))
#define MOD(x) ((x) % mod)
#define mod 1000000007
#define pb push_back
#define STREAM_FAST ios::sync_with_stdio(false)
using namespace std;
int main() {
LL n;
scanf("%lld", &n);
LL ans = 0;
for (LL x = 1; x <= sqrt(n + 0.5); x++) {
LL m = n / x - 1;
if ((n / m) == (n % m))
ans += m;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
#define MEM(x, y) memset(x, y, sizeof(x))
#define MOD(x) ((x) % mod)
#define mod 1000000007
#define pb push_back
#define STREAM_FAST ios::sync_with_stdio(false)
using namespace std;
int main() {
LL n;
scanf("%lld", &n);
LL ans = 0;
for (LL x = 1; x <= sqrt(n + 0.5); x++) {
LL m = n / x - 1;
if (m == 0)
continue;
if ((n / m) == (n % m))
ans += m;
}
printf("%lld\n", ans);
return 0;
}
| insert | 15 | 15 | 15 | 17 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define mt(a, b, c) make_tuple((a), (b), (c))
typedef long long ll;
int main() {
long long int ans = 0;
long long int n;
cin >> n;
for (long long int i = 0; n >= (i * i); i++) {
if (n % (i + 1) == 0) {
long long int t = (n / (i + 1)) - 1;
if (n / t == (n % t))
ans = ans + t;
if (i != 0 && n / i == (n % i))
ans = ans + i;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define mt(a, b, c) make_tuple((a), (b), (c))
typedef long long ll;
int main() {
long long int ans = 0;
long long int n;
cin >> n;
if (n == 1 || n == 2) {
cout << 0 << endl;
return 0;
}
for (long long int i = 0; n >= (i * i); i++) {
if (n % (i + 1) == 0) {
long long int t = (n / (i + 1)) - 1;
if (n / t == (n % t))
ans = ans + t;
if (i != 0 && n / i == (n % i))
ans = ans + i;
}
}
cout << ans << endl;
return 0;
} | insert | 35 | 35 | 35 | 39 | 0 | |
p03050 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
long N;
cin >> N;
double n = sqrt(N);
// long nup = n;
long ans = 0;
long k = N;
long i = 1;
while (k > n && i < N) {
if ((N - i) % i == 0) {
k = (N - i) / i;
if (k > n) {
ans += (N - i) / i;
// cout << "ans = " << ans << endl;
}
}
i++;
}
cout << ans << endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
long N;
cin >> N;
double n = sqrt(N);
// long nup = n;
long ans = 0;
long k = N;
long i = 1;
while (k > n && i < N) {
k = (N - i) / i;
if ((N - i) % i == 0 && k > n) {
ans += k;
}
i++;
}
cout << ans << endl;
return 0;
} | replace | 17 | 23 | 17 | 20 | TLE | |
p03050 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define lb(s, x) (lower_bound(all(s), x) - s.begin())
#define ub(s, x) (upper_bound(all(s), x) - s.begin())
#define uniq(a) a.erase(unique(all(a)), a.end())
#define bit(k) (1LL << (k))
const int INF = 1e9;
#define debug(x) cerr << (#x) << ": " << (x) << endl
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
o << "(" << p.first << ", " << p.second << ")";
return o;
}
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
int main(void) {
ll n;
cin >> n;
ll r = sqrt(n);
ll sum = 0;
for (ll y = 1; y <= r; y++) {
if (n % y != 0)
continue;
ll x = (n / y) - 1;
if (n % x == y) {
sum += x;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define lb(s, x) (lower_bound(all(s), x) - s.begin())
#define ub(s, x) (upper_bound(all(s), x) - s.begin())
#define uniq(a) a.erase(unique(all(a)), a.end())
#define bit(k) (1LL << (k))
const int INF = 1e9;
#define debug(x) cerr << (#x) << ": " << (x) << endl
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
o << "(" << p.first << ", " << p.second << ")";
return o;
}
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
int main(void) {
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
ll r = sqrt(n);
ll sum = 0;
for (ll y = 1; y <= r; y++) {
if (n % y != 0)
continue;
ll x = (n / y) - 1;
if (n % x == y) {
sum += x;
}
}
cout << sum << endl;
return 0;
}
| insert | 29 | 29 | 29 | 33 | 0 | |
p03050 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long N;
long long ans = 0;
int main() {
cin >> N;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
long long cand = (N - i) / i;
if (N % cand == N / cand)
ans += cand;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long N;
long long ans = 0;
int main() {
cin >> N;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
long long cand = (N - i) / i;
if (cand == 0)
continue;
if (N % cand == N / cand)
ans += cand;
}
}
cout << ans << endl;
return 0;
} | insert | 15 | 15 | 15 | 17 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.