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 <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, r, b;
cin >> n >> b >> r;
if (n % (r + b) == 0) {
cout << (n / (r + b)) * b << endl;
} else {
if (n % (b + r) >= b) {
cout << n / (b + r) * b + b << endl;
} else if (n % (b + r) < b) {
cout << n / (b + r) * b + n % (b + r) <<... | #include <iostream>
using namespace std;
int main() {
long long n, r, b;
cin >> n >> b >> r;
if (n % (r + b) == 0) {
cout << (n / (r + b)) * b << endl;
} else {
if (n % (b + r) >= b) {
cout << n / (b + r) * b + b << endl;
} else if (n % (b + r) < b) {
cout << n / (b + r) * b + n % (b +... | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return (... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return (... | replace | 37 | 42 | 37 | 38 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll inf = 1e6 + 5;
vector<int> freq(5);
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll total = b * (a / (b + c));
ll left = a % (b + c);
for (int i = 0; i < left; i++) {
if (i < b) {
total++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll inf = 1e6 + 5;
vector<int> freq(5);
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll total = b * (a / (b + c));
ll left = a % (b + c);
total += min(left, b);
cout << total;
} | replace | 11 | 16 | 11 | 12 | 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() {
long long int 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++ | 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;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error |
/*
Author: Shivam Shukla
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll, ll>> vpll;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
const double PI = acos(-1.0);
const long double EPS =... |
/*
Author: Shivam Shukla
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll, ll>> vpll;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
const double PI = acos(-1.0);
const long double EPS =... | delete | 86 | 92 | 86 | 86 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | insert | 32 | 32 | 32 | 36 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int zong, ans = 0, h, l, now, yu, c;
cin >> zong >> l >> h;
yu = zong % (h + l);
now = zong / (h + l);
ans = now * l;
if (yu <= l) {
ans += yu;
} else {
ans += l;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int zong, ans = 0, h, l, now, yu, c;
cin >> zong >> l >> h;
yu = zong % (h + l);
now = zong / (h + l);
ans = now * l;
if (yu <= l) {
ans += yu;
} else {
ans += l;
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int n = 0, a = 0, b = 0, c = 0, ans = 0;
cin >> n >> a >> b;
ans = n / (a + b) * a;
c = n % (a + b);
if (c > a) {
ans += a;
} else {
ans += c;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long n = 0, a = 0, b = 0, c = 0, ans = 0;
cin >> n >> a >> b;
ans = n / (a + b) * a;
c = n % (a + b);
if (c > a) {
ans += a;
} else {
ans += c;
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
/*入力*/
cin >> n >> a >> b;
long c = a + b;
long ans = a * (n / c);
int rest = n % c;
ans += min(rest, a);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, blue, red;
cin >> n >> blue >> red;
/**/
long long rest = n % (blue + red);
long long count = (n - rest) / (blue + red);
long long ans = blue * count + min(rest, blue);
cout << ans << endl;
return 0;
} | replace | 5 | 12 | 5 | 11 | 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 - (n / (a + b)) * b << endl;
return 0;
} | #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 - (n / (a + b)) * b << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0, num = 0;
while (true) {
rep(i, a) {
ans++;
num++;
if (num == n) {
cout << ans << endl;
retu... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0, num = 0;
long long rem;
rem = n % (a + b);
ans += (n - rem) / (a + b);
ans *= a;
if (rem <= a)
ans += rem;
else
... | replace | 8 | 25 | 8 | 17 | TLE | |
p02754 | Python | Runtime Error | n, a, b = [int(i) for i in input().split()]
if a == 0:
print(0)
else:
x = (n // (a + b)) + 1
balls = []
for i in range(x):
balls += list("b" * a) + list("r" * b)
ans = 0
for i in range(n):
if balls[i] == "b":
ans += 1
print(ans)
| n, a, b = [int(i) for i in input().split()]
ans = (n // (a + b)) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)
| replace | 1 | 13 | 1 | 5 | 0 | |
p02754 | Python | Time Limit Exceeded | n, a, b = map(int, input().split())
ans = []
while True:
for _ in range(a):
ans.append("b")
if len(ans) >= n:
break
for _ in range(b):
ans.append("r")
if len(ans) >= n:
break
print(ans[:n].count("b"))
| n, a, b = map(int, input().split())
ans = (n // (a + b)) * a
if n % (a + b) > a:
print(ans + a)
else:
print(ans + n % (a + b))
| replace | 1 | 12 | 1 | 6 | TLE | |
p02754 | Python | Time Limit Exceeded | n, a, b = map(int, input().split())
acnt = 0
bcnt = 0
while True:
acnt += a
if acnt + bcnt >= n:
acnt -= (acnt + bcnt) - n
break
bcnt += b
if acnt + bcnt >= n:
break
print(acnt)
| n, a, b = map(int, input().split())
amari = n % (a + b)
sho = n // (a + b)
if n <= a:
print(n)
elif amari == 0:
print(a * sho)
elif amari < a:
print(a * sho + amari)
else:
print(a * sho + a)
| replace | 1 | 13 | 1 | 11 | TLE | |
p02754 | Python | Runtime Error | n, a, b = map(int, input().split())
s = "a" * a + "b" * b
S = s * (int(n / (a + b)) + 1)
print(S[:n].count("a"))
| n, a, b = map(int, input().split())
if a == 0:
print(0)
elif n <= a:
print(n)
else:
r = int(n / (a + b))
if n % (a + b) < a:
print(n - r * b)
else:
print(a * (r + 1))
| replace | 1 | 4 | 1 | 11 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
// std::stack<int> stack;
long... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
// std::stack<int> stack;
long... | replace | 21 | 33 | 21 | 25 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b) * a + min(a, n - n / (a + b) * (a + b))) << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b) * a + min(a, n - n / (a + b) * (a + b))) << endl;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;... | replace | 13 | 33 | 13 | 15 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
long long int n = 0, a = 0, b = 0;
long long int cnt = 0, ans = 0, num = 0;
scanf("%lld%lld%lld", &n, &a, &b);
cnt = n / (a + b);
num = (a + b) * cnt;
ans = a * cnt;
// printf("cnt:%lld num:%lld ans:%lld\n", cnt, num,... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
long long int n = 0, a = 0, b = 0;
long long int cnt = 0, ans = 0, num = 0;
scanf("%lld%lld%lld", &n, &a, &b);
cnt = n / (a + b);
num = (a + b) * cnt;
ans = a * cnt;
// printf("cnt:%lld num:%lld ans:%lld\n", cnt, num,... | replace | 16 | 22 | 16 | 20 | TLE | |
p02754 | Python | Time Limit Exceeded | N, A, B = map(int, input().split())
ans = 0
while N > 0:
red = min(N, A)
ans += red
N -= red
blue = min(N, B)
N -= blue
print(ans)
| N, A, B = map(int, input().split())
rep = N // (A + B)
ans = A * rep
diff = N - (A + B) * rep
ans += min(diff, A)
print(ans)
| replace | 2 | 10 | 2 | 6 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long line = 0, ans = 0;
while (line + A + B <= N) {
line += A + B;
ans += A;
}
if (line + A <= N) {
ans += A;
} else {
ans += N - line;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long line = 0, ans = 0;
long long tmp;
tmp = N / (A + B);
line = (A + B) * tmp;
ans = A * tmp;
if (line + A <= N) {
ans += A;
} else {
ans += N - line;
}
cout << ans << endl;
} | replace | 7 | 11 | 7 | 11 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long X = A + B;
long long c = N / X;
long long z = N % (X * c);
long long g;
if (z <= A)
g = z;
if (z > A)
g = A;
long long ans = A * c + g;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long X = A + B;
long long c = N / X;
long long z;
if (c != 0)
z = N % (X * c);
else {
z = 0;
if (N < A)
cout << N << endl;
else {
cout << A << endl;
}
return 0;
}
... | replace | 9 | 10 | 9 | 21 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll int n, a, b;
cin >> n >> a >> b;
cout << a + (n / a + b);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll int n, a, b;
cin >> n >> a >> b;
ll int temp = a * (n / (a + b));
n = n % (a + b);
if (n < a) {
temp += n;
} else {
temp += a;
}
if (a == 0) {
cout << "0";
return 0;
} else {
cout << temp;
}
retu... | replace | 6 | 7 | 6 | 19 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
if (A == 0) {
cout << 0 << endl;
return 0;
}
long long int C = (A + B) % N;
long long int ans = A * (N / C);
if ((N % C) > A)
ans += A;
else
ans += (N % C);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
if (A == 0) {
cout << 0 << endl;
return 0;
}
long long int C = (A + B);
long long int ans = A * (N / C);
if ((N % C) > A)
ans += A;
else
ans += (N % C);
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, ans = 0;
cin >> N >> A >> B;
for (int i = 0; i * (A + B) <= N; i++) {
ans = i * A;
}
if (N % (A + B) <= A) {
ans += N % (A + B);
}
if (N % (A + B) > A) {
ans += A;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, ans = 0;
cin >> N >> A >> B;
ans += (N / (A + B)) * A;
if (N % (A + B) <= A) {
ans += N % (A + B);
}
if (N % (A + B) > A) {
ans += A;
}
cout << ans << endl;
} | replace | 6 | 9 | 6 | 7 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#define MIN(a, b) ((a > b) ? b : a)
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + MIN(N % (A + B), A);
} | #include <iostream>
#define MIN(a, b) ((a > b) ? b : a)
using namespace std;
int main() {
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++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, i, sum = 0, c;
cin >> n >> a >> b;
c = n / (a + b);
sum = a * c + sum;
c = n % (a + b);
if (c <= a)
sum = sum + c;
else
sum = sum + a;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, i, sum = 0, c;
cin >> n >> a >> b;
c = n / (a + b);
sum = a * c + sum;
c = n % (a + b);
if (c <= a)
sum = sum + c;
else
sum = sum + a;
cout << sum << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long n, a, b, cnt = 0;
cin >> n >> a >> b;
while (n >= a + b) {
n -= a + b;
cnt += a;
}
if (n >= a) {
n -= a;
cnt += a;
} else
cnt += n;
cout << cnt;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
long long n, a, b, cnt = 0;
cin >> n >> a >> b;
cnt += n / (a + b) * a;
n %= (a + b);
if (n >= a) {
n -= a;
cnt += a;
} else
cnt += n;
cout << cnt;
return 0;
}
| replace | 5 | 9 | 5 | 7 | TLE | |
p02754 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B, R, S;
cin >> N >> A >> B;
S = A + B;
R = (N / S) * A;
R += (N % S) > A ? A : N % S;
cout << R << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
unsigned long int N, A, B, R, S;
cin >> N >> A >> B;
S = A + B;
R = (N / S) * A;
R += (N % S) > A ? A : N % S;
cout << R << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll AB = A + B;
int counter = 0;
while (N >= AB) {
N -= AB;
counter++;
}
if (N < A) {
cout << counter * A + N << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll AB = A + B;
ll counter = 0;
counter = N / AB;
N %= AB;
if (N < A) {
cout << counter * A + N << endl;
} else {
cout << (count... | replace | 10 | 15 | 10 | 13 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << (N / (A + B)) * A + min(N % (A + B), A) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
cout << (N / (A + B)) * A + min(N % (A + B), A) << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02754 | Python | Time Limit Exceeded | n, a, b = map(int, input().split())
x = []
cnt = 0
flag = True
while cnt < n:
if flag:
for j in range(a):
if cnt + j >= n:
break
x.append(1)
cnt += a
flag = False
else:
for j in range(b):
if cnt + j >= n:
break
... | n, a, b = map(int, input().split())
ans = n // (a + b) * a
rem = n % (a + b)
print(ans + min(rem, a))
| replace | 2 | 27 | 2 | 5 | TLE | |
p02754 | Python | Runtime Error | #!/usr/bin/env python3
n, a, b = map(int, input().split())
s = "b" * a
r = "r" * b
ans = ""
for i in range(n):
ans += s
ans += r
if len(ans) >= n:
break
print(ans[:n].count("b"))
| #!/usr/bin/env python3
n, a, b = map(int, input().split())
x = n // (a + b)
r = n % (a + b)
print(a * x + r) if r < a else print((a * (x + 1)))
| replace | 2 | 11 | 2 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, a, b;
cin >> n >> a >> b;
ll N = 0;
ll res = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, a, b;
cin >> n >> a >> b;
ll res = n / (a + b) * a... | replace | 14 | 26 | 14 | 16 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, A, B, i, j, s, w;
cin >> N >> A >> B;
w = A + B;
i = N / w;
j = N % w;
if (j >= A)
j = A;
s = i * A + j;
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
long long N, A, B, i, j, s, w;
cin >> N >> A >> B;
w = A + B;
i = N / w;
j = N % w;
if (j >= A)
j = A;
s = i * A + j;
cout << s << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
void A() {
string S;
cin >> S;
if (S[0] == S[1] && S[1] == S[2]) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
}
void B() {
long long int N, A, B;
cin >> N >> A >> B;
long long int cntAll = 0, cntBlue = 0, cntRed = 0;
... | #include <iostream>
#include <string>
using namespace std;
void A() {
string S;
cin >> S;
if (S[0] == S[1] && S[1] == S[2]) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
}
void B() {
long long int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl... | replace | 21 | 38 | 21 | 22 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll i = 0;
ll res = 0;
while (i < n) {
ll blue = 0;
while (blue < a && i < n) {
i++;
blue++;
res++;
}
ll red = 0;
while (red < b && i < n) {
i++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll res = n / (a + b) * a;
ll r = n % (a + b);
res += min(r, a);
cout << res << endl;
return 0;
}
| replace | 7 | 22 | 7 | 10 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int num, b, r;
int tmpRoop = 0;
int tmpAmari = 0;
int kekka = 0;
cin >> num >> b >> r;
tmpRoop = num / (b + r);
tmpAmari = num % (b + r);
if (tmpAmari == 0) {
kekka = tmpRoop * b;
} else if (tmpAmari > 0) {
if (b - tmpAmari >= 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long num, b, r;
long long tmpRoop = 0;
long long tmpAmari = 0;
long long kekka = 0;
cin >> num >> b >> r;
tmpRoop = num / (b + r);
tmpAmari = num % (b + r);
if (tmpAmari == 0) {
kekka = tmpRoop * b;
} else if (tmpAmari > 0) {
... | replace | 4 | 8 | 4 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n, a, b;
int ans = 0;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
if (n % (a + b) - a < 0) {
ans = ans + (n % (a + b));
} else {
ans = ans + a;
}
cout << ans << endl;
} | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long n, a, b;
long ans = 0;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
if (n % (a + b) - a < 0) {
ans = ans + (n % (a + b));
} else {
ans = ans + a;
}
cout << ans << endl;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C;
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 | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
////////////////////////////////////... | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
////////////////////////////////////... | replace | 36 | 49 | 36 | 46 | TLE | |
p02754 | Python | Time Limit Exceeded | n, a, b = map(int, input().split())
a_count = 0
n_count = 0
while n_count < n:
for i in range(a):
if n_count >= n:
break
a_count += 1
n_count += 1
n_count += b
print(a_count)
| n, a, b = map(int, input().split())
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)
| replace | 1 | 13 | 1 | 5 | 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 - N / (A + B) * (A + B), A) << 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(N - N / (A + B) * (A + B), A) << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <unordered_map>
#include <utility>
... | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <unordered_map>
#include <utility>
... | replace | 30 | 38 | 30 | 31 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, ans, rem;
cin >> n >> a >> b;
ans = n / (a + b) * a;
rem = n % (a + b);
ans += min(rem, a);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n, a, b, ans, rem;
cin >> n >> a >> b;
ans = n / (a + b) * a;
rem = n % (a + b);
ans += min(rem, a);
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
int main() {
int N, A, B, i, temp = 0;
int red = 0, blue = 0, nokori = 0;
cin >> N >> A >> B;
temp = N / (A + B);
blue += temp * A;
nokori = N - temp * (A + B);
if (nokori <= A) {
blue += nokori;
} else {
bl... | #include <bits/stdc++.h>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
int main() {
long long N, A, B, i, temp = 0;
long long red = 0, blue = 0, nokori = 0;
cin >> N >> A >> B;
temp = N / (A + B);
blue += temp * A;
nokori = N - temp * (A + B);
if (nokori <= A) {
blue += nokori;
} e... | replace | 5 | 7 | 5 | 7 | 0 | |
p02754 | Python | Time Limit Exceeded | n, a, b = list(map(int, input().split(" ")))
blue_count = 0
while n != 0:
# 青
if n > a:
n -= a
blue_count += a
else:
blue_count += n
n = 0
if n > b:
n -= b
else:
n = 0
print(blue_count)
| n, a, b = list(map(int, input().split(" ")))
blue_count = a * (n // (a + b))
n -= (a + b) * (n // (a + b))
if n >= a:
blue_count += a
else:
blue_count += n
print(blue_count)
| replace | 2 | 16 | 2 | 8 | TLE | |
p02754 | Python | Runtime Error | n, a, b = map(int, input().split(" "))
str = ("b" * a + "r" * b) * -(-n // (a + b))
print(str[0:n].count("b"))
| n, a, b = map(int, input().split(" "))
blue = a * int(n / (a + b))
if a <= n % (a + b):
print(blue + a)
else:
print(blue + n % (a + b))
| replace | 1 | 3 | 1 | 6 | 0 | |
p02754 | Python | Runtime Error | n, a, b = map(int, input().split().rstrip())
k = n // (a + b)
r = n % (a + b)
print(k * a + min(r, a))
| n, a, b = map(int, input().rstrip().split())
k = n // (a + b)
r = n % (a + b)
print(k * a + min(r, a))
| replace | 0 | 1 | 0 | 1 | AttributeError: 'list' object has no attribute 'rstrip' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02754/Python/s608778092.py", line 1, in <module>
n, a, b = map(int, input().split().rstrip())
AttributeError: 'list' object has no attribute 'rstrip'
|
p02754 | Python | Runtime Error | N, A, B = map(int, input().split())
a = []
while len(a) != N:
a.append("b" * A)
a.append("a" * B)
a = "".join(a)
b = a[0:N]
c = b.count("b")
print(c)
| n, a, b = map(int, input().split())
k = n // (a + b)
mod = n % (a + b)
ans = a * k
if mod >= a:
ans += a
else:
ans += mod
print(ans)
| replace | 0 | 13 | 0 | 9 | 0 | |
p02754 | Python | Time Limit Exceeded | n, b, r = map(int, input().split())
x = []
bool = True
while bool:
for i in range(b):
if len(x) == n:
bool = False
else:
x.append("b")
for j in range(r):
if len(x) == n:
bool = False
else:
x.append("r")
print(x.count("b"))
| n, b, r = map(int, input().split())
b1 = n // (b + r)
b2 = n % (b + r)
if b == 0:
print(0)
elif r == 0:
print(n)
elif b2 != 0 and b2 <= b:
b1 = b1 * b + b2
print(b1)
elif b2 != 0 and b2 > b:
b1 = b1 * b + b
print(b1)
elif n % (b + r) == 0:
print(b1 * b)
| replace | 1 | 16 | 1 | 15 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, a, b, ans;
cin >> n >> a >> b;
ans = a * (n / (a + b));
ans += min(a, (n % (a + b)));
cout << ans;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n, a, b, ans;
cin >> n >> a >> b;
ans = a * (n / (a + b));
ans += min(a, (n % (a + b)));
cout << ans;
}
| 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, c;
cin >> N >> a >> b;
long long cnt = 0;
if (N % (a + b) == 0) {
cnt = N / (a + b);
cout << a * cnt << endl;
} else {
cnt = N / (a + b);
long long ans = cnt * a;
for (long long i = cnt * (a + b) + 1; i <= N; ++i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, a, b, c;
cin >> N >> a >> b;
long long cnt = 0;
if (N % (a + b) == 0) {
cnt = N / (a + b);
cout << a * cnt << endl;
} else {
cnt = N / (a + b);
long long ans = cnt * a;
ans += min(N - (cnt * (a + b) + 1) + 1, a);
c... | replace | 12 | 16 | 12 | 13 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
st... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
l... | replace | 16 | 23 | 16 | 17 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, r;
cin >> n >> a >> b;
r = (n / (a + b)) * a + (n % (a + b) < a ? n % (a + b) : a);
cout << r;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b, r;
cin >> n >> a >> b;
r = (n / (a + b)) * a + (n % (a + b) < a ? n % (a + b) : a);
cout << r;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^19 < 9223372036854775807
typedef unsigned long long ull; // 10^20 < 18446744073709551615
#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)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^19 < 9223372036854775807
typedef unsigned long long ull; // 10^20 < 18446744073709551615
#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)... | replace | 19 | 36 | 19 | 24 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cstddef>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int main() {
long long unsigned N, A, B;
std::cin >> N >> A >> B;
long long unsigned ans = 0;
while (N >= (A + B)) {
N -= A;
N -= B;
ans += A;
}
if... | #include <algorithm>
#include <array>
#include <cstddef>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int main() {
long long unsigned N, A, B;
std::cin >> N >> A >> B;
long long unsigned ans = 0;
ans = A * (N / (A + B));
N = N % (A + B);
if (N >= A) {
ans +... | replace | 14 | 19 | 14 | 16 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
int main() {
int N, A, B;
int C, D, E, F;
cin >> N >> A >> B;
C = A + B;
D = N / C;
E = N % C;
if (E <= A) {
F = E;
} else {
F = A;
}
cout << D * A + F << endl;... | #include <iostream>
#include <map>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
int main() {
unsigned long N, A, B;
unsigned long C, D, E, F;
cin >> N >> A >> B;
C = A + B;
D = N / C;
E = N % C;
if (E <= A) {
F = E;
} else {
F = A;
}
cout <... | replace | 9 | 11 | 9 | 11 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A)
cout << N / (A + B)... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A)
cout << N / (A + B... | replace | 9 | 10 | 9 | 10 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, k, l, a, b;
cin >> n >> a >> b;
if (a + b >= n) {
if (a >= n)
cout << n << endl;
else
cout << a << endl;
} else {
if (a == 0)
cout << 0 << endl;
else {
k = n / b;
cout << n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j, k, l, a, b;
cin >> n >> a >> b;
ll ans = n / (a + b);
ans *= a;
k = n % (a + b);
ans += min(a, k);
cout << ans << endl;
return 0;
}
| replace | 7 | 20 | 7 | 12 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B;
cin >> N >> A >> B;
ll all_count = 0, ans = 0;
while (all_count < N) {
all_count += A + B;
if (all_count >= N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B;
cin >> N >> A >> B;
ll ans = 0;
ll q = N / (A + B);
ans += A * q;
ll rest = N - (A + B) * q;
ans += min(rest, A... | replace | 13 | 22 | 13 | 18 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define cou(x) cout << x << endl
using lint = long long;
int main() {
int N, A, B;
int ac;
int loops, additional;
cin >> N >> A >> B;
loops = N / (A + B);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define cou(x) cout << x << endl
using lint = long long;
int main() {
lint N, A, B;
lint ac;
lint loops, additional;
cin >> N >> A >> B;
loops = N / (A + B... | replace | 8 | 11 | 8 | 11 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / a + b) * a + min(a, (n % (a + b)));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(a, (n % (a + b)));
} | replace | 8 | 10 | 8 | 9 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, a, b, r;
cin >> n >> a >> b;
r = (n / (a + b)) * a;
r += min(n % (a + b), a);
cout << r << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
ll n, a, b, r;
cin >> n >> a >> b;
r = (n / (a + b)) * a;
r += min(n % (a + b), a);
cout << r << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, A, B;
int ans = 0, D = 0;
cin >> N >> A >> B;
D = N % (A + B);
if (D > A) {
D = A;
}
ans = N / (A + B) * A + D;
cout << ans;
}
| #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
long long int ans = 0, D = 0;
cin >> N >> A >> B;
D = N % (A + B);
if (D > A) {
D = A;
}
ans = N / (A + B) * A + D;
cout << ans;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, i, sum = 0, cnt = 0;
cin >> N >> A >> B;
vector<string> ball;
while (sum <= N) {
for (i = 0; i < A; ++i)
ball.push_back("b");
for (i = 0; i < B; ++i)
ball.push_back("r");
sum += A;
sum += B;
}
for (i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B, i, sum = 0, cnt = 0;
cin >> N >> A >> B;
cnt += (N / (A + B)) * A;
if (N % (A + B) > A)
cnt += A;
else
cnt += N % (A + B);
cout << cnt;
}
| replace | 6 | 19 | 6 | 11 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, sum = 0;
cin >> n >> a >> b;
c = n / (a + b);
d = min(n % (a + b), a);
sum = c * a + d;
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, c, d, sum = 0;
cin >> n >> a >> b;
c = n / (a + b);
d = min(n % (a + b), a);
sum = c * a + d;
cout << sum << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, sho, amari;
cin >> N >> A >> B;
sho = N / (A + B);
amari = N % (A + B);
if (amari - A >= 0)
amari = A;
cout << A * sho + amari << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B, sho, amari;
cin >> N >> A >> B;
sho = N / (A + B);
amari = N % (A + B);
if (amari - A >= 0)
amari = A;
cout << A * sho + amari << endl;
}
| 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;
long a = (N / (A + B)) * A;
long b = N % (A + B);
if (A <= b)
b = A;
cout << a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long a = (N / (A + B)) * A;
long b = N % (A + B);
if (A <= b)
b = A;
cout << a + b << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int N, A, B;
int quotient, reminder, add, sum;
int main() {
cin >> N;
cin >> A;
cin >> B;
quotient = N / (A + B);
reminder = N % (A + B);
add = reminder;
if (reminder >= A) {
add = A;
}
sum = quotient * A + add;
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
long N, A, B;
long quotient, reminder, add, sum;
int main() {
cin >> N;
cin >> A;
cin >> B;
quotient = N / (A + B);
reminder = N % (A + B);
add = reminder;
if (reminder >= A) {
add = A;
}
sum = quotient * A + add;
cout << sum << endl;
return 0;
... | replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
long long a;
long long b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
} | replace | 6 | 9 | 6 | 9 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pi acos... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pi acos... | delete | 119 | 126 | 119 | 119 | 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)) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << "\n";
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
cout << N / (A + B) * A + min(N % (A + B), A);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N;
cin >> A;
cin >> B;
cout << N / (A + B) * A + min(N % (A + B), A);
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + (n % (a + b)) / a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min((n % (a + b)), a) << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int... | replace | 34 | 36 | 34 | 37 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
int main() {
using namespace std;
int n, r, b, sum, set, amari;
int ans = 0;
cin >> n >> b >> r;
sum = r + b;
set = n / sum;
ans += b * set;
amari = n % sum;
if (amari >= b) {
ans += b;
} else {
ans += amari;
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
int main() {
using namespace std;
long n, r, b, sum, set, amari;
long ans = 0;
cin >> n >> b >> r;
sum = r + b;
set = n / sum;
ans += b * set;
amari = n % sum;
if (amari >= b) {
ans += b;
} else {
ans += amari;
... | replace | 8 | 10 | 8 | 10 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
ll diff = 0;
while (n > 0) {
diff = min(n, a);
n -= diff;
ans += diff;
diff = min(n, b);
n -= diff;
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll initial = n / (a + b);
ll ans = initial * a;
n -= initial * (a + b);
ll diff = 0;
while (n > 0) {
diff = min(n, a);
n -= diff... | replace | 9 | 10 | 9 | 13 | 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(A, N % (A + B));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B));
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ctoi(x) x - '0'
#define pshb(a) \
cin >> x; \
a.push_back(x)
#define fr(i, n) for (ll i = 0; i < n; i++)
#def... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ctoi(x) x - '0'
#define pshb(a) \
cin >> x; \
a.push_back(x)
#define fr(i, n) for (ll i = 0; i < n; i++)
#def... | replace | 18 | 19 | 18 | 19 | 0 | |
p02754 | C++ | Runtime Error | #include <stdio.h>
int main() {
long long n, a, b;
scanf("%lld %lld %lld", &n, &a, &b);
long long r = n / (a * b) * a;
n %= (a + b);
if (n < a)
r += n;
else
r += a;
printf("%lld\n", r);
return 0;
} | #include <stdio.h>
int main() {
long long n, a, b;
scanf("%lld %lld %lld", &n, &a, &b);
long long r = n / (a + b) * a;
n %= (a + b);
if (n < a)
r += n;
else
r += a;
printf("%lld\n", r);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, w, r;
cin >> n >> a >> b;
w = a * (n / (a + b));
r = n % (a + b);
cout << w + min(r, a) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, w, r;
cin >> n >> a >> b;
w = a * (n / (a + b));
r = n % (a + b);
cout << w + min(r, 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;
int q = n / (a + b);
int r = n % (a + b);
if (r < a) {
cout << a * q + r << endl;
} else {
cout << a * q + a << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int n, a, b;
cin >> n >> a >> b;
int q = n / (a + b);
int r = n % (a + b);
if (r < a) {
cout << a * q + r << endl;
} else {
cout << a * q + a << endl;
}
}
| insert | 4 | 4 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | replace | 264 | 279 | 264 | 268 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
d = n - (c * (a + b));
if (d <= a)
cout << c * a + d;
else
cout << (c + 1) * a;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
d = n - (c * (a + b));
if (d <= a)
cout << c * a + d;
else
cout << (c + 1) * a;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
int N, B, R;
cin >> N >> B >> R;
ll ans = N / (B + R)... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
int main(void) {
ll N, B, R;
cin >> N >> B >> R;
ll ans = N / (B + R) ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n, a, b;
cin >> n >> a >> b;
ll ans = a * (n / (a + b));
n %= a + b;
ans += min(n, a);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = a * (n / (a + b));
n %= a + b;
ans += min(n, a);
cout << ans << endl;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int i, N, A, B, j, k, ans;
cin >> N >> A >> B;
k = 0;
k = N / (A + B);
j = N % (A + B);
i = k * (A + B);
if (N - i > A) {
ans = k * A + A;
} else {
ans = k * A + j;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long long int i, N, A, j, k, ans, B;
cin >> N >> A >> B;
k = 0;
k = N / (A + B);
j = N % (A + B);
i = k * (A + B);
if (N - i > A) {
ans = k * A + A;
} else {
ans = k * A + j;
}
cout << ans << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
cin >> a;
cin >> b;
if (n % (a + b) <= a)
cout << (n / (a + b)) * a + (n % (a + b)) << endl;
else
cout << a + (n / (a + b)) * a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n, a, b;
cin >> n;
cin >> a;
cin >> b;
if (n % (a + b) <= a)
cout << (n / (a + b)) * a + (n % (a + b)) << endl;
else
cout << a + (n / (a + b)) * a << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int ball(long long int n, long long int a, long long int b) {
long long int x = 0, y = 0, z = 0;
while (z <= n) {
if (x % 2 == 0) {
z += a;
y += a;
} else {
z += b;
}
x++;
}
if (z > n && x % 2 != 0)
y -= (z - n);
ret... | #include <bits/stdc++.h>
using namespace std;
long long int ball(long long int n, long long int a, long long int b) {
long long int x, y, z;
x = n / (a + b);
y = n % (a + b);
z = x * a;
if (y > a)
z += a;
else
z += y;
return z;
}
int main() {
long long int n, a, b, res;
cin >> n >> a >> b;
r... | replace | 3 | 16 | 3 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > N) {
cout << N << endl;
} else {
int64_t ans = 0;
int64_t x = N / (A + B);
int64_t mod = N % (A + B);
ans = x * A;
if (mod < A) {
ans += mod;
} else {
ans += A;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
if (A > N) {
cout << N << endl;
} else {
int64_t ans = 0;
int64_t x = N / (A + B);
int64_t mod = N % (A + B);
ans = x * A;
if (mod < A) {
ans += mod;
} else {
ans += A;
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#... | replace | 26 | 27 | 26 | 27 | 0 | |
p02754 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <tuple>
#define INF INT_MAX >> ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <tuple>
#define INF INT_MAX >> ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class ... | replace | 32 | 45 | 32 | 39 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = (n / (a + b)) * a;
if ((n % (a + b)) > a)
ans += a;
else
ans += (n % (a + b));
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
#define int long long int
signed main() {
int n, a, b;
cin >> n >> a >> b;
int ans = (n / (a + b)) * a;
if ((n % (a + b)) > a)
ans += a;
else
ans += (n % (a + b));
cout << ans << endl;
return 0;
}
| replace | 2 | 3 | 2 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long int ulli;
typedef vector<int> vi;
typedef vector<long... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long int ulli;
typedef vector<int> vi;
typedef vector<long... | replace | 31 | 35 | 31 | 38 | TLE | |
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;
ll ans = 0;
ll cur = 0;
while (true) {
// add A
if (cur + A <= N) {
cur += A;
ans += A;
} else {
ans += N - cur;
break;
}
// add B
if (cur + B <= N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll times = floor(N / (A + B));
ll rem = N - times * (A + B);
cout << times * A + min(A, rem) << endl;
} | replace | 7 | 27 | 7 | 10 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
long long res = 0, mod = 0;
cin >> n >> a >> b;
if (a + b == 0) {
cout << res << endl;
return 0;
}
res = (n / (a + b)) * a;
if (n % (a + b) > 0 && a > 0)
for (long long i = 0; i < a && i < n % (a + b); i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
long long res = 0, mod = 0;
cin >> n >> a >> b;
if (a + b == 0) {
cout << res << endl;
return 0;
}
res = (long long)(n / (a + b)) * a;
if (n % (a + b) > 0 && a > 0) {
if (n % (a + b) >= a) {
res += a;
} ... | replace | 13 | 17 | 13 | 21 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.