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++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | replace | 34 | 42 | 34 | 40 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int ans;
int aa;
int n, a, b;
cin >> n >> a >> b;
aa = n % (a + b);
if (aa > a)
aa = a;
ans = ((n / (a + b)) * a) + aa;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
long int ans;
long int aa;
long int n, a, b;
cin >> n >> a >> b;
aa = n % (a + b);
if (aa > a)
aa = a;
ans = ((n / (a + b)) * a) + aa;
cout << ans << endl;
return 0;
} | replace | 6 | 9 | 6 | 9 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
int main() {
int n, a, b, k = 0;
cin >> n >> a >> b;
k = std::min(n % (a + b), a);
cout << (n / (a + b)) * ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
int main() {
unsigned long int n, a, b, k = 0;
cin >> n >> a >> b;
k = std::min(n % (a + b), a);
cout << (n... | replace | 11 | 12 | 11 | 12 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int syc(long long i, long long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int main() {
long long n, a, b; // a=blu... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int syc(long long i, long long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int main() {
long long n, a, b; // a=blu... | replace | 21 | 23 | 21 | 25 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main(void) {
long long int N, A, B;
cin >> N >> A >> B;
long long int AB = A + B;
long long int answer = (N / AB) * A;
// 先頭から何個チェックする？
long long int check_num = N % AB;
// 文字列の作成
std::string str;
for (long long int i = 0; i < A; i++... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
long long int N, A, B;
cin >> N >> A >> B;
long long int AB = A + B;
long long int answer = (N / AB) * A;
// 先頭から何個チェックする？
long long int check_num = N % AB;
if (A > check_num) {
answer += check_num;
} else {
answer... | replace | 16 | 32 | 16 | 20 | TLE | |
p02754 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, a, b, ans, zentai, kaisu, amari;
cin >> n >> a >> b;
zentai = a + b;
kaisu = n / zentai;
ans = a * kaisu;
amari = n - kaisu * zentai;
if (amari < a) {
ans = ans + amari;
} else {
ans = ans + a;
}
cout << ans << e... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
long long int n, a, b, ans, zentai, kaisu, amari;
cin >> n >> a >> b;
zentai = a + b;
kaisu = n / zentai;
ans = a * kaisu;
amari = n - kaisu * zentai;
if (amari < a) {
ans = ans + amari;
} else {
ans = ans + a;
}
cout <... | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for (int i = 0; i < n; ++... | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for (int i = 0; i < n; ++... | replace | 26 | 29 | 26 | 30 | 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);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
typedef long long ll;
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a);
}
| replace | 4 | 5 | 4 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n, a, b;
while (cin >> n >> a >> b) ... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n, a, b;
while (cin >> n >> a >> b) ... | replace | 11 | 29 | 11 | 14 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | replace | 34 | 35 | 34 | 35 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 999999999;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A) {
cout << A * (N / (A + B)) + N % (A + B) << endl;
} else {
cout << A * (N / (A + B)) + A << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 999999999;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A) {
cout << A * (N / (A + B)) + N % (A + B) << endl;
} else {
cout << A * (N / (A + B)) + A << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define fin(ans) cout << (ans) << endl
const int INF = 1 << 30;
const ll MOD = 1000000007;
int main() {
string s, u;
int n, a, b, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define fin(ans) cout << (ans) << endl
const int INF = 1 << 30;
const ll MOD = 1000000007;
int main() {
ll n, a, b, ans;
cin >> n ... | replace | 11 | 13 | 11 | 12 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, r;
cin >> N >> A >> B;
r = N / (A + B) * A;
r += min(A, N % (A + B));
cout << r << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B, r;
cin >> N >> A >> B;
r = N / (A + B) * A;
r += min(A, N % (A + B));
cout << r << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ll long long
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll sum = A + B;
ll count = 0;
ll ans = 0;
while (N > count) {
if (N < count + A) {
ans += N - count;
count = N;
} else {
... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ll long long
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll sum = A + B;
ll ans;
ll q = N / (sum);
ll r = N % (sum);
ll p;
if (r >= A)
p = A;
else
p = r;
ans = q * A + p;
cout << ans << ... | replace | 9 | 20 | 9 | 18 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, ans = 0;
cin >> n >> a >> b;
ans += n / (a + b) * a;
for (int i = 0; i < n % (a + b); i++) {
if (i < a)
ans++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, ans = 0;
cin >> n >> a >> b;
ans += n / (a + b) * a;
if (n % (a + b) < a) {
ans += n % (a + b);
} else {
ans += a;
}
cout << ans;
return 0;
}
| replace | 8 | 11 | 8 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c;
cin >> n >> a >> b;
c = n % (a + b);
n = n / (a + b);
if (c > a)
c = a;
n = n * a + c;
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, a, b, c;
cin >> n >> a >> b;
c = n % (a + b);
n = n / (a + b);
if (c > a)
c = a;
n = n * a + c;
cout << n << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
int main() {
fastio;
int64_t N, A, B;
cin >> N >> A >> B;
int64_t total = 0;
int64_t blue = 0;
while (total < N) {
if (total + A >= N) {
blue += N - total;
break;
}
to... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
int main() {
fastio;
int64_t N, A, B;
cin >> N >> A >> B;
auto blue = (N / (A + B)) * A;
auto total = (N / (A + B)) * (A + B);
while (total < N) {
if (total + A >= N) {
blue += N -... | replace | 8 | 10 | 8 | 11 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
u... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
u... | replace | 39 | 43 | 39 | 41 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int count = 0;
while (N != 0 && N >= A + B) {
count = count + A;
N = N - (A + B);
}
if (N != 0 && N < A + B && N <= A) {
count = count + N;
} else if (N != 0 && N < A + B && N > A) {
... | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int count = 0;
if (N != 0 && N >= A + B) {
count = A * (N / (A + B));
N = N % (A + B);
}
if (N != 0 && N < A + B && N <= A) {
count = count + N;
} else if (N != 0 && N < A + B && N > A) {... | replace | 6 | 9 | 6 | 9 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x, ans;
cin >> n >> a >> b;
x = n / (a + b);
ans = x * a + min(n - x * (a + b), a);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, x, ans;
cin >> n >> a >> b;
x = n / (a + b);
ans = x * a + min(n - x * (a + b), a);
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
// #include<algorithm>
// #include<vector>
// #include<cmath>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << A + N / (A + B) * A;
} else {
cout << N % (A + B) + N / (A + B) * A;
}
cout << endl;
return 0;
}
| #include <iostream>
#include <string>
// #include<algorithm>
// #include<vector>
// #include<cmath>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << A + N / (A + B) * A;
} else {
cout << N % (A + B) + N / (A + B) * A;
}
cout << endl;
re... | replace | 9 | 10 | 9 | 10 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a % (b + c) == 0)
cout << a / (b + c) * b << endl;
else if (a % (b + c) >= b)
cout << (a / (b + c) + 1) * b << endl;
else
cout << a / (b + c) * b + a % (b + c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a % (b + c) == 0)
cout << a / (b + c) * b << endl;
else if (a % (b + c) >= b)
cout << (a / (b + c) + 1) * b << endl;
else
cout << a / (b + c) * b + a % (b + c) << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long n, a, b;
cin >> n >> a >> b;
long long div;
long long remain;
div = n / (a + b);
remain = n % (a + b);
long long blue;
blue = div * a;
for (long long i(0); i < remain; i++) {
if (i < a) {
blue++;
}
}
cout << blue << ... | #include <iostream>
using namespace std;
int main(void) {
long long n, a, b;
cin >> n >> a >> b;
long long div;
long long remain;
div = n / (a + b);
remain = n % (a + b);
long long blue;
blue = div * a;
if (remain >= a) {
blue += a;
} else {
blue += remain;
}
cout << blue << endl;
retu... | replace | 11 | 15 | 11 | 15 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll count_blue_balls = 0;
if (a > 0) {
for (ll i = 0; i < n; i++) {
if (i < a || i >= b + a)
count_blue_balls += 1;
}
}
cout << count_blue_balls << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, a, b;
cin >> n >> a >> b;
if (a != 0 && 0 < a + b <= pow(10, 18))
cout << a * (n / (a + b)) + min(n % (a + b), a) << endl;
else
cout << 0 << endl;
return 0;
} | replace | 6 | 14 | 6 | 10 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, x, y, ans;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> x >> y;
ans = (n / (x + y)) * x;
n %= (x + y);
ans += min(x, n);
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, x, y, ans;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> x >> y;
ans = (n / (x + y)) * x;
n %= (x + y);
ans += min(x, n);
cout << ans;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int solve() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
while (n >= a) {
ans += a;
n -= a + b;
}
ans += max(0ll, n);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int solve() {
long long n, a, b;
cin >> n >> a >> b;
long long remain = max(0ll, n - n / (a + b) * (a + b));
long long ans = n / (a + b) * a + (rem... | replace | 13 | 19 | 13 | 16 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, sum = 0;
cin >> n >> a >> b;
long long c = n / (a + b), d = n % (a + b);
string s;
for (int i = 1; i <= d; i++) {
if (i <= a)
sum++;
}
sum += a * c;
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, sum = 0;
cin >> n >> a >> b;
long long c = n / (a + b), d = n % (a + b);
string s;
if (d >= a)
sum += a;
else
sum += d;
sum += a * c;
cout << sum;
return 0;
} | replace | 9 | 13 | 9 | 13 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define rep(i, x, y) \
for (decl... | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define rep(i, x, y) \
for (decl... | replace | 35 | 36 | 35 | 36 | 0 | cpu time : 0.027327
|
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);
return 0;
}
| #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 % (a + b), a);
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, c, d, out;
cin >> n >> a >> b;
d = n % (a + b);
c = (n - d) / (a + b);
if (d < a) {
out = c * a + d;
} else {
out = c * a + a;
}
cout << out;
}
| #include <iostream>
using namespace std;
int main(void) {
long int n, a, b, c, d, out;
cin >> n >> a >> b;
d = n % (a + b);
c = (n - d) / (a + b);
if (d < a) {
out = c * a + d;
} else {
out = c * a + a;
}
cout << out;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, cnt = 0, mod = 0;
cin >> n >> a >> b;
cnt = n / (a + b);
mod = n % (a + b);
if (mod >= a)
mod = a;
cout << a * cnt + mod << end... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, a, b, cnt = 0, mod = 0;
cin >> n >> a >> b;
cnt = n / (a + b);
mod = n % (a + b);
if (mod >= a)
mod = a;
cout << a * cnt + mod << endl... | replace | 10 | 11 | 10 | 11 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, n;
cin >> N >> A >> B;
n = N / (A + B);
if (N % (A + B) <= A) {
cout << n * A + N % (A + B);
} else {
cout << n * A + A;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, A, B, n;
cin >> N;
cin >> A;
cin >> B;
n = N / (A + B);
if (N % (A + B) <= A) {
cout << n * A + N % (A + B);
} else {
cout << n * A + A;
}
return 0;
} | replace | 6 | 8 | 6 | 10 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define MAX 200005
using namespace std;
ll a[MAX];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
while (n > 0) {
if (n >= a + b) {
ans += a;
n = n - a - b;
} else if (n >... | #include <bits/stdc++.h>
#define ll long long
#define MAX 200005
using namespace std;
ll a[MAX];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
ans = n / (a + b);
ans *= a;
n %= (a + b);
if (n >= a) {
ans += a;
} else {
a... | replace | 14 | 25 | 14 | 21 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N, A, B;
ll ans = N / (A + B) * A;
N %= A + B;
ans += min(A, N);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll ans = A * (N / (A + B));
N %= A + B;
ans += min(A, N);
cout << ans << endl;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r, b;
cin >> n >> b >> r;
cout << n / (r + b) * b + min(n % (r + b), b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long n, r, b;
cin >> n >> b >> r;
cout << n / (r + b) * b + min(n % (r + b), b) << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define float long double
#define ll long long
#define int long long
#define vl vector<ll>
#define mp make_pair
#define pb push_back
#define sd second
#define ft first
#define all(x) x.begin(), x.end()
#define alr(x) x.rbegin(), x.rend()
#define endl ... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define float long double
#define ll long long
#define int long long
#define vl vector<ll>
#define mp make_pair
#define pb push_back
#define sd second
#define ft first
#define all(x) x.begin(), x.end()
#define alr(x) x.rbegin(), x.rend()
#define endl ... | replace | 46 | 60 | 46 | 49 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, n;
cin >> n >> a >> b;
long long cnt_b = 0, cnt_r = 0, cnt = 0;
for (long long i = 0; i < pow(10, 100); i++) {
for (int j = 0; j < a; j++) {
cnt_b++;
cnt++;
if (cnt == n) {
break;
}
}
if (cnt ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, n;
cin >> n >> a >> b;
long long cnt_b;
long long set = n / (a + b);
long long set_ext = n % (a + b);
cnt_b = set * a;
if (set_ext > a) {
cnt_b += a;
} else {
cnt_b += set_ext;
}
cout << cnt_b << endl;
}
| replace | 6 | 28 | 6 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
void solve() {
int64_t n, a, b;
cin >> n >> a >> b;
if (a == 0) {
cout << 0;
return;
}
int64_t c = a + b;
int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
void solve() {
int64_t n, a, b;
cin >> n >> a >> b;
if (a == 0) {
cout << 0;
return;
}
int64_t c = a + b;
int... | replace | 21 | 32 | 21 | 25 | 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);
} | #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 % (a + b), a);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
x = n / (a + b);
y = n - x * (a + b);
if (y >= a)
y = a;
else
y = y;
cout << x * a + y << endl;
return... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
long long n, a, b, x, y;
cin >> n >> a >> b;
x = n / (a + b);
y = n - x * (a + b);
if (y >= a)
y = a;
else
y = y;
cout << x * a + y << endl;
... | replace | 7 | 8 | 7 | 8 | 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(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 | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repo(i, N) for (int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define ll long long
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
// #define num 1000000007
#define pi acos... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repo(i, N) for (int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define ll long long
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
// #define num 1000000007
#define pi acos... | replace | 20 | 21 | 20 | 21 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, count, s, t;
cin >> N >> A >> B;
s = N / (A + B);
t = N - (A + B) * s;
if (t < A) {
count = s * A + t;
} else {
count = s * A + A;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, count, s, t;
cin >> N >> A >> B;
s = N / (A + B);
t = N - (A + B) * s;
if (t < A) {
count = s * A + t;
} else {
count = s * A + A;
}
cout << count << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1e9;
int main(void) {
ll N, A, B;
cin >> N >> A >> B;
ll ans =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1e9;
int main(void) {
ll N, A, B;
cin >> N >> A >> B;
ll ans =... | replace | 20 | 35 | 20 | 21 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
// 最大公約数
ll gcd(ll a, ll b) { return b ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
// 最大公約数
ll gcd(ll a, ll b) { return b ... | replace | 97 | 109 | 97 | 100 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
// #define RREP(i, n ,N) for(ll i = (N-1); i >= (n); i--)
#define p(s) cout << (s) << endl
#define p2(a, b) cout << (a... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
// #define RREP(i, n ,N) for(ll i = (N-1); i >= (n); i--)
#define p(s) cout << (s) << endl
#define p2(a, b) cout << (a... | replace | 27 | 31 | 27 | 36 | 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;
return 0;
} | #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 % (a + b), a) << endl;
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;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min((n % (a + b)), a) << 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((n % (a + b)), a) << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | replace | 22 | 23 | 22 | 23 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
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 <algorithm>
#include <iostream>
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 | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a, b;
cin >> a >> b;
long long hoge = 0;
long long ans = 0;
while (true) {
hoge += a;
ans += a;
if (hoge >= n) {
if (hoge >= n)
cout << ans - (hoge... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a, b;
cin >> a >> b;
long long hoge = a + b;
long long fuga = n / hoge * a;
n %= hoge;
if (n <= a)
cout << fuga + n << endl;
else
cout << fuga + a << endl;
ret... | replace | 11 | 30 | 11 | 18 | 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 n, a, b, t, ans = 0;
cin >> n >> a >> b;
cout << (n / (a + b) * a + min(a, n % (a + b)));
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, c, i, j, k, h, w, a, b;
int main() {
cin >> n >> a >> b;
i = n / (a + b);
j = n % (a + b);
cout << i * a + min(a, j);
} | #include <bits/stdc++.h>
using namespace std;
long long n, c, i, j, k, h, w, a, b;
int main() {
cin >> n >> a >> b;
i = n / (a + b);
j = n % (a + b);
cout << i * a + min(a, j);
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | replace | 29 | 30 | 29 | 37 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> N >> A >> B;
long long ikkai = A + B;
int s = 0;
for (int i = 0; i < N; i++)
if (N - ikkai < 0) {
break;
} else {
N = N - ikkai;
s++;
}
if (A == 0)
cout << 0;
else if (N >= A)
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> N >> A >> B;
auto ikkai = A + B;
auto n = N / ikkai; // 何回割れるか試す
auto m = N % ikkai; // 最後に割ったときのあまり
auto a = min(A, m);
cout << A * n + a;
} | replace | 5 | 20 | 5 | 10 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | replace | 77 | 81 | 77 | 81 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, b, r, S = 0, sum = 0;
cin >> N >> b >> r;
while (sum <= N - (b + r)) {
S += b;
sum += b + r;
}
if (N - sum < b) {
S += N - sum;
} else {
S += b;
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, b, r, S = 0, sum = 0;
cin >> N >> b >> r;
S = N / (b + r) * b;
if (N - (N / (b + r) * (b + r)) < b) {
S += N - (N / (b + r) * (b + r));
} else {
S += b;
}
cout << S << endl;
} | replace | 5 | 11 | 5 | 8 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll res = 0;
ll sum = 0;
ll cnt = 0;
while (true) {
if (sum > n) {
break;
}
if (cnt % 2 == 0)
sum += a;
if (cnt % 2 != 0)
sum += b;
cnt++;
}
if (cnt % 2... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll res = 0;
ll rem = 0;
res = n / (a + b) * a;
rem = n % (a + b);
res += min(rem, a);
cout << res << endl;
return 0;
} | replace | 9 | 26 | 9 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline ... | replace | 90 | 99 | 90 | 100 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
using vi = vector<int>;
using vis = vector<string>;
using vvi = vector<vi>;
// pとqの最大公約数
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; n > i; ++i)
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
using vi = vector<int>;
using vis = vector<string>;
using vvi = vector<vi>;
// pとqの最大公約数
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(... | replace | 15 | 16 | 15 | 16 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, result, res;
cin >> N >> A >> B;
result = N / (A + B) * A;
res = min(N % (A + B), A);
result = result + res;
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, result, res;
cin >> N >> A >> B;
result = N / (A + B) * A;
res = min(N % (A + B), A);
result = result + res;
cout << result << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {... | replace | 26 | 46 | 26 | 29 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | insert | 322 | 322 | 322 | 323 | 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;
ll r = (a % 10 + b % 10) % 10;
ll t = (n % 10 / r % 10) % 10;
ll w = (n % 10 % r % 10) % 10;
ll d = (t % 10 * a % 10) % 10 + w % 10;
cout << d % 10 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll r = (a + b);
ll t = (n / r);
ll w = (n % r);
ll d = (t * a) + min(a, w);
cout << d << endl;
return 0;
}
| replace | 8 | 13 | 8 | 13 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
int a = 0;
int b = 0;
int x = 0;
int y = 0;
int s = 0;
cin >> n;
cin >> a;
cin >> b;
x = n / (a + b);
y = n % (a + b);
if (y > a) {
s = a * (x + 1);
} else {
s += a * x + y;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n = 0;
int64_t a = 0;
int64_t b = 0;
int64_t x = 0;
int64_t y = 0;
int64_t s = 0;
cin >> n;
cin >> a;
cin >> b;
x = n / (a + b);
y = n % (a + b);
if (y > a) {
s = a * (x + 1);
} else {
s += a * x + y;
}
cout << s <... | replace | 4 | 10 | 4 | 10 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll x = 0;
ll ans = 0;
bool f = false;
while (x < N) {
if (!f) {
if (x + A > N) {
ans += N - x;
break;
}
ans += A;
x += A;
} else {
x += B... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll x = 0;
ll ans = N / (A + B) * A + min(N % (A + B), A);
cout << ans << endl;
return 0;
}
| replace | 10 | 28 | 10 | 11 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
while (n > 0) {
if (n - a < 0) {
ans += n;
break;
}
n -= a;
ans += a;
n -= b;
}
cout << ans;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
long long key = n / (a + b);
long long dog = n % (a + b);
if (dog > a)
dog = a;
ans = key * a + dog;
cout << ans;
return 0;
}
| replace | 8 | 18 | 8 | 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 + ((n % (a + b)) > a ? 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 + ((n % (a + b)) > a ? a : (n % (a + b))) << endl;
return 0;
} | 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;
cout << (n / (a + b) * a + min(a, n % (a + b))) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
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;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
long long n, b, r;
std::cin >> n >> b >> r;
long long count = 0;
if (b == 0)
std::cout << 0 << std::endl;
else if (b + r == n)
std::cout << b << std::endl;
else {
while (n >= b + r) {
count += b;
n -= (b + r);
}
if (n < b)
count += n;
... | #include <iostream>
int main() {
long long n, b, r;
std::cin >> n >> b >> r;
long long count = 0, rem = 0;
// if(b==0)
// std::cout<<0<<std::endl;
// else if(b+r == n)
// std::cout<<b<<std::endl;
// else{
// while(n>=b+r){
// count += b;
// n -= (b+r);
// }
// if(n<b)
// ... | replace | 5 | 21 | 5 | 27 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c, total;
cin >> a >> b >> c;
total = 0;
total += a / (b + c) * b;
a %= (b + c);
for (int i = 0; i < a && i < b; i++)
total++;
cout << total << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, total;
cin >> N >> A >> B;
total = N / (A + B) * A;
N %= (A + B);
total += min(N, A);
cout << total << endl;
}
| replace | 4 | 11 | 4 | 9 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02754 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#in... | replace | 50 | 52 | 50 | 51 | 0 | |
p02754 | C++ | Runtime Error | #include <cmath>
#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) << endl;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 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;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
if (a > 0) {
// nの数だけLoopを回し、nがa+bより大きいか判別する
while (a + b < n) {
if (a + b < n) {
n -= (a + b);
ans += a;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
// ボールの周期に着目する
ll c = a + b;
ll ans = a * (n / c);
// ボールの周期を超えて切れた場合は、小さい方を足す
ans += min(n % c, a);
cout << ans << endl;
} | replace | 9 | 24 | 9 | 15 | 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;
if (A == 0) {
cout << 0;
return 0;
}
ll count = 0;
int flag = 0;
while (count < N) {
if (flag == 0) {
count += A;
ans += A;
flag = 1;
continue;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll ans = 0;
if (A == 0) {
cout << 0;
return 0;
}
ll a, b;
a = N / (A + B);
b = (N - a * (A + B));
if (b < A)
ans = a * A + (N - a * (A + B));
if (b >= A)
ans = (a + 1) * A... | replace | 11 | 27 | 11 | 18 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll sum = 0;
map<char, ll> m;
while (1) {
for (int i = 0; i < a; i++) {
if (sum == n)
break;... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll c = a + b;
ll d = n / c;
ll e = n % c;
if (a < e)
e = a;
cout << d * a + e << endl;
}
| replace | 11 | 32 | 11 | 17 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll n, b, a;
ll cun = 1, c = 0;
cin >> n >> b >> a;
for (ll i = 0; i < n; i++) {
if (cun <= b && b != 0) {
c++;
cun++;
} else if (cun - b < a) {
cun++;
} else {
cun = 1;
}
}
cout << c <<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll n, b, a, x, y;
cin >> n >> a >> b;
x = n / (a + b);
y = min(a, n % (a + b));
cout << x * a + y << "\n";
return (0);
} | replace | 4 | 18 | 4 | 9 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// cin.ignore(); // better to use 2 times getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout << (A + B == C ? "YES" : "NO") << endl;
//__gcd(a,b)
#define pb push_back
#define mk make_pair
#define vll vector<ll>
#define mll map<ll, ll>
#define mlli map<ll, ll>::iterator... | #include <bits/stdc++.h>
using namespace std;
// cin.ignore(); // better to use 2 times getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout << (A + B == C ? "YES" : "NO") << endl;
//__gcd(a,b)
#define pb push_back
#define mk make_pair
#define vll vector<ll>
#define mll map<ll, ll>
#define mlli map<ll, ll>::iterator... | replace | 23 | 24 | 23 | 24 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A / (B + C) * B + min(B, A % (B + C)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
cout << A / (B + C) * B + min(B, A % (B + C)) << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vect... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vect... | insert | 238 | 238 | 238 | 242 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vv = vector<vector<int>>;
using P = pair<int, int>;
int main() {
ull n, a, b;
cin >> n >> a >> b;
ull cnt = 0, i = 1;
while (n >= i * (a + b)) {
cnt... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vv = vector<vector<int>>;
using P = pair<int, int>;
int main() {
ull n, a, b;
cin >> n >> a >> b;
ull cnt = n / (a + b);
n -= cnt * (a + b);
ull ans;... | replace | 11 | 16 | 11 | 13 | TLE | |
p02754 | C++ | Runtime Error |
#include <bits/stdc++.h>
// #include<string.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.t... |
#include <bits/stdc++.h>
// #include<string.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.t... | replace | 73 | 77 | 73 | 78 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
#def... | replace | 33 | 36 | 33 | 35 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a / (b + c) * b + min(b, a % (b + c));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << a / (b + c) * b + min(b, a % (b + c));
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02755 | Python | Runtime Error | A, B = map(int, input().split())
a = [i for i in range(1, 1001) if int(i * 0.08) == A]
b = [i for i in range(1, 1001) if int(i * 0.1) == B]
print(min(set(a) & set(b)))
| A, B = map(int, input().split())
a = [i for i in range(1, 1001) if int(i * 0.08) == A]
b = [i for i in range(1, 1001) if int(i * 0.1) == B]
c = set(a) & set(b)
if len(c):
print(min(c))
else:
print(-1)
| replace | 3 | 4 | 3 | 8 | 0 | |
p02755 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = int(a); i < (int)b; ++i)
#define Graph vector<vecctor<ll>>
#define pairs vector<pair<ll, ll>>
#define pb push_back
using namespace std;
using ll = long long;
const ll INF = 1e18;
const double PI = acos(-1);
t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = int(a); i < (int)b; ++i)
#define Graph vector<vecctor<ll>>
#define pairs vector<pair<ll, ll>>
#define pb push_back
using namespace std;
using ll = long long;
const ll INF = 1e18;
const double PI = acos(-1);
t... | replace | 112 | 113 | 112 | 113 | TLE | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < 1100; i++) {
if (i * 2 / 25 == a && i / 10 == b) {
cout << i << endl;
break;
} else if (i == 1099) {
cout << -1 << endl;
}
}
return -1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < 1100; i++) {
if (i * 2 / 25 == a && i / 10 == b) {
cout << i << endl;
break;
} else if (i == 1099) {
cout << -1 << endl;
}
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | 255 | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | replace | 42 | 43 | 42 | 43 | 0 | |
p02755 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
bool x = true;
int ans = 0;
while (x) {
if (floor(ans * 0.08) == a && floor(ans * 0.1) == b) {
cout << ans << endl;
return 0;
}
ans++;
}
cout << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
bool x = true;
int ans = 0;
while (x && ans < 1010) {
if (floor(ans * 0.08) == a && floor(ans * 0.1) == b) {
cout << ans << endl;
return 0;
}
ans++;
}
cout << -1 << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int i = 1; i <= 10000000; i++) {
int tmp = i * 8, tmp2 = i * 10;
tmp /= 100;
tmp2 /= 100;
if (tmp == A && tmp2 == B) {
cout << i << endl;
return 0;
}
}
assert(false);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int i = 1; i <= 10000000; i++) {
int tmp = i * 8, tmp2 = i * 10;
tmp /= 100;
tmp2 /= 100;
if (tmp == A && tmp2 == B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02755 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) ... | insert | 38 | 38 | 38 | 39 | TLE | |
p02755 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | replace | 249 | 250 | 249 | 250 | 0 | |
p02755 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int a, b;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> a >> b;
int ans;
for (int i = 1; 1... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int a, b;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> a >> b;
int ans;
for (int i = 1; 1... | insert | 23 | 23 | 23 | 27 | TLE | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define oo 0x3f3f3f3fLL
#define sz(s) (int)(s.size())
#define RT(s) return cout << s, 0
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(), v.end()
#define watch(x) cout << (#x) ... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define oo 0x3f3f3f3fLL
#define sz(s) (int)(s.size())
#define RT(s) return cout << s, 0
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(), v.end()
#define watch(x) cout << (#x) ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i <= 1250; i++) {
int k = i * 0.08;
int l = i * 0.1;
if (k == a && l == b) {
cout << i << endl;
exit(1);
}
}
cout << "-1" << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i <= 1250; i++) {
int k = i * 0.08;
int l = i * 0.1;
if (k == a && l == b) {
cout << i << endl;
exit(0);
}
}
cout << "-1" << endl;
}
| replace | 12 | 13 | 12 | 13 | 1 | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | replace | 58 | 60 | 58 | 60 | -11 | |
p02755 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define TASK "file"
#define F first
#define S second
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long i64;
typedef long double dbl;
const dbl PI = acos(-1.0L);
const dbl EPS = 1e-12L;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());... | #include <bits/stdc++.h>
// #define TASK "file"
#define F first
#define S second
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long i64;
typedef long double dbl;
const dbl PI = acos(-1.0L);
const dbl EPS = 1e-12L;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());... | insert | 26 | 26 | 26 | 27 | 0 | |
p02755 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
// using namespace std;
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
uint32_t aa;
uint32_t bb;
uint32_t max ... | #include <iostream>
#include <string>
#include <vector>
// using namespace std;
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
uint32_t aa;
uint32_t bb;
uint32_t max ... | replace | 20 | 21 | 20 | 21 | TLE | |
p02755 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
// Big two primes
#define X 1001100011100001111ll
#define ll long long
#define all(a) a.begin(), a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// Big two primes
#define X 1001100011100001111ll
#define ll long long
#define all(a) a.begin(), a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) f... | replace | 70 | 71 | 70 | 71 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.