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 <... | #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 <=... | #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) {
... | 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 ==... | #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) {
... | 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_s... | #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_s... | 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 * ... | #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", an... | 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++)... | #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+... | 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() {
... | #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() {
... | 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 < ... | #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++;
}... | 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, ... | #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, ... | 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 ... | #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 ... | 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.begi... | #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.begi... | 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... | #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... | 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++;
}
}
}
... | #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... | #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... | 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;
... | #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;
}
}
... | 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 <= ... | #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 <= ... | 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... | /*
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 =... | 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;
... | #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;
... | 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)
#d... | #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)
#d... | 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 ... | #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) \
... | #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) \
... | 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)
#... | #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)
#... | 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 ... | #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++;
}
}
... | 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++;
}
}
... | #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)... | #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)... | 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) {
... | #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... | 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
#d... | #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
#d... | 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... | #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;
}
}
}
... | 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 >... | // 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 >... | 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,... | #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,... | 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++;
}
... | #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++;
}
}
... | 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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int cnt = 0;
for (int r = 0; r <= 3000; r++) {
for (int g = 0; g <= 3000; g++) {
if (R * r + G * g <= N && (N - R * r - G * g) % B == 0) {
cnt++;
}
}
}
cout << cnt << endl;
retu... | 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 <<... | #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, ... | // 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, ... | 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;
... | #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;
... | 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) fo... | /**
* 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) fo... | 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 H... | #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 H... | 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;
}
... | #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;
}
... | 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>>
#de... | #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>>
#de... | 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... | #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... | 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 (... | #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)
an... | 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 *... | #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++;
}
}
}
co... | #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 << " " <<... | 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 << coun... | #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++;... | #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;
f... | #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;
f... | 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;
... | #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 << c... | 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... | #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++;
}
... | 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)
... | #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 * ... | #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 /... | #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 /... | 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))
#de... | #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))
#de... | 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 <ut... | #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 <ut... | 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 +... | #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++;
... | 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
#defi... | #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
#defi... | 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 ... | #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 ... | 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 ar... | #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 ar... | 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()
#defin... | #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()
#defin... | 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)
... | #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::... | 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 (... | #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 << e... | 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 ... | #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) {... | 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++;
... | #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++;
}
}... | 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 =... | #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 << ... | 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++;
... | #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 +... | #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 * ... | 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) {
... | #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))... | 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... | #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",... | #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 ... | #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 ... | 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) {... | #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;
retu... | 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];... | #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];... | 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); ++... | #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); ++... | 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')
... | #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')
... | 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;
r... | #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;
r... | 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 ... | #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 ... | 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... | #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] == ... | 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... | #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... | 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... | #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... | 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' && ... | #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' && ... | 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... | /*
[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 ... | 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;
typed... | /**
* @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;
typed... | 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; +... | #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()... | 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) ... | #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) ... | 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... | #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... | 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 < ... | #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 <... | 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) ... | #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) ... | 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::basi... | #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::basi... | 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; ... | #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;... | 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... | #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... | 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... | #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... | 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 = 1000... | #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 = 1000... | 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;
pr... | #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 +... | 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("... | #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("... | 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... | #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);... | 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;
... | // #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;
... | 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)... | #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)... | 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 al... | #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 al... | 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 -... | #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++;
... | 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())
#d... | #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())
#d... | 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 +... | #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;
... | 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.