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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, blue, red, anadir;
cin >> N >> blue >> red;
if (N % (blue + red) <= blue)
anadir = N % (blue + red);
else
anadir = blue;
cout << ((N / (blue + red)) * blue) + anadir;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, blue, red, anadir;
cin >> N >> blue >> red;
if (N % (blue + red) <= blue)
anadir = N % (blue + red);
else
anadir = blue;
cout << ((N / (blue + red)) * blue) + anadir;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
int A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t N;
int64_t A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a + min(a, n % (a + b));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n, a, b;
unsigned long long ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a + min(a, n % (a + b));
cout << ans << endl;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
//... | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
//... | replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
long long n, a, b;
cin >> n >> a >> b;
string ans;
for (int i = 0; i < n; i++) {
if (ans.length() <= n) {
ans += string(a, 'b');
ans += string(b, 'r');
}
}
long long cnt = 0;
sort(ans.rbegin(), ans.r... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
long long n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | replace | 6 | 22 | 6 | 7 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPR(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define FORR(i, m, n) for (int i = (int)m - 1; i >= (int)n; i--)
#define ASC(v) sort(v.begin(), v.end());
#... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPR(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define FORR(i, m, n) for (int i = (int)m - 1; i >= (int)n; i--)
#define ASC(v) sort(v.begin(), v.end());
#... | replace | 28 | 46 | 28 | 32 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + (N % (A + B)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + (N % (A + B)) << endl;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b = 0;
int shou, amari = 0;
cin >> n >> a >> b;
shou = n / (a + b);
amari = n % (a + b);
if (amari <= a) {
cout << shou * a + amari;
} else {
cout << shou * a + a;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b = 0;
long shou, amari = 0;
cin >> n >> a >> b;
shou = n / (a + b);
amari = n % (a + b);
if (amari <= a) {
cout << shou * a + amari;
} else {
cout << shou * a + a;
}
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long aa = (N / (A + B)) * A;
long long rest = N - (aa / A) * (A + B);
if (rest >= A)
aa += A;
else
aa += rest;
cout << aa << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (A > 0) {
long long aa = (N / (A + B)) * A;
long long rest = N - (aa / A) * (A + B);
if (rest >= A)
aa += A;
else
aa += rest;
cout << aa << endl;
} else
cout << 0 << endl;
}
| replace | 6 | 13 | 6 | 16 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define int long long int
#define MOD 1000000007
#define mkp make_pair
#define maxN 100005
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << '... | #include <bits/stdc++.h>
#define ll long long
#define int long long int
#define MOD 1000000007
#define mkp make_pair
#define maxN 100005
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << '... | delete | 73 | 76 | 73 | 73 | 0 | Time elapsed: 0.026138 s.
|
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll i, j, n, b, r, c = 0;
cin >> n >> b >> r;
l1:
ll val = n / (b + r);
c += val * b;
ll val2 = n % (b + r);
if (val2 <= b)
c += val2;
else {
n = val2;
goto l1;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll i, j, n, b, r, c = 0;
cin >> n >> b >> r;
l1:
ll val = n / (b + r);
c = val * (b + r);
ll val2 = n - c;
if (val2 > b)
val2 = b;
cout << val * b + val2;
} | replace | 8 | 17 | 8 | 13 | TLE | |
p02754 | C++ | Time Limit Exceeded | /*
* atcoder/abc158/b.cpp
*/
// C++ 14
#include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define Int ll
#define loop(__x, __st... | /*
* atcoder/abc158/b.cpp
*/
// C++ 14
#include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define Int ll
#define loop(__x, __st... | replace | 118 | 135 | 118 | 123 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, red, blue, ans, rem;
cin >> n >> blue >> red;
ans = n / (red + blue) * blue;
rem = n % (red + blue);
ans += min(rem, blue);
cout << ans;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, red, blue, ans, rem;
cin >> n >> blue >> red;
ans = n / (red + blue) * blue;
rem = n % (red + blue);
ans += min(rem, blue);
cout << ans;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define FOR(x, z, y) for (ll x = z; x < (ll)y; x++)
int main() {
int n, a, b, blue = 0;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define FOR(x, z, y) for (ll x = z; x < (ll)y; x++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, X, Y, ans;
cin >> N >> A >> B;
X = N / (A + B);
Y = N % (A + B);
if (Y > A) {
ans = A * X + A;
} else {
ans = A * X + Y;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, X, Y, ans;
cin >> N >> A >> B;
X = N / (A + B);
Y = N % (A + B);
if (Y > A) {
ans = A * X + A;
} else {
ans = A * X + Y;
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using p... | replace | 532 | 545 | 532 | 539 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ちゃんと考えてわかって実装 */
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
int ans = 0;
int ttl = 0;
while (ttl <= n) {
if (ttl + a > n) {
ans += (n - ttl);
} else {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ちゃんと考えてわかって実装 */
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
ll block = n / (a + b);
ll amari = n % (a + b);
ll ans = block * a + min(amari, a);
cout << ans << endl... | replace | 11 | 22 | 11 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
... | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
... | replace | 21 | 31 | 21 | 29 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j... | replace | 20 | 34 | 20 | 26 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a, b;
int cnt;
int rem;
cin >> n >> a >> b;
cnt = 0;
cnt += (n / (a + b)) * a;
rem = n % (a + b);
cnt += min(rem, a);
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
long long a, b;
long long cnt;
long long rem;
cin >> n >> a >> b;
cnt = 0;
cnt += (n / (a + b)) * a;
rem = n % (a + b);
cnt += min(rem, a);
cout << cnt << endl;
return 0;
}
| replace | 3 | 8 | 3 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + N % (A + B) << endl;
}
}
// int型の2次元配列(3×4要素の)の宣言
// vector<vector<int>> data(3, vector<int>(4));
// 入力 (2重ル... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + N % (A + B) << endl;
}
}
// int型の2次元配列(3×4要素の)の宣言
// vector<vector<int>> data(3, vector<int>(4));
// 入力 ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int main() {
int n, a, b;
std::cin >> n >> a >> b;
std::cout << (n / (a + b)) * a + std::min(a, n % (a + b));
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
long long n, a, b;
std::cin >> n >> a >> b;
std::cout << (n / (a + b)) * a + std::min(a, n % (a + b));
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid ((l + r) >> 1)
#define ll long long
using namespace std;
int main() {
int n, a, b;
int ans;
cin >> n >> a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid ((l + r) >> 1)
#define ll long long
using namespace std;
int main() {
long long n, a, b;
long long ans;
c... | replace | 15 | 17 | 15 | 17 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ull n, a, b;
cin >> n >> a >> b;
if (a + b == 0)
cout << 0 << '\n';
else {
ull s = n % (a + b);
ull r = n - s;
r /= (a + b);
r *= a;
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ull n, a, b;
cin >> n >> a >> b;
ull s = n % (a + b);
ull r = ((n - s) / (a + b)) * a;
r += (s <= a ? s : a);
cout << r << '\n';
return 0;
} | replace | 9 | 20 | 9 | 13 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
int index = 1;
ll ans = 0;
while (n > 0) {
// add blue ball
if (index % 2 == 1) {
if (n > a) {
n = n - a;
ans += a;
} else {
ans += n;
n = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = n / (a + b) * a;
ll remainder = n % (a + b);
if (remainder >= a)
ans += a;
else
ans += remainder;
cout << ans;
} | replace | 7 | 25 | 7 | 13 | TLE | |
p02754 | C++ | Runtime Error | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 1LL <<... | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 1LL <<... | replace | 134 | 135 | 134 | 143 | 0 | Time elapsed: 26 ms
|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, ans;
cin >> n >> a >> b;
if (n % (a + b) <= a)
ans = a * (n / (a + b)) + n % (a + b);
else
ans = a * (n / (a + b)) + a;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, ans;
cin >> n >> a >> b;
if (n % (a + b) <= a)
ans = a * (n / (a + b)) + n % (a + b);
else
ans = a * (n / (a + b)) + a;
cout << ans;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#defin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#defin... | replace | 17 | 19 | 17 | 18 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<char> balls;
int i, j, k;
for (i = 0; i < n;) {
for (j = 0; j < a; ++j) {
balls.push_back('b');
i++;
}
for (k = 0; k < b; ++k) {
balls.push_back('r');
i++;
}
}
int an... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long x = N / (A + B);
long r = N % (A + B);
long ans = A * x;
if (A <= r) {
ans += A;
} else {
ans += r;
}
cout << ans << endl;
} | replace | 4 | 24 | 4 | 13 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned int N, div, rem;
unsigned int A, B, ans;
cin >> N >> A >> B;
div = N / (A + B);
rem = N % (A + B);
if (rem < A) {
ans = A * div + rem;
} else {
ans = A * div + A;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned long N, div, rem;
unsigned long A, B, ans;
cin >> N >> A >> B;
div = N / (A + B);
rem = N % (A + B);
if (rem < A) {
ans = A * div + rem;
} else {
ans = A * div + A;
}
cout << ans << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
ll A, B;
cin >> N >> A >> B;
ll x, y;
x = N / (A + B) * A;
y = N % (A + B);
ll cnt = x;
if (y > 0) {
for (ll i = 0; i < y; i++) {
if (i < A)
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
ll A, B;
cin >> N >> A >> B;
ll x, y;
x = N / (A + B) * A;
y = N % (A + B);
ll cnt = x;
if (y > 0) {
if (y > A)
cnt += A;
else
cnt += y;
}
cout << cnt << endl;
return 0;
}
| replace | 15 | 19 | 15 | 19 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) < A) {
cout << (N / (A + B)) * A + N % (A + B) << endl;
} else {
cout << (N / (A + B)) * A + A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) < A) {
cout << (N / (A + B)) * A + N % (A + B) << endl;
} else {
cout << (N / (A + B)) * A + A << endl;
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
int main() {
#ifndef ONLINE_J... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
int main() {
// #ifndef ONL... | replace | 9 | 13 | 9 | 13 | 0 |
Time elapsed: 0.029013 s.
|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << a / (b + c) * b + min(a % (b + c), b);
} | #include <bits/stdc++.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
cout << a / (b + c) * b + min(a % (b + c), b);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #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 = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()... | #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 = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()... | replace | 21 | 22 | 21 | 22 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll cnt = 0;
while (n > (a + b)) {
n -= a;
n -= b;
cnt++;
}
ll ans = 0;
if (n - a > 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll cnt = 0;
cnt = n / (a + b);
n -= cnt * (a + b);
ll ans = 0;
if (n - a > 0) {
ans = cnt * a + a;
... | replace | 13 | 18 | 13 | 15 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | replace | 24 | 40 | 24 | 29 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
int set;
set = n / (a + b);
ans += set * a;
ans += min(n - set * (a + b), a);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
int set;
set = n / (a + b);
ans += set * a;
ans += min(n - set * (a + b), a);
cout << ans << endl;
}
| replace | 2 | 3 | 2 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | replace | 71 | 79 | 71 | 74 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, A, B, C, D, E, F;
cin >> N >> A >> B;
C = (A + B);
... | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
long long int N, A, B, C, D, E, F;
cin >> N >> A >> B;
C = ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | replace | 15 | 16 | 15 | 16 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll w = N / (A + B);
ll x = w * A;
ll rem = N % (w * (A + B));
rem = rem < A ? rem : A;
cout << x... | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll w = N / (A + B);
ll x = w * A;
ll rem = min(A, N % (A + B));
cout << x + rem << endl;
}
| replace | 13 | 15 | 13 | 14 | 0 | |
p02754 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int n, a, b;
void solve() {
if (n % (a + b) > a) {
cout << n / (a + b) * a + a << endl;
} else {
cout << n / (a + b) * a + n % (a + b) << endl;
}
}
int main() {
cin >> n >> a >> b;
solve();
} | #include "bits/stdc++.h"
using namespace std;
long long n, a, b;
void solve() {
if (n % (a + b) > a) {
cout << n / (a + b) * a + a << endl;
} else {
cout << n / (a + b) * a + n % (a + b) << endl;
}
}
int main() {
cin >> n >> a >> b;
solve();
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int i = 0, j = 0, ans = 0;
int n, a, b;
cin >> n >> a >> b;
j = n / (a + b);
ans = a * j;
for (i = 1; i <= a; i++) {
if ((a + b) * j + i <= n)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int i = 0, j = 0, ans = 0;
int n, a, b;
cin >> n >> a >> b;
j = n / (a + b);
ans = a * j;
if (a + (a + b) * j <= n)
ans += a;
else
ans += n - (a + b) * j;
cout << ans << endl;
return 0;
} | replace | 13 | 17 | 13 | 18 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
if (n - (a + b) * c >= a) {
d = a * (c + 1);
} else {
d = a * c + n - c * (a + b);
}
cout << d << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
if (n - (a + b) * c >= a) {
d = a * (c + 1);
} else {
d = a * c + n - c * (a + b);
}
cout << d << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
int bc = 0;
long long i = 0;
while (i < n) {
for (int d = 0; d < a; d++) {
if (i < n) {
bc += 1;
i++;
} else {
cout << bc << endl;
return 0;
}
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long p = a + b;
long long w = n / p;
long long m = n % p;
long long x = a < m ? a : m;
cout << (w * a + x) << endl;
return 0;
}
| replace | 7 | 29 | 7 | 13 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START \
cin.tie(0); ... | replace | 39 | 41 | 39 | 40 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long blue;
blue = N / (A + B) * A;
for (long i = 0; i < N % (A + B); ++i) {
if (i < A)
blue += 1;
}
cout << blue << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long blue;
blue = N / (A + B) * A;
if (N % (A + B) >= A) {
blue += A;
} else if (N % (A + B) < A) {
blue += N % (A + B);
}
cout << blue << endl;
return 0;
} | replace | 8 | 11 | 8 | 12 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
vector<bool> line;
while (line.size() < N) {
for (int j = 0; j < A; j++) {
line.push_back(true);
}
for (int j = 0; j < B; j++) {
line.push_back(false);
}
}
int cnt = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 6 | 21 | 6 | 7 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
ll total = 0;
ll ans = 0;
bool isBlue = true;
while (n > total) {
if (isBlue) {
total += a;
ans += a;
isBlue = false;
} else {
total += b;
isBlue = true;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(a, n % (a + b)) << endl;
} | replace | 6 | 22 | 6 | 7 | TLE | |
p02754 | 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 rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | replace | 86 | 90 | 86 | 87 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, r, ans, rem;
cin >> a >> b >> r;
ans = a / (b + r) * b;
rem = a % (b + r);
ans += min(rem, b);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int a, b, r, ans, rem;
cin >> a >> b >> r;
ans = a / (b + r) * b;
rem = a % (b + r);
ans += min(rem, b);
cout << ans << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, t, s, ans;
bool can;
can = false;
// string S,A;
cin >> N >> A >> B;
t = N / (A + B);
s = N - (A + B) * t;
ans = t * A;
if (s > A)
ans += A;
else
ans += s;
cout << ans << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long N, A, B, t, s, ans;
bool can;
can = false;
// string S,A;
cin >> N >> A >> B;
t = N / (A + B);
s = N - (A + B) * t;
ans = t * A;
if (s > A)
ans += A;
else
ans += s;
cout << ans << endl;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, o;
cin >> n >> a >> b;
o = n / (a + b) * a;
if (n % (a + b) > a) {
o = o + a;
} else {
o = o + (n % (a + b));
}
cout << o << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, o;
cin >> n >> a >> b;
o = n / (a + b) * a;
if (n % (a + b) > a) {
o = o + a;
} else {
o = o + (n % (a + b));
}
cout << o << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, x;
cin >> N >> A >> B;
x = N / (A + B) * A;
if (N % (A + B) > A)
x += A;
else
x += N % (A + B);
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, x;
cin >> N >> A >> B;
x = N / (A + B) * A;
if (N % (A + B) > A)
x += A;
else
x += N % (A + B);
cout << x << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int N, A, B, Z, count, D, sum, Q;
int main() {
cin >> N >> A >> B;
::sum = A + B;
D = N / ::sum;
::count += D * A;
Z += D * ::sum;
Q = N - Z;
if (Q <= A) {
::count += Q;
} else {
::coun... | #include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
long int N, A, B, Z, count, D, sum, Q;
int main() {
cin >> N >> A >> B;
::sum = A + B;
D = N / ::sum;
::count += D * A;
Z += D * ::sum;
Q = N - Z;
if (Q <= A) {
::count += Q;
} else {
:... | replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | replace | 25 | 26 | 25 | 26 | 0 | |
p02754 | C++ | Time Limit Exceeded | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimi... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimi... | replace | 32 | 45 | 32 | 33 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <string> //文字列
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) // REPが0の時
#define ll long long int
using namespace std;
double PI... | #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <string> //文字列
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) // REPが0の時
#define ll long long int
using namespace std;
double PI... | replace | 34 | 35 | 34 | 36 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) == 0)
cout << N / (A + B) * A << endl;
else
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) == 0)
cout << N / (A + B) * A << endl;
else
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | replace | 32 | 51 | 32 | 39 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
long long N, A, B;
int main() {
#define LOCAL
#ifdef LOCAL
freopen("in.tx... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
long long N, A, B;
int main() {
// #define LOCAL
#ifdef LOCAL
freopen("in... | replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz... | replace | 62 | 71 | 62 | 65 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, a, b;
cin >> n >> a >> b;
int sum = a + b;
int ans = 0;
ans = (n / sum) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main() {
int n, a, b;
cin >> n >> a >> b;
int sum = a + b;
int ans = 0;
ans = (n / sum) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
} | insert | 1 | 1 | 1 | 2 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | replace | 58 | 70 | 58 | 62 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, mod, div;
cin >> n >> a >> b;
div = n / (a + b);
mod = n % (a + b);
if (mod > a) {
mod = a;
}
cout << mod + a * div;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long n, a, b, mod, div;
cin >> n >> a >> b;
div = n / (a + b);
mod = n % (a + b);
if (mod > a) {
mod = a;
}
cout << mod + a * div;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
const int INF = 1e9;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a) << e... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
const int INF = 1e9;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min... | replace | 2 | 3 | 2 | 3 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, A, B, rest;
cin >> N >> A >> B;
rest = N % (A + B);
if (rest > A)
rest = A;
N = (N / (A + B)) * A;
cout << rest + N;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, rest;
cin >> N >> A >> B;
rest = N % (A + B);
if (rest > A)
rest = A;
N = (N / (A + B)) * A;
cout << rest + N;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
bool ok = true;
int64_t i = 0;
int64_t ans = 0;
while (ok) {
if ((A + B) + i < N) {
ans += A;
i += (A + B);
} else if ((i + A) < N) {
ans += A;
ok = false;
} else {
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
int64_t i = (A + B) * (N / (A + B));
int64_t ans = A * (N / (A + B));
if ((i + A) < N) {
ans += A;
} else {
ans += (N - i);
}
cout << ans << endl;
} | replace | 6 | 20 | 6 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, X;
cin >> N >> A >> B;
X = N / (A + B);
cout << X * A + min(N % (A + B), A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, X;
cin >> N >> A >> B;
X = N / (A + B);
cout << X * A + min(N % (A + B), A) << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A)
cout << N / (A + B) * A + A << endl;
else
cout << N / (A + B) * A + N % (A + B) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A)
cout << N / (A + B) * A + A << endl;
else
cout << N / (A + B) * A + N % (A + B) << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
int k, l, p;
cin >> N >> A >> B;
k = N / (A + B);
l = N - (A + B) * k;
if (l < A) {
p = l + k * A;
} else {
p = A + k * A;
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
int64_t k, l, p;
cin >> N >> A >> B;
k = N / (A + B);
l = N - (A + B) * k;
if (l < A) {
p = l + k * A;
} else {
p = A + k * A;
}
cout << p << endl;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
int count, ama;
cin >> N >> A >> B;
count = N / (A + B);
ama = N % (A + B);
if (ama > A > 0) {
ama = A;
}
cout << count * A + ama << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
long long int count, ama;
cin >> N >> A >> B;
count = N / (A + B);
ama = N % (A + B);
if (ama > A > 0) {
ama = A;
}
cout << count * A + ama << endl;
} | replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long m = a + b;
long r = n % m;
long ans = (a / m) * a + min(r, a);
return ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long m = a + b;
long r = n % m;
long ans = (n / m) * a + min(r, a);
cout << ans;
return 0;
} | replace | 9 | 11 | 9 | 12 | 1 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | replace | 15 | 32 | 15 | 16 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a);
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b;
c = n / (a + b) * a;
if (n % (a + b) > a) {
c = c + a;
} else {
c = c + n % (a + b);
}
cout << c << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int n, a, b, c;
cin >> n >> a >> b;
c = n / (a + b) * a;
if (n % (a + b) > a) {
c = c + a;
} else {
c = c + n % (a + b);
}
cout << c << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long count = 0;
bool turn = true;
while (N) {
if (turn) {
if (N > A) {
count += A;
N -= A;
} else {
count += N;
N = 0;
}
turn = false;
} else... | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int fixedcount = (N / (A + B)) * A;
long long int remainder = (N % (A + B));
if (remainder < A)
cout << (fixedcount + remainder) << "\n";
else
cout << (fixedcount + A) << "\n";
return 0;
... | replace | 8 | 30 | 8 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | replace | 15 | 32 | 15 | 20 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | replace | 22 | 28 | 22 | 25 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, A, B, tmp, r, ans;
cin >> N >> A >> B;
tmp = N / (A + B);
r = N % (A + B);
if (A <= r) {
ans = (tmp + 1) * A;
} else {
ans = tmp * A + r;
}
cout << ans;
re... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long int N, A, B, tmp, r, ans;
cin >> N >> A >> B;
tmp = N / (A + B);
r = N % (A + B);
if (A <= r) {
ans = (tmp + 1) * A;
} else {
ans = tmp * A + r;
}
cout << ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
int64_t i = 0;
int64_t sum = 0;
int64_t r = b;
while (i < a) {
if (r != 0) {
... | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
int64_t count = a / (b + c);
if (a - count * (b + c) > b)
cout << (count + 1) * b;
... | replace | 9 | 25 | 9 | 14 | TLE | |
p02754 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#d... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#d... | replace | 39 | 40 | 39 | 40 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int ans, amariblue;
cin >> n >> a >> b;
ans = n / (a + b) * a;
amariblue = min(n % (a + b), a);
ans += amariblue;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b;
long long int ans, amariblue;
cin >> n >> a >> b;
ans = n / (a + b) * a;
amariblue = min(n % (a + b), a);
ans += amariblue;
cout << ans << endl;
return 0;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
int main() {
int n, a, b;
int q, r;
int sum = 0;
std::cin >> n >> a >> b;
q = (n / (a + b));
r = (n % (a + b));
sum = q * a;
if (r >= a)
sum += a;
else
sum += r;
std::cout << sum << std::endl;
return 0;
} | #include <iostream>
int main() {
long long n, a, b;
long long q, r;
long long sum = 0;
std::cin >> n >> a >> b;
q = (n / (a + b));
r = (n % (a + b));
sum = q * a;
if (r >= a)
sum += a;
else
sum += r;
std::cout << sum << std::endl;
return 0;
} | replace | 3 | 6 | 3 | 6 | 0 | |
p02754 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | replace | 108 | 109 | 108 | 109 | 0 | |
p02754 | C++ | Runtime Error | // #pragma warning(disable:4996)
// #include <Windows.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#inclu... | // #pragma warning(disable:4996)
// #include <Windows.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#inclu... | replace | 64 | 65 | 64 | 65 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, a, b, set, res;
cin >> n >> a >> b;
set = n / (a + b);
res = set * a;
n -= set * (a + b);
if (n > a) {
res += a;
} else {
res += n;
}
cout << res << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned long long n, a, b, set, res;
cin >> n >> a >> b;
set = n / (a + b);
res = set * a;
n -= set * (a + b);
if (n > a) {
res += a;
} else {
res += n;
}
cout << res << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, r, ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
r = n % (a + b);
ans += min(r, a);
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long int n, a, b, ans, r;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
r = n % (a + b);
ans += min(r, a);
cout << ans;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a, b, c, d, e, f;
string s;
cin >> n >> a >> b;
c = a + b;
d = n % c;
e = n / c;
if (d > a) {
e = e + 1;
f = e * a;
cout << f;
} else {
f = e * a;
f = f + d;
cout << f;
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, f;
cin >> n >> a >> b;
c = a + b;
d = n % c;
e = n / c;
if (d > a) {
e = e + 1;
f = e * a;
cout << f;
} else {
f = e * a;
f = f + d;
cout << f;
}
} | replace | 5 | 7 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int q, r;
cin >> n >> a >> b;
q = n / (a + b);
r = n % (a + b);
if (r > a)
cout << a * q + a << endl;
else
cout << a * q + r << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
long long q, r;
cin >> n >> a >> b;
q = n / (a + b);
r = n % (a + b);
if (r > a)
cout << a * q + a << endl;
else
cout << a * q + r << endl;
return 0;
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long int in, blue, red, ans = 0;
cin >> in >> blue >> red;
if (blue == 0) {
cout << 0 << endl;
return (0);
}
while (1) {
if (in <= 0)
break;
if (in - blue <= 0) {
ans += in;
break;
}
a... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long int in, blue, red, ans = 0;
cin >> in >> blue >> red;
if (blue == 0) {
cout << 0 << endl;
return (0);
}
ans = in / (blue + red) * blue;
ans += in % (blue + red) > blue ? blue : in % (blue + red);
cout << ans <... | replace | 10 | 20 | 10 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a... | replace | 19 | 46 | 19 | 21 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, sum = 0;
cin >> n >> a >> b;
sum += n / (a + b) * a;
n = n % (a + b);
if (n > a)
sum += a;
else
sum += n;
cout << sum;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long n, a, b, sum = 0;
cin >> n >> a >> b;
sum += n / (a + b) * a;
n = n % (a + b);
if (n > a)
sum += a;
else
sum += n;
cout << sum;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | // ここから「ここまでテンプレ」までテンプレ
#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#de... | // ここから「ここまでテンプレ」までテンプレ
#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#de... | replace | 204 | 215 | 204 | 209 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B, blues, r;
cin >> N >> A >> B;
r = N % (A + B);
blues = (N / (A + B)) * A;
blues += min(A, r);
cout << blues << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, blues, r;
cin >> N >> A >> B;
r = N % (A + B);
blues = (N / (A + B)) * A;
blues += min(A, r);
cout << blues << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.