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 = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
int n, a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> a >> b;
ll ans = 0;
ans += (n / (a + b)) * a;
ans += min(n % (a + b), a);
cout << ans << endl;
}
| #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 = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
ll n, a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> a >> b;
ll ans = 0;
ans += (n / (a + b)) * a;
ans += min(n % (a + b), a);
cout << ans << endl;
}
| 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) << endl;
}
}
}
| #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 + r) << endl;
}
}
}
| 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 (0)
#define rep(i, n) for (int(i) = (0); (i) < (n); (++i))
#define FOR(i, start, end) for (int(i) = (start); (i) < (end); (++i))
#define foreach(e, elem) for (auto &(e) : (elem))
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define size(s) (s).size()
#define all(vec) (vec).begin(), (vec).end()
#define pb(e) push_back(e);
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ab = n / (a + b);
ll aab = n % (a + b);
ll ans = a * ab;
if (aab <= a) {
ans += aab;
} else {
ans += (aab / a) * a;
}
println(ans);
}
| #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 (0)
#define rep(i, n) for (int(i) = (0); (i) < (n); (++i))
#define FOR(i, start, end) for (int(i) = (start); (i) < (end); (++i))
#define foreach(e, elem) for (auto &(e) : (elem))
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define size(s) (s).size()
#define all(vec) (vec).begin(), (vec).end()
#define pb(e) push_back(e);
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ab = n / (a + b);
ll aab = n % (a + b);
ll ans = a * ab;
ans += min(aab, a);
println(ans);
}
| 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++;
}
}
cout << 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 = 1e-10;
const int64_t INF = 1e18 + 10;
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(0), cout.tie(0)
#define trace(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vi vector<int>
#define vl vector<ll>
#define vs vector<str>
#define vc(x) vector<x>
#define mapll map<ll, ll>
#define mapib map<int, bool>
#define mapiv map<int, vector>
#define mapsi map<string, int>
#define rep(i, j, k) for (ll i = j; i < k; i++)
#define down(i, j, k) for (ll i = j; i >= k; i--)
#define repa(i, n) for (ll i = 0; i < n; i++)
#define dowa(i, n) for (ll i = n; i >= 0; i--)
#define reps(i, j, k, s) for (ll i = j; i < k; i += s)
#define downs(i, j, k, s) for (ll i = j; i >= k; i -= s)
#define trv(i, x) for (auto i : x)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define str string
#define dub double
#define pqmax priority_queue<ll>
#define pqmin priority_queue<ll, vl, greater<ll>>
template <typename t> t lcm(t a, t b) { return (a * b) / __gcd(a, b); }
template <typename t> t gcd(t a, t b) { return __gcd(a, b); }
template <typename t> t mul_mod(t a, t b, t m) {
t res = ((a % m) * (b % m) % m);
return res;
}
template <typename t> t add_mod(t a, t b, t m) {
t res = ((a % m) + (b % m)) % m;
return res;
}
template <typename t> t pow_mod(t a, t b, t m) {
t res = 1;
while (b) {
if (b & 1)
res = mul_mod(res, a, m);
a = mul_mod(a, a, m), b >>= 1;
}
return res % m;
}
template <typename t> vc(t) num_vec(t num) {
t res;
while (num)
res.pb(num % 10), num /= 10;
return res;
}
template <typename t> t vec_num(t vec) {
t res = 0;
ll mul = 1;
repa(i, sz(vec)) res = vec[i] * mul, mul *= 10;
return res;
}
int32_t main(int argc, char **argv) {
fastio();
auto tstart = clock();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
unsigned long long n, a, b;
cin >> n >> a >> b;
if (a == 0 && b == 0)
cout << 0 << endl;
else if (a == 0)
cout << 0 << endl;
else if (b == 0)
cout << n << endl;
else {
unsigned long long q = (n / (a + b));
unsigned long long r = (n % (a + b));
if (r > a)
r = a;
cout << (q * a + r) << endl;
}
cerr << setprecision(2) << fixed
<< "Time elapsed: " << (double)(clock() - tstart) / CLOCKS_PER_SEC
<< endl;
return 0;
} |
/*
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 = 1e-10;
const int64_t INF = 1e18 + 10;
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(0), cout.tie(0)
#define trace(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vi vector<int>
#define vl vector<ll>
#define vs vector<str>
#define vc(x) vector<x>
#define mapll map<ll, ll>
#define mapib map<int, bool>
#define mapiv map<int, vector>
#define mapsi map<string, int>
#define rep(i, j, k) for (ll i = j; i < k; i++)
#define down(i, j, k) for (ll i = j; i >= k; i--)
#define repa(i, n) for (ll i = 0; i < n; i++)
#define dowa(i, n) for (ll i = n; i >= 0; i--)
#define reps(i, j, k, s) for (ll i = j; i < k; i += s)
#define downs(i, j, k, s) for (ll i = j; i >= k; i -= s)
#define trv(i, x) for (auto i : x)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define str string
#define dub double
#define pqmax priority_queue<ll>
#define pqmin priority_queue<ll, vl, greater<ll>>
template <typename t> t lcm(t a, t b) { return (a * b) / __gcd(a, b); }
template <typename t> t gcd(t a, t b) { return __gcd(a, b); }
template <typename t> t mul_mod(t a, t b, t m) {
t res = ((a % m) * (b % m) % m);
return res;
}
template <typename t> t add_mod(t a, t b, t m) {
t res = ((a % m) + (b % m)) % m;
return res;
}
template <typename t> t pow_mod(t a, t b, t m) {
t res = 1;
while (b) {
if (b & 1)
res = mul_mod(res, a, m);
a = mul_mod(a, a, m), b >>= 1;
}
return res % m;
}
template <typename t> vc(t) num_vec(t num) {
t res;
while (num)
res.pb(num % 10), num /= 10;
return res;
}
template <typename t> t vec_num(t vec) {
t res = 0;
ll mul = 1;
repa(i, sz(vec)) res = vec[i] * mul, mul *= 10;
return res;
}
int32_t main(int argc, char **argv) {
fastio();
auto tstart = clock();
unsigned long long n, a, b;
cin >> n >> a >> b;
if (a == 0 && b == 0)
cout << 0 << endl;
else if (a == 0)
cout << 0 << endl;
else if (b == 0)
cout << n << endl;
else {
unsigned long long q = (n / (a + b));
unsigned long long r = (n % (a + b));
if (r > a)
r = a;
cout << (q * a + r) << endl;
}
cerr << setprecision(2) << fixed
<< "Time elapsed: " << (double)(clock() - tstart) / CLOCKS_PER_SEC
<< endl;
return 0;
} | 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 < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
ll n, a, b;
int main() {
cin >> n >> a >> b;
ll ans = 0;
ll total = 0;
while (total < n) {
ll addblue = min(a, n - total);
total += addblue;
ans += addblue;
ll addred = min(b, n - total);
total += addred;
}
printf("%lld\n", ans);
return 0;
}
| #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 < (_loop_int)(b); i++)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); i--)
#define CHMIN(a, b) (a) = min((a), (b))
#define CHMAX(a, b) (a) = max((a), (b))
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
REP(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
ll n, a, b;
int main() {
cin >> n >> a >> b;
ll ans = 0;
ll total = 0;
ll unit = a + b;
ll unitcount = n / unit;
ans += unitcount * a;
total += unitcount * (a + b);
while (total < n) {
ll addblue = min(a, n - total);
total += addblue;
ans += addblue;
ll addred = min(b, n - total);
total += addred;
}
printf("%lld\n", ans);
return 0;
}
| 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;
return 0;
}
}
rep(i, b) {
num++;
if (num == n) {
cout << ans << endl;
return 0;
}
}
}
} | #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
ans += a;
cout << ans << endl;
} | 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 long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
long long cnt = 0;
while (cnt < n) {
if (n - cnt < a) {
ans += n - cnt;
cnt += a;
break;
} else {
ans += a;
cnt += a;
}
cnt += b;
}
cout << ans << endl;
return 0;
}
| #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 long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
long long cy = n / (a + b);
ans += cy * a;
long long yo = n % (a + b);
ans += min(yo, a);
cout << ans << endl;
return 0;
}
| 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;
ll s = 0;
ll bl = 0;
bool blue = 1;
while (s < n) {
if (blue) {
s += a;
bl += a;
} else {
s += b;
}
blue = !blue;
}
if (!blue) {
cout << bl - (s - n) << endl;
} else {
cout << bl << endl;
}
return 0;
} | #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;
ll s = (n / (a + b));
cout << s * a + min(n - s * (a + b), a) << endl;
return 0;
} | 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, ans);
long long int tmp = 1;
while (num < n) {
if (tmp <= a) {
ans++;
}
num++;
tmp++;
}
printf("%lld\n", ans);
return 0;
}
| #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, ans);
long long int tmp = 1;
if ((n - num) < a) {
ans += n - num;
} else {
ans += a;
}
printf("%lld\n", ans);
return 0;
}
| 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;
}
long long g;
if (z <= A)
g = z;
if (z > A)
g = A;
long long ans = A * c + g;
cout << ans << 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;
}
return 0;
}
| 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;
} else {
cout << (counter + 1) * A << endl;
}
} | #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 << (counter + 1) * A << endl;
}
} | 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
x.append(0)
cnt += b
flag = True
cnt = 0
for i in range(n):
if x[i] == 1:
cnt += 1
print(cnt)
| 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;
while (N < n) {
N += a;
res += a;
if (N >= n) {
res -= N - n;
break;
}
N += b;
}
cout << res << endl;
return 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;
res += min(n % (a + b), a);
cout << res << endl;
return 0;
} | 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;
while (true) {
if (N <= cntAll)
break;
cntAll += A;
++cntBlue;
if (N <= cntAll)
break;
cntAll += B;
++cntRed;
}
if (cntBlue == cntRed)
cout << A * cntBlue << endl;
else
cout << N - B * cntRed << endl;
}
int main() {
// A();
B();
return 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;
}
int main() {
// A();
B();
return 0;
} | 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++;
red++;
}
}
cout << res << endl;
return 0;
}
| #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) {
kekka = tmpRoop * b + tmpAmari;
} else {
kekka = tmpRoop * b + b;
}
}
cout << kekka;
}
| #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) {
if (b - tmpAmari >= 0) {
kekka = tmpRoop * b + tmpAmari;
} else {
kekka = tmpRoop * b + b;
}
}
cout << kekka;
}
| 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;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#define ll long long
#define ull unsigned long long
const int MOD = 1000000007;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class T> T absolute(const T &n);
template <class T> void input(vector<T> &vec);
template <class T> void output(const vector<T> &vec);
template <class T> T sum(const vector<T> &vec);
template <class T> double average(const vector<T> &vec);
template <class T> void upsort(vector<T> &vec);
template <class T> void downsort(vector<T> &vec);
template <class T> T max(const vector<T> &vec);
template <class T> T min(const vector<T> &vec);
template <class T> vector<bool> isPrime(T max);
// isPrime[n] はnが素数のときtrue，合成数のときfalseを返す
void combination_init();
ull combination(int n, int r);
// 一度 combination_init() を実行したのち，combination(n,r) で nCr mod MOD
// を返す
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll count = 0, now = n;
while (now >= 0) {
if (now - a >= 0) {
count += a;
now -= a;
// cout << now << endl;
} else {
count += now;
now -= n;
// cout << now << endl;
}
now -= b;
// cout << now << endl;
}
cout << count << endl;
return 0;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class T> T absolute(const T &n) {
if (n < 0) {
return (-n);
}
return n;
}
template <class T> void input(vector<T> &vec) {
for (size_t i = 0; i < vec.size(); ++i) {
cin >> vec.at(i);
}
}
template <class T> void output(const vector<T> &vec) {
for (size_t i = 0; i < vec.size(); ++i) {
cout << vec.at(i) << " ";
}
cout << endl;
}
template <class T> T sum(const vector<T> &vec) {
T initial = 0.0;
T s = accumulate(vec.begin(), vec.end(), initial);
return s;
}
template <class T> double average(const vector<T> &vec) {
double ave = static_cast<double>(sum(vec)) / static_cast<double>(vec.size());
return ave;
}
template <class T> void upsort(vector<T> &vec) { sort(vec.begin(), vec.end()); }
template <class T> void downsort(vector<T> &vec) {
sort(vec.begin(), vec.end(), greater<T>());
}
template <class T> T max(const vector<T> &vec) {
T m = vec.at(0);
for (size_t i = 0; i < vec.size(); ++i) {
m = max(m, vec.at(i));
}
return m;
}
template <class T> T min(const vector<T> &vec) {
T m = vec.at(0);
for (size_t i = 0; i < vec.size(); ++i) {
m = min(m, vec.at(i));
}
return m;
}
template <class T> vector<bool> isPrime(T max) {
vector<bool> isPrime(static_cast<size_t>(max + 1), true);
isPrime[0] = false;
isPrime[1] = false;
for (size_t i = 2; static_cast<int>(i * i) <= max; ++i) {
if (isPrime[i]) {
for (size_t j = 2; static_cast<int>(i * j) <= max; ++j) {
isPrime[i * j] = false;
}
}
}
return isPrime;
}
const ull MAX = 10000000;
ull fac[MAX], finv[MAX], inv[MAX];
void combination_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ull i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ull combination(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#define ll long long
#define ull unsigned long long
const int MOD = 1000000007;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class T> T absolute(const T &n);
template <class T> void input(vector<T> &vec);
template <class T> void output(const vector<T> &vec);
template <class T> T sum(const vector<T> &vec);
template <class T> double average(const vector<T> &vec);
template <class T> void upsort(vector<T> &vec);
template <class T> void downsort(vector<T> &vec);
template <class T> T max(const vector<T> &vec);
template <class T> T min(const vector<T> &vec);
template <class T> vector<bool> isPrime(T max);
// isPrime[n] はnが素数のときtrue，合成数のときfalseを返す
void combination_init();
ull combination(int n, int r);
// 一度 combination_init() を実行したのち，combination(n,r) で nCr mod MOD
// を返す
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll count = 0;
ll num = n / (a + b);
count += num * a;
// cout << num << " " << count << endl;
if (n - num * (a + b) >= a) {
count += a;
// cout << "u\n";
} else {
count += n - num * (a + b);
// cout << "s\n";
}
cout << count << endl;
return 0;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
template <class T> T absolute(const T &n) {
if (n < 0) {
return (-n);
}
return n;
}
template <class T> void input(vector<T> &vec) {
for (size_t i = 0; i < vec.size(); ++i) {
cin >> vec.at(i);
}
}
template <class T> void output(const vector<T> &vec) {
for (size_t i = 0; i < vec.size(); ++i) {
cout << vec.at(i) << " ";
}
cout << endl;
}
template <class T> T sum(const vector<T> &vec) {
T initial = 0.0;
T s = accumulate(vec.begin(), vec.end(), initial);
return s;
}
template <class T> double average(const vector<T> &vec) {
double ave = static_cast<double>(sum(vec)) / static_cast<double>(vec.size());
return ave;
}
template <class T> void upsort(vector<T> &vec) { sort(vec.begin(), vec.end()); }
template <class T> void downsort(vector<T> &vec) {
sort(vec.begin(), vec.end(), greater<T>());
}
template <class T> T max(const vector<T> &vec) {
T m = vec.at(0);
for (size_t i = 0; i < vec.size(); ++i) {
m = max(m, vec.at(i));
}
return m;
}
template <class T> T min(const vector<T> &vec) {
T m = vec.at(0);
for (size_t i = 0; i < vec.size(); ++i) {
m = min(m, vec.at(i));
}
return m;
}
template <class T> vector<bool> isPrime(T max) {
vector<bool> isPrime(static_cast<size_t>(max + 1), true);
isPrime[0] = false;
isPrime[1] = false;
for (size_t i = 2; static_cast<int>(i * i) <= max; ++i) {
if (isPrime[i]) {
for (size_t j = 2; static_cast<int>(i * j) <= max; ++j) {
isPrime[i * j] = false;
}
}
}
return isPrime;
}
const ull MAX = 10000000;
ull fac[MAX], finv[MAX], inv[MAX];
void combination_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ull i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ull combination(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// | 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>
using namespace std;
typedef long long int ll;
#define SP(x) setprecision((int)x)
#define SW(x) setw(x) // 桁数指定
#define SF(c) setfill(c) // 埋め文字指定('0')
#define ALL(v) v.begin(), v.end()
int main(int argc, char const *argv[]) {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
while (n - (a + b) > 0) {
n -= a + b;
ans += a;
}
ans += min(a, n);
cout << ans << endl;
}
| #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>
using namespace std;
typedef long long int ll;
#define SP(x) setprecision((int)x)
#define SW(x) setw(x) // 桁数指定
#define SF(c) setfill(c) // 埋め文字指定('0')
#define ALL(v) v.begin(), v.end()
int main(int argc, char const *argv[]) {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
cout << n / (a + b) * a + min(a, n % (a + b)) << endl;
}
| 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 {
blue += A;
}
cout << blue << endl;
} | #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;
} else {
blue += A;
}
cout << blue << endl;
} | 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) {
if (i % (a + b) <= a)
ans++;
}
cout << ans << endl;
}
return 0;
} | #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);
cout << ans << endl;
}
return 0;
} | 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;
string x;
for (ll i = 0; i < a; i++) {
x += 'b';
}
for (ll i = 0; i < b; i++) {
x += 'r';
}
ll tmp = n % (a + b);
ll tasu;
if (tmp > a) {
tasu = a;
} else if (tmp <= a) {
tasu = tmp;
}
ll tmp2 = n / (a + b);
ll ans = a * tmp2;
cout << ans + tasu << endl;
// cout << 7%8 << endl;//=7
return 0;
}
| #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;
ll tmp = n % (a + b);
ll tasu;
if (tmp > a) {
tasu = a;
} else if (tmp <= a) {
tasu = tmp;
}
ll tmp2 = n / (a + b);
ll ans = a * tmp2;
cout << ans + tasu << endl;
// cout << 7%8 << endl;//=7
return 0;
}
| 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); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
#define MOD 1000000007
int main(void) {
ll N, A, B;
cin >> N >> A >> B;
ll ans = 0, i = 0, x = 0;
vector<char> boll(N + 10);
while (x++ < N) {
REP(j, A) {
if (i < N) {
boll[i++] = 'b';
ans++;
}
}
REP(k, B) {
if (i < N) {
boll[i++] = 'r';
}
}
}
cout << ans << endl;
return 0;
}
| #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); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
#define MOD 1000000007
int main(void) {
ll N, A, B;
cin >> N >> A >> B;
ll C;
C = A + B;
ll ans;
ans = A * (N / C);
ans += min(N % C, A);
cout << ans << endl;
return 0;
}
| 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 (N >= A) {
ans += A;
} else {
ans += N;
}
std::cout << ans << std::endl;
return 0;
}
| #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 += A;
} else {
ans += N;
}
std::cout << ans << std::endl;
return 0;
}
| 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;
return 0;
} | #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 << D * A + F << endl;
return 0;
} | 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) * A + N % (A + B) << endl;
else
cout << (N / (A + B) + 1) * A << endl;
return 0;
}
| #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) * A + N % (A + B) << endl;
else
cout << (N / (A + B) + 1) * A << endl;
return 0;
}
| 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 - k * b << endl;
}
}
return 0;
}
| #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) {
ans += min(A, N - (all_count - A - B));
} else {
ans += A;
}
}
cout << ans << endl;
return 0;
}
| #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);
cout << ans << endl;
return 0;
}
| 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);
additional = N % (A + B);
ac = loops * A;
if (additional >= A) {
ac += A;
} else {
ac += additional;
}
cou(ac);
} | #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);
additional = N % (A + B);
ac = loops * A;
if (additional >= A) {
ac += A;
} else {
ac += additional;
}
cou(ac);
} | 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 < N; ++i) {
if (ball.at(i) == "b")
cnt++;
}
cout << cnt;
}
| #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(-1)
#define mp make_pair
#define pb push_back
#define int long long ////////////
#define MOD 1000000007 ////////
#define POD 998244353 ////////
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define maxc(v) max_element(all(v))
#define minc(v) min_element(all(v))
#define F first
#define S second
#define ppb pop_back
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) (m * n) / GCD(m, n)
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define initarr(a, n, x) \
for (int i = 0; i < n; ++i) \
a[i] = x
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repe(i, a, n) for (int i = a; i <= n; i++)
#define rev(i, a, b) for (int i = a; i >= b; i--)
// define ll long long
#define ld long double
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef vector<pii> vpii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef map<char, int> mci;
#define itv for (auto it = v.begin(); it != v.end(); ++it)
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) \
(find(ALL(container), element) != container.end())
// #define invect(data,n,commands) for(int i = 0;i<n;i++){int
// tmp;cin>>tmp;data.pb(tmp);commands} #define inset(data,n,commands) for(int i
// = 0;i<n;i++){int tmp;cin>>tmp;data.insert(tmp);commands} #define trav(a, x)
// for(auto& a : x) #define display(x) trav(a,x) cout<<a<<" ";cout<<endl
#define bs binary_search
#define lb(v, val) lower_bound(ALL(v), val);
#define ub(v, val) upper_bound(ALL(v), val);
/*
#define dbg1(a) cout<<" *"<<a<<" ";
#define dbg2(a,b) cout<<" *"<<a<<" **"<<b<<" " /////
#define dbg cout<<"move"
*/
#define dbg cerr << "At line " << __LINE__ << " move " << nl
#define dbg1(x) cerr << "At line " << __LINE__ << " " << #x << "=" << x << nl
#define dbg2(x, y) \
cerr << "At line " << __LINE__ << " " << #x << "=" << x << " " << #y << "=" \
<< y << nl
#define dbg3(x, y, z) \
cerr << "At line " << __LINE__ << " " << #x << "=" << x << " " << #y << "=" \
<< y << " " << #z << "=" << z << nl
#define nl "\n"
#define sz(s) (int)((s).size())
#define coutsp(k) \
cout << setprecision( \
k) // set precision (total length k icluding decimal and non decimal)
#define coutfsp(k) \
cout << fixed << setprecision(k) // fixed set precision(after decimal fixing)
#define INF (int)1e18
#define Max(x, y, z) max(x, max(y, z))
#define Min(x, y, z) min(x, min(y, z))
#define vin(v, n) \
; \
vi v(n); \
rep(i, 0, n) cin >> v[i];
#define prv(v) \
; \
rep(i, 0, sz(v)) cerr << v[i] << " ";
#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
// #define siz (int)1e8
#define N 20000
void solve() {
int n, a, b;
cin >> n >> a >> b;
if (a + b == 0) {
cout << 0;
return;
}
int d = (n / (a + b)) * a;
n = n % (a + b);
d += min(a, n);
cout << d;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
FAST
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
cout << nl;
}
return 0;
} | #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(-1)
#define mp make_pair
#define pb push_back
#define int long long ////////////
#define MOD 1000000007 ////////
#define POD 998244353 ////////
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define maxc(v) max_element(all(v))
#define minc(v) min_element(all(v))
#define F first
#define S second
#define ppb pop_back
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) (m * n) / GCD(m, n)
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define initarr(a, n, x) \
for (int i = 0; i < n; ++i) \
a[i] = x
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repe(i, a, n) for (int i = a; i <= n; i++)
#define rev(i, a, b) for (int i = a; i >= b; i--)
// define ll long long
#define ld long double
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef vector<pii> vpii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef map<char, int> mci;
#define itv for (auto it = v.begin(); it != v.end(); ++it)
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) \
(find(ALL(container), element) != container.end())
// #define invect(data,n,commands) for(int i = 0;i<n;i++){int
// tmp;cin>>tmp;data.pb(tmp);commands} #define inset(data,n,commands) for(int i
// = 0;i<n;i++){int tmp;cin>>tmp;data.insert(tmp);commands} #define trav(a, x)
// for(auto& a : x) #define display(x) trav(a,x) cout<<a<<" ";cout<<endl
#define bs binary_search
#define lb(v, val) lower_bound(ALL(v), val);
#define ub(v, val) upper_bound(ALL(v), val);
/*
#define dbg1(a) cout<<" *"<<a<<" ";
#define dbg2(a,b) cout<<" *"<<a<<" **"<<b<<" " /////
#define dbg cout<<"move"
*/
#define dbg cerr << "At line " << __LINE__ << " move " << nl
#define dbg1(x) cerr << "At line " << __LINE__ << " " << #x << "=" << x << nl
#define dbg2(x, y) \
cerr << "At line " << __LINE__ << " " << #x << "=" << x << " " << #y << "=" \
<< y << nl
#define dbg3(x, y, z) \
cerr << "At line " << __LINE__ << " " << #x << "=" << x << " " << #y << "=" \
<< y << " " << #z << "=" << z << nl
#define nl "\n"
#define sz(s) (int)((s).size())
#define coutsp(k) \
cout << setprecision( \
k) // set precision (total length k icluding decimal and non decimal)
#define coutfsp(k) \
cout << fixed << setprecision(k) // fixed set precision(after decimal fixing)
#define INF (int)1e18
#define Max(x, y, z) max(x, max(y, z))
#define Min(x, y, z) min(x, min(y, z))
#define vin(v, n) \
; \
vi v(n); \
rep(i, 0, n) cin >> v[i];
#define prv(v) \
; \
rep(i, 0, sz(v)) cerr << v[i] << " ";
#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
// #define siz (int)1e8
#define N 20000
void solve() {
int n, a, b;
cin >> n >> a >> b;
if (a + b == 0) {
cout << 0;
return;
}
int d = (n / (a + b)) * a;
n = n % (a + b);
d += min(a, n);
cout << d;
}
signed main() {
FAST
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
cout << nl;
}
return 0;
} | 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 i = a; i < n; i++)
#define r0 return 0;
#define endl '\n'
#define INF (int)1e15
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
signed main() {
ios_base::sync_with_stdio(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
int n, a, b;
cin >> n >> a >> b;
int ans = (n / (a + b)) * b;
ans += n % b;
cout << ans;
}
} | #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 i = a; i < n; i++)
#define r0 return 0;
#define endl '\n'
#define INF (int)1e15
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
signed main() {
ios_base::sync_with_stdio(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
int n, a, b;
cin >> n >> a >> b;
int ans = (n / (a + b)) * a;
if (a != 0)
ans += min(a, n % (a + b));
cout << ans;
}
} | 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;
}
cout << ans << endl;
return 0;
}
| #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;
}
cout << ans << endl;
return 0;
}
| 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;
}
cout << ans << endl;
return 0;
}
| #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;
ans += diff;
diff = min(n, b);
n -= diff;
}
cout << ans << endl;
return 0;
}
| 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++)
#define fast ios_base::sync_with_stdio(false);
#define Test \
ll q; \
cin >> q; \
while (q--)
#define ph push_back
#define f first
#define s second
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
ll cnt = a / (b + c);
ll ans = cnt * b;
cnt = a % (b + c);
if (cnt > b)
ans += b;
else
ans += cnt;
cout << ans;
}
| #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++)
#define fast ios_base::sync_with_stdio(false);
#define Test \
ll q; \
cin >> q; \
while (q--)
#define ph push_back
#define f first
#define s second
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll cnt = a / (b + c);
ll ans = cnt * b;
cnt = a % (b + c);
if (cnt > b)
ans += b;
else
ans += cnt;
cout << ans;
}
| 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 <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++) // 0から
#define REP(i, n) for (int j = i; j < n; j++) // iから
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) {
int z = v.size();
n = 1;
while (n < z)
n *= 2; // 一番下の段
node.resize(2 * n - 1, 0);
for (int i = 0; i < z; i++)
node[(n - 1) + i] = v[i]; // 一番下の段
for (int i = n - 2; i >= 0; i--) {
node[i] = compare(node[i * 2 + 1], node[i * 2 + 2]);
}
}
int compare(int a, int b) { return (a | b); }
void update(int i, int val) {
i += n - 1;
node[i] = val;
while (i > 0) {
i = (i - 1) / 2;
node[i] = compare(node[2 * i + 1], node[2 * i + 2]);
}
}
int find(int a, int b, int now = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
// cout<<a<<' '<<b<<" ";
// cout<<now<<' '<<l<<' '<<r<<endl;
if (r <= a || b < l)
return 0; // 単位元的な
// if((a <= l && r <= b + 1) || 2 * (now+1) >= 2*n - 1 ) return node[now];
if (a <= l && r <= b + 1)
return node[now];
int vl = find(a, b, 2 * now + 1, l, (l + r) / 2);
int vr = find(a, b, 2 * now + 2, (l + r) / 2, r);
return compare(vl, vr);
}
int number(int m) {
int tmp = 0;
while (m > 0) {
if (m % 2 == 1)
tmp++;
m /= 2;
}
return tmp;
}
};
ll kaijo(ll n) {
if (n == 0)
return 1;
return n * kaijo(n - 1);
}
ll POW(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1 == 1) {
ans *= x;
}
x *= x;
n >>= 1;
}
return ans;
}
ll combination(ll a, ll b) {
ll tmp;
tmp = kaijo(a) / (kaijo(b) * kaijo(a - b));
return tmp;
}
vector<bool> is_prime;
void Eratosthenes(ll n) {
is_prime.resize(n + 1, true);
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
for (ll j = i * i; j <= n; j++) {
is_prime[j] = false;
}
}
}
}
// 素数列挙
vector<ll> Prime;
void Prime_Enumeration(ll n) {
Eratosthenes(n);
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
Prime.push_back(i);
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return r;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll l = (a * b) / g;
return l;
}
// aが負の時でも余りを非負にしたいとき
ll mod(ll a, ll m) { return (a % m + m) % m; }
// 拡張ユークリッド ap + bq = gcd(a,b)
ll extGCD(ll a, ll b, ll &p, ll &q) {
if (b == 0) {
p = 1;
q = 0;
return a;
}
ll d = extGCD(b, a % b, q, p);
q -= a / b * p;
return d;
}
// 中国剰余定理
pair<ll, ll> ChineseRem(ll b1, ll m1, ll b2, ll m2) {
ll p, q;
ll d = extGCD(m1, m2, p, q);
if ((b2 - b1) % d != 0)
return make_pair(0, -1); // 解なし
ll m = m1 * (m2 / d);
ll tmp = (b2 - b1) / d * p % (m2 / d);
ll r = mod(b1 + m1 * tmp, m);
return make_pair(r, m);
}
// mod.mでのa^{-1}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
const ll MOD = 1000000007;
// key以上のうち最小の要素のindex
int binary_search(ll *a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
// 英字ならture、数字ならfalse
bool isalpha(char s) {
if (('A' <= s && s <= 'Z') || ('a' <= s && s <= 'z')) {
return 1;
} else {
return 0;
}
}
// 全ての文字が英字ならture、数字ならfalse
bool Isalpha(string s) {
ll n;
bool tmp = true;
rep(i, n) {
if (isalpha(s[i])) {
tmp = false;
}
}
return tmp;
}
string YES(bool a) { return a ? "YES" : "NO"; }
string Yes(bool a) { return a ? "Yes" : "No"; }
void f(ll n, vector<ll> v) {
for (int i = 1; i <= n; i++) {
v[i] = 0;
for (int h = n; h >= 1; h--) {
v[i] += h - i + 1;
}
}
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll cnt = 0, ans = 0;
;
bool auth = true;
while (cnt < n) {
if (auth) {
if (cnt + a <= n) {
ans += a;
} else {
ans += n - cnt;
}
cnt += a;
auth = false;
} else {
cnt += b;
auth = true;
}
}
cout << ans << endl;
return 0;
} | #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 <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++) // 0から
#define REP(i, n) for (int j = i; j < n; j++) // iから
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) {
int z = v.size();
n = 1;
while (n < z)
n *= 2; // 一番下の段
node.resize(2 * n - 1, 0);
for (int i = 0; i < z; i++)
node[(n - 1) + i] = v[i]; // 一番下の段
for (int i = n - 2; i >= 0; i--) {
node[i] = compare(node[i * 2 + 1], node[i * 2 + 2]);
}
}
int compare(int a, int b) { return (a | b); }
void update(int i, int val) {
i += n - 1;
node[i] = val;
while (i > 0) {
i = (i - 1) / 2;
node[i] = compare(node[2 * i + 1], node[2 * i + 2]);
}
}
int find(int a, int b, int now = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
// cout<<a<<' '<<b<<" ";
// cout<<now<<' '<<l<<' '<<r<<endl;
if (r <= a || b < l)
return 0; // 単位元的な
// if((a <= l && r <= b + 1) || 2 * (now+1) >= 2*n - 1 ) return node[now];
if (a <= l && r <= b + 1)
return node[now];
int vl = find(a, b, 2 * now + 1, l, (l + r) / 2);
int vr = find(a, b, 2 * now + 2, (l + r) / 2, r);
return compare(vl, vr);
}
int number(int m) {
int tmp = 0;
while (m > 0) {
if (m % 2 == 1)
tmp++;
m /= 2;
}
return tmp;
}
};
ll kaijo(ll n) {
if (n == 0)
return 1;
return n * kaijo(n - 1);
}
ll POW(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1 == 1) {
ans *= x;
}
x *= x;
n >>= 1;
}
return ans;
}
ll combination(ll a, ll b) {
ll tmp;
tmp = kaijo(a) / (kaijo(b) * kaijo(a - b));
return tmp;
}
vector<bool> is_prime;
void Eratosthenes(ll n) {
is_prime.resize(n + 1, true);
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
for (ll j = i * i; j <= n; j++) {
is_prime[j] = false;
}
}
}
}
// 素数列挙
vector<ll> Prime;
void Prime_Enumeration(ll n) {
Eratosthenes(n);
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
Prime.push_back(i);
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return r;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll l = (a * b) / g;
return l;
}
// aが負の時でも余りを非負にしたいとき
ll mod(ll a, ll m) { return (a % m + m) % m; }
// 拡張ユークリッド ap + bq = gcd(a,b)
ll extGCD(ll a, ll b, ll &p, ll &q) {
if (b == 0) {
p = 1;
q = 0;
return a;
}
ll d = extGCD(b, a % b, q, p);
q -= a / b * p;
return d;
}
// 中国剰余定理
pair<ll, ll> ChineseRem(ll b1, ll m1, ll b2, ll m2) {
ll p, q;
ll d = extGCD(m1, m2, p, q);
if ((b2 - b1) % d != 0)
return make_pair(0, -1); // 解なし
ll m = m1 * (m2 / d);
ll tmp = (b2 - b1) / d * p % (m2 / d);
ll r = mod(b1 + m1 * tmp, m);
return make_pair(r, m);
}
// mod.mでのa^{-1}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
const ll MOD = 1000000007;
// key以上のうち最小の要素のindex
int binary_search(ll *a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
// 英字ならture、数字ならfalse
bool isalpha(char s) {
if (('A' <= s && s <= 'Z') || ('a' <= s && s <= 'z')) {
return 1;
} else {
return 0;
}
}
// 全ての文字が英字ならture、数字ならfalse
bool Isalpha(string s) {
ll n;
bool tmp = true;
rep(i, n) {
if (isalpha(s[i])) {
tmp = false;
}
}
return tmp;
}
string YES(bool a) { return a ? "YES" : "NO"; }
string Yes(bool a) { return a ? "Yes" : "No"; }
void f(ll n, vector<ll> v) {
for (int i = 1; i <= n; i++) {
v[i] = 0;
for (int h = n; h >= 1; h--) {
v[i] += h - i + 1;
}
}
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll cnt = 0, ans = 0;
;
ans = (n / (a + b)) * a;
cnt = (n / (a + b)) * (a + b);
ans += min(n - cnt, a);
cout << ans << endl;
return 0;
} | 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) * B;
ans += min(B, N % (B + R));
cout << ans << endl;
}
| #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) * B;
ans += min(B, N % (B + R));
cout << ans << endl;
}
| 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);
return y;
}
int main() {
long long int n, a, b, res;
cin >> n >> a >> b;
res = ball(n, a, b);
cout << res << endl;
return 0;
} | #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;
res = ball(n, a, b);
cout << res << endl;
return 0;
} | 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;
}
cout << ans << endl;
}
return 0;
}
| #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;
}
cout << ans << endl;
}
return 0;
}
| 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
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A) {
cout << N - N / (A + B) * B << endl;
} else
cout << N / (A + B) * A + A << endl;
}
| #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
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B;
cin >> N >> A >> B;
if (N % (A + B) <= A) {
cout << N - N / (A + B) * B << endl;
} else
cout << N / (A + B) * A + A << endl;
}
| 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 >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, from, to) for (int i = (from); i < (int)(to); i++)
#define all(obj) (obj).begin(), (obj).end()
#define lpair pair<ll, ll>
#define vint vector<ll>
#define vinput(name) \
for (int i = 0; i < (int)(name.size()); i++) \
cin >> name[i];
#define voutput(name) \
for (int i = 0; i < (int)(name.size()); i++) \
cout << name[i] << endl;
typedef long long ll;
using namespace std;
ll ans = 0;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
return 0;
} | #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 >> 1
#define SIZE 100010
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, from, to) for (int i = (from); i < (int)(to); i++)
#define all(obj) (obj).begin(), (obj).end()
#define lpair pair<ll, ll>
#define vint vector<ll>
#define vinput(name) \
for (int i = 0; i < (int)(name.size()); i++) \
cin >> name[i];
#define voutput(name) \
for (int i = 0; i < (int)(name.size()); i++) \
cout << name[i] << endl;
typedef long long ll;
using namespace std;
ll ans = 0;
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
return 0;
} | 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 T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
while (true) {
if (n > a + b) {
n -= a + b;
ans += a;
} else if (n > a) {
ans += a;
break;
} else {
ans += n;
break;
}
}
cout << ans << endl;
return 0;
} | #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 T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = (n / (a + b)) * a;
n %= (a + b);
if (n >= a)
ans += a;
else
ans += n;
cout << ans << endl;
return 0;
} | 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 long> vll;
typedef pair<int, int> pii;
const ll INF = ll(1e18) + 1;
//--------------------------------------------------
ulli gcd(ulli a, ulli b) { return (b <= 0) ? a : gcd(b, a % b); }
ulli lcm(ulli a, ulli b) { return a * b / gcd(a, b); }
//---------------------------------------------------
void Main() {
ll n, b, r, ans = 0;
cin >> n >> b >> r;
rep(i, n) {
if ((i + 1) % (b + r) < b)
ans++;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
} | #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 long> vll;
typedef pair<int, int> pii;
const ll INF = ll(1e18) + 1;
//--------------------------------------------------
ulli gcd(ulli a, ulli b) { return (b <= 0) ? a : gcd(b, a % b); }
ulli lcm(ulli a, ulli b) { return a * b / gcd(a, b); }
//---------------------------------------------------
void Main() {
ll n, b, r, ans = 0;
cin >> n >> b >> r;
ll sum = b + r;
ans += (n / sum) * b;
ll surplus = n % sum;
if (surplus <= b)
ans += surplus;
else
ans += b;
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
} | 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) {
cur += B;
} else {
break;
}
}
cout << ans << endl;
} | #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++)
res++;
cout << res << endl;
return 0;
} | #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;
} else {
res += n % (a + b);
}
}
cout << res << endl;
return 0;
} | 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.