problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, blue, red, anadir;
cin >> N >> blue >> red;
if (N % (blue + red) <= blue)
anadir = N % (blue + red);
else
anadir = blue;
cout << ((N / (blue + red)) * blue) + anadir;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, blue, red, anadir;
cin >> N >> blue >> red;
if (N % (blue + red) <= blue)
anadir = N % (blue + red);
else
anadir = blue;
cout << ((N / (blue + red)) * blue) + anadir;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
int A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t N;
int64_t A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a + min(a, n % (a + b));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n, a, b;
unsigned long long ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a + min(a, n % (a + b));
cout << ans << endl;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e9 + 7;
const ll mod = 1e9 + 7;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << a * (n / (a + b)) + min(n % (a + b), a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e9 + 7;
const ll mod = 1e9 + 7;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << a * (n / (a + b)) + min(n % (a + b), a) << endl;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
long long n, a, b;
cin >> n >> a >> b;
string ans;
for (int i = 0; i < n; i++) {
if (ans.length() <= n) {
ans += string(a, 'b');
ans += string(b, 'r');
}
}
long long cnt = 0;
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < n; i++) {
if (ans[i] == 'b')
cnt++;
if (ans[i] == 'a')
break;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
long long n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | replace | 6 | 22 | 6 | 7 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPR(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define FORR(i, m, n) for (int i = (int)m - 1; i >= (int)n; i--)
#define ASC(v) sort(v.begin(), v.end());
#define DESC(v) sort(v.begin(), v.end(), greater<int>());
#define REVERSE(v) reverse(v.begin(), v.end());
#define DEBUG(x) cout << #x << ": " << x << "\n"
typedef long long ll;
struct nya {
nya() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} nyan;
int main() {
ll N, A, B;
cin >> N >> A >> B;
string s;
if (A == 0) {
cout << 0 << "\n";
return 0;
}
ll res = 0;
while (N > 0) {
REP(i, A) {
res++;
N--;
if (N == 0) {
cout << res << "\n";
return 0;
}
}
REP(i, B) {
N--;
if (N == 0) {
cout << res << "\n";
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPR(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define FORR(i, m, n) for (int i = (int)m - 1; i >= (int)n; i--)
#define ASC(v) sort(v.begin(), v.end());
#define DESC(v) sort(v.begin(), v.end(), greater<int>());
#define REVERSE(v) reverse(v.begin(), v.end());
#define DEBUG(x) cout << #x << ": " << x << "\n"
typedef long long ll;
struct nya {
nya() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} nyan;
int main() {
ll N, A, B;
cin >> N >> A >> B;
string s;
if (A == 0) {
cout << 0 << "\n";
return 0;
}
ll res = N / (A + B) * A;
ll rem = N % (A + B);
res += min(rem, A);
cout << res << "\n";
}
| replace | 28 | 46 | 28 | 32 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + (N % (A + B)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) >= A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + (N % (A + B)) << endl;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b = 0;
int shou, amari = 0;
cin >> n >> a >> b;
shou = n / (a + b);
amari = n % (a + b);
if (amari <= a) {
cout << shou * a + amari;
} else {
cout << shou * a + a;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b = 0;
long shou, amari = 0;
cin >> n >> a >> b;
shou = n / (a + b);
amari = n % (a + b);
if (amari <= a) {
cout << shou * a + amari;
} else {
cout << shou * a + a;
}
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
long long aa = (N / (A + B)) * A;
long long rest = N - (aa / A) * (A + B);
if (rest >= A)
aa += A;
else
aa += rest;
cout << aa << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (A > 0) {
long long aa = (N / (A + B)) * A;
long long rest = N - (aa / A) * (A + B);
if (rest >= A)
aa += A;
else
aa += rest;
cout << aa << endl;
} else
cout << 0 << endl;
}
| replace | 6 | 13 | 6 | 16 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define int long long int
#define MOD 1000000007
#define mkp make_pair
#define maxN 100005
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repl(i, a, b) for (int i = a; i < b; i++)
#define pi pair<int, int>
#define pii pair<int, pi>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define vi vector<int>
#define st set<int>
#define mst multiset<int>
#define pq priority_queue
#define mpq priority_queue<int, vector<int>, greater<int>>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define in cin >>
#define out cout <<
using namespace std;
const int infi = 1e9 + 7;
void printVector(vector<int> v) {
for (int i = 0; i < (int)v.size(); i++)
cout << v[i] << " ";
out endl;
}
void printArray(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << ' ';
cout << endl;
}
set<pair<int, int>> primeset;
vi prime_number;
void SieveOfEratosthenes(int n) {
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
primeset.insert(mkp(p, 1));
}
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
int32_t main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int t = 1;
// in t;
while (t--) {
int n;
in n;
int a;
in a;
int b;
in b;
int part = (n) / (a + b);
int rem = n % (a + b);
int ans = part * a + min(rem, a) + 0;
cout << ans << endl;
}
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define int long long int
#define MOD 1000000007
#define mkp make_pair
#define maxN 100005
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repl(i, a, b) for (int i = a; i < b; i++)
#define pi pair<int, int>
#define pii pair<int, pi>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define vi vector<int>
#define st set<int>
#define mst multiset<int>
#define pq priority_queue
#define mpq priority_queue<int, vector<int>, greater<int>>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define in cin >>
#define out cout <<
using namespace std;
const int infi = 1e9 + 7;
void printVector(vector<int> v) {
for (int i = 0; i < (int)v.size(); i++)
cout << v[i] << " ";
out endl;
}
void printArray(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << ' ';
cout << endl;
}
set<pair<int, int>> primeset;
vi prime_number;
void SieveOfEratosthenes(int n) {
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
primeset.insert(mkp(p, 1));
}
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
int32_t main() {
fastio;
int t = 1;
// in t;
while (t--) {
int n;
in n;
int a;
in a;
int b;
in b;
int part = (n) / (a + b);
int rem = n % (a + b);
int ans = part * a + min(rem, a) + 0;
cout << ans << endl;
}
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| delete | 73 | 76 | 73 | 73 | 0 | Time elapsed: 0.026138 s.
|
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll i, j, n, b, r, c = 0;
cin >> n >> b >> r;
l1:
ll val = n / (b + r);
c += val * b;
ll val2 = n % (b + r);
if (val2 <= b)
c += val2;
else {
n = val2;
goto l1;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll i, j, n, b, r, c = 0;
cin >> n >> b >> r;
l1:
ll val = n / (b + r);
c = val * (b + r);
ll val2 = n - c;
if (val2 > b)
val2 = b;
cout << val * b + val2;
} | replace | 8 | 17 | 8 | 13 | TLE | |
p02754 | C++ | Time Limit Exceeded | /*
* atcoder/abc158/b.cpp
*/
// C++ 14
#include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define Int ll
#define loop(__x, __start, __end) for (Int __x = __start; __x < __end; __x++)
#define loopdown(__x, __start, __end) \
for (Int __x = __start; __x > __end; __x--)
#define rep(__n) for (Int __x = 0; __x < __n; __x++)
#define span(__a, __x, __y) __a.begin() + __x, __a.begin() + __y
#define span_all(__a) __a.begin(), __a.end()
#define len(__x) (__x.size())
#define last(__x) (__x[__x.size() - 1])
using namespace std;
struct Point {
Int x, y;
Point(Int x, Int y) : x(x), y(y) {}
Point() : x(0), y(0) {}
Point operator+(Point v) { return Point(x + v.x, y + v.y); }
Point operator-(Point v) { return Point(x - v.x, y - v.y); }
bool operator==(const Point &v) const { return x == v.x && y == v.y; }
bool operator<(const Point &p1) const { return x < p1.x && y < p1.y; }
};
ostream &operator<<(ostream &out, Point const &v) {
out << "Point(" << v.x << ", " << v.y << ')';
return out;
}
istream &operator>>(istream &in, Point &v) {
Int x, y;
in >> x;
in >> y;
v.x = x;
v.y = y;
return in;
}
// Geometry
#define EPS 0.0000000001
class Vector2 {
public:
double x, y;
Vector2(double x = 0, double y = 0) : x(x), y(y) {}
Vector2 operator+(Vector2 v) { return Vector2(x + v.x, y + v.y); }
Vector2 operator-(Vector2 v) { return Vector2(x - v.x, y - v.y); }
Vector2 operator*(double k) { return Vector2(x * k, y * k); }
Vector2 operator/(double k) { return Vector2(x / k, y / k); }
double length() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
double dot(Vector2 v) { return x * v.x + y * v.y; }
double cross(Vector2 v) { return x * v.y - y * v.x; }
bool operator<(const Vector2 &v) const {
return x != v.x ? x < v.x : y < v.y;
}
bool operator==(const Vector2 &v) const {
return fabs(x - v.x) < EPS && fabs(y - v.y) < EPS;
}
};
ostream &operator<<(ostream &out, Vector2 const &v) {
out << "Vector2(" << v.x << ", " << v.y << ')';
return out;
}
istream &operator>>(istream &in, Vector2 &v) {
double x, y;
in >> x;
in >> y;
v.x = x;
v.y = y;
return in;
}
vector<Int> slice(vector<Int> &vec, int s, int t) {
return vector<Int>(vec.begin() + s, vec.begin() + t);
}
vector<Int> trim(vector<Int> &vec, int n) {
auto init = slice(vec, 0, n);
auto tail = slice(vec, n + 2, vec.size());
init.insert(init.end(), tail.begin(), tail.end());
return init;
}
// 10 1 1
// b r b r b r b r b r = 5
// 10 3 1
// b b b r b b b r b b =
Int N, A, B;
void input() { cin >> N >> A >> B; }
void solve() {
Int count = 0;
Int n = 0;
if (A == 1 && B == 0) {
cout << N << endl;
return;
}
if (A == 0 && B == 1) {
cout << 0 << endl;
return;
}
while (n < N) {
count += min(A, N - n);
n += A + B;
}
cout << count << endl;
}
int main() {
input();
solve();
return 0;
}
| /*
* atcoder/abc158/b.cpp
*/
// C++ 14
#include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define Int ll
#define loop(__x, __start, __end) for (Int __x = __start; __x < __end; __x++)
#define loopdown(__x, __start, __end) \
for (Int __x = __start; __x > __end; __x--)
#define rep(__n) for (Int __x = 0; __x < __n; __x++)
#define span(__a, __x, __y) __a.begin() + __x, __a.begin() + __y
#define span_all(__a) __a.begin(), __a.end()
#define len(__x) (__x.size())
#define last(__x) (__x[__x.size() - 1])
using namespace std;
struct Point {
Int x, y;
Point(Int x, Int y) : x(x), y(y) {}
Point() : x(0), y(0) {}
Point operator+(Point v) { return Point(x + v.x, y + v.y); }
Point operator-(Point v) { return Point(x - v.x, y - v.y); }
bool operator==(const Point &v) const { return x == v.x && y == v.y; }
bool operator<(const Point &p1) const { return x < p1.x && y < p1.y; }
};
ostream &operator<<(ostream &out, Point const &v) {
out << "Point(" << v.x << ", " << v.y << ')';
return out;
}
istream &operator>>(istream &in, Point &v) {
Int x, y;
in >> x;
in >> y;
v.x = x;
v.y = y;
return in;
}
// Geometry
#define EPS 0.0000000001
class Vector2 {
public:
double x, y;
Vector2(double x = 0, double y = 0) : x(x), y(y) {}
Vector2 operator+(Vector2 v) { return Vector2(x + v.x, y + v.y); }
Vector2 operator-(Vector2 v) { return Vector2(x - v.x, y - v.y); }
Vector2 operator*(double k) { return Vector2(x * k, y * k); }
Vector2 operator/(double k) { return Vector2(x / k, y / k); }
double length() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
double dot(Vector2 v) { return x * v.x + y * v.y; }
double cross(Vector2 v) { return x * v.y - y * v.x; }
bool operator<(const Vector2 &v) const {
return x != v.x ? x < v.x : y < v.y;
}
bool operator==(const Vector2 &v) const {
return fabs(x - v.x) < EPS && fabs(y - v.y) < EPS;
}
};
ostream &operator<<(ostream &out, Vector2 const &v) {
out << "Vector2(" << v.x << ", " << v.y << ')';
return out;
}
istream &operator>>(istream &in, Vector2 &v) {
double x, y;
in >> x;
in >> y;
v.x = x;
v.y = y;
return in;
}
vector<Int> slice(vector<Int> &vec, int s, int t) {
return vector<Int>(vec.begin() + s, vec.begin() + t);
}
vector<Int> trim(vector<Int> &vec, int n) {
auto init = slice(vec, 0, n);
auto tail = slice(vec, n + 2, vec.size());
init.insert(init.end(), tail.begin(), tail.end());
return init;
}
// 10 1 1
// b r b r b r b r b r = 5
// 10 3 1
// b b b r b b b r b b =
Int N, A, B;
void input() { cin >> N >> A >> B; }
void solve() {
Int c = A + B;
Int n = N / c;
Int m = N % c;
Int ans = (n * A) + min(A, m);
cout << ans << endl;
}
int main() {
input();
solve();
return 0;
}
| replace | 118 | 135 | 118 | 123 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, red, blue, ans, rem;
cin >> n >> blue >> red;
ans = n / (red + blue) * blue;
rem = n % (red + blue);
ans += min(rem, blue);
cout << ans;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, red, blue, ans, rem;
cin >> n >> blue >> red;
ans = n / (red + blue) * blue;
rem = n % (red + blue);
ans += min(rem, blue);
cout << ans;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define FOR(x, z, y) for (ll x = z; x < (ll)y; x++)
int main() {
int n, a, b, blue = 0;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define FOR(x, z, y) for (ll x = z; x < (ll)y; x++)
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, X, Y, ans;
cin >> N >> A >> B;
X = N / (A + B);
Y = N % (A + B);
if (Y > A) {
ans = A * X + A;
} else {
ans = A * X + Y;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, X, Y, ans;
cin >> N >> A >> B;
X = N / (A + B);
Y = N % (A + B);
if (Y > A) {
ans = A * X + A;
} else {
ans = A * X + Y;
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
/*繰り返し*/
#define rep1(n) for (ll i = 0; i < n; ++i) // n回repeat
#define rep2(i, n) for (ll i = 0; i < n; ++i) // n回repeat（変数指定）
#define rep3(i, a, b) for (ll i = a; i < b; ++i) // a-bまでrepeat
#define rep4(i, a, b, c) \
for (ll i = a; i < b; i += c) // a-bまで公差cでrepeat（等差数列で使えそう）
#define rep(...) \
overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) // repeatまとめ
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, \
rrep1)(__VA_ARGS__) // 逆repeatまとめ
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) \
overload4(__VA_ARGS__, each3, each2, \
each1)(__VA_ARGS__) // 配列の各要素の読み出し
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) \
overload3(__VA_ARGS__, all3, all2, \
all1)(__VA_ARGS__) // vectorの始めと終わりの読み取り
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) \
overload3(__VA_ARGS__, rall3, rall2, \
rall1)(__VA_ARGS__) // 逆イテレータの取得(rbegin：末尾,rend：頭）
#define sum(...) \
accumulate( \
all(__VA_ARGS__), \
0LL) // vectorの合計(int形で受け付けてしまうので，小数で扱いたい場合はdsumを使う)
#define dsum(...) \
accumulate(all(__VA_ARGS__), 0.0L) // 小数で扱う(long long doubleなど)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
/*標準入力*/
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__) // int型標準入力受付，以下LDまで同様
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
/*vector操作*/
#define Sort(a) sort(all(a)) // 昇順ソート
#define RSort(vec) sort(vec.begin(), vec.end(), greater<ll>()) // 降順ソート
#define Rev(a) reverse(all(a)) // 逆順
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__) // type型vectorの定義
#define VEC(type, name, size) \
vector<type> name(size); \
in(name) // type型vector(size指定)標準入力受付
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define IV(type, name, size) \
vector<pair<int, int>> name; \
for (int i = 0; i < size; i++) { \
int a_i; \
cin >> a_i; \
name.emplace_back(a_i, i); \
} // Indexつきvector（pair型Vector,(data,index)）
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
} // cout<<t<<endl
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
/*判定出力*/
int first(bool i = true) {
return out(i ? "first" : "second");
} // iがfirstか判断，以下同様
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
/*vector探索*/
#define bSearch(v, k) \
binary_search(all(v), k) // ソートされた配列vの中の要素にkがあるか(boolean)
#define lowB(v, k) \
lower_bound(all(v), \
k) // ソートされた配列vの中の要素のうちk以上かつ最小のイテレータ
#define DLbetB(v, k) lowB(v, k) - v.begin() // 先頭からの距離
#define DLbetE(v, k) v.end() - lowB(v, k) // 末尾からの距離
#define uppB(v, k) \
upper_bound( \
all(v), \
k) // ソートされた配列vの中の要素のうちkより大きいかつ最小のイテレータ
#define DUbetB(v, k) uppB(v, k) - v.begin() // 先頭からの距離
#define DUbetE(v, k) v.end() - uppB(v, k) // 末尾からの距離
#define Cnt(v, k) count(all(v), k) // 配列vの中で要素kが何個あるかを返す(size_t)
#define CntIf(v, l) \
count_if(all(v), \
l) // 配列vの中で条件式(lambda式)を満たす個数を返す(ex.int num =
// count_if(v.begin(), v.end(), [](int i){return i % 3 == 0;});)
#define Sort2D(myVec, i) \
sort(myVec.begin(), myVec.end(), \
[](const vector<ll> &alpha, const vector<ll> &beta) { \
return alpha[i] < beta[i]; \
}); // i列めでソート
/*最大公約数*/
template <class T> T vgcd(T m, T n) { return gcd(m, n); }
template <class T, class... Args> T vgcd(T a, Args... args) {
return vgcd(a, vgcd(args...));
}
/*階乗*/
ll facctorialMethod(ll k) {
int sum = 1;
for (ll i = 1; i <= k; ++i) {
sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
}
return sum;
}
/*組み合わせnCk*/
ll comb(const ll N, const ll K) {
vector<vector<long long int>> v(N + 1, vector<long long int>(N + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
return v[N][K];
}
/*逆元 あまりの割り算をするときにこいつをかける*/
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/*ダブリング*/
/*
参考：http://satanic0258.hatenablog.com/entry/2017/02/23/222647
使える場所：1回遷移した先が明確にわかる時
目的：
・ある数XのQ乗を求める
・根付き木において、ある頂点vのQ個上の親を知る
・ある地点からQ回進んだ先を求める
*/
// int N; // 全体の要素数
// int Q;//試行回数
ll doubling(
const ll N, const ll Q,
vector<ll> a) { // cin>>N>>Q;//標準入力から要素数と試行回数を受け取る場合
ll LOG_Q = floor(log2(Q)) + 1;
// next[k][i]で、i番目の要素の「2^k個次の要素」を指す
// (なお、i番目の要素に対して「2^k個次の要素」が存在しないとき、
// next[k][i]が指し示す要素番号を-1とします)
std::vector<std::vector<ll>> next(LOG_Q + 1, std::vector<ll>(N));
// ll a[N];//各要素の次の行き先
// next[0]を計算
for (int i = 0; i < N; ++i) {
next[0][i] = a[i];
}
// nextを計算
for (ll k = 0; k < LOG_Q; ++k) {
for (int i = 0; i < N; ++i) {
if (next[k][i] == -1) {
// 2^k個次に要素が無い時、当然2^(k+1)個次にも要素はありません
next[k + 1][i] = -1;
} else {
// 「2^k個次の要素」の2^k個次の要素は、2^(k+1)個次の要素です
next[k + 1][i] = next[k][next[k][i]];
}
}
}
// ----ここまで準備----
// p番目の要素の「Q個次の要素」を求めることを考えます
ll p = 0;
for (ll k = LOG_Q - 1; k >= 0; --k) {
if (p == -1) {
// pがすでに存在しない要素を指していたら、
// それ以降で存在する要素を指すことはないためループを抜けます
break;
}
if ((Q >> k) & 1) { // ex(Q=5)5=101(2)であり，2^2+2^0回進むことを表す
// Qを二進展開した際、k番目のビットが立っていたら、
// pの位置を2^kだけ次にずらします
p = next[k][p];
}
}
return p; // ここでのpが最終的な答えになる
}
/*素数判定*/
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
/*ページのソースを表示->command+F->問題文 で問題文コピペする
*/
// deque<ll> deq;//両端キュー使う，先頭と末尾へのアクセスが早い
signed main() {
/*以下コード*/
LL(n, a, b);
ll ans = 0;
rep(LINF) {
if (n < a + b) {
if (n < a)
ans += n;
else
ans += a;
break;
} else {
ans += a;
n -= a + b;
}
}
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
/*繰り返し*/
#define rep1(n) for (ll i = 0; i < n; ++i) // n回repeat
#define rep2(i, n) for (ll i = 0; i < n; ++i) // n回repeat（変数指定）
#define rep3(i, a, b) for (ll i = a; i < b; ++i) // a-bまでrepeat
#define rep4(i, a, b, c) \
for (ll i = a; i < b; i += c) // a-bまで公差cでrepeat（等差数列で使えそう）
#define rep(...) \
overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) // repeatまとめ
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, \
rrep1)(__VA_ARGS__) // 逆repeatまとめ
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) \
overload4(__VA_ARGS__, each3, each2, \
each1)(__VA_ARGS__) // 配列の各要素の読み出し
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) \
overload3(__VA_ARGS__, all3, all2, \
all1)(__VA_ARGS__) // vectorの始めと終わりの読み取り
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) \
overload3(__VA_ARGS__, rall3, rall2, \
rall1)(__VA_ARGS__) // 逆イテレータの取得(rbegin：末尾,rend：頭）
#define sum(...) \
accumulate( \
all(__VA_ARGS__), \
0LL) // vectorの合計(int形で受け付けてしまうので，小数で扱いたい場合はdsumを使う)
#define dsum(...) \
accumulate(all(__VA_ARGS__), 0.0L) // 小数で扱う(long long doubleなど)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
/*標準入力*/
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__) // int型標準入力受付，以下LDまで同様
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
/*vector操作*/
#define Sort(a) sort(all(a)) // 昇順ソート
#define RSort(vec) sort(vec.begin(), vec.end(), greater<ll>()) // 降順ソート
#define Rev(a) reverse(all(a)) // 逆順
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__) // type型vectorの定義
#define VEC(type, name, size) \
vector<type> name(size); \
in(name) // type型vector(size指定)標準入力受付
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define IV(type, name, size) \
vector<pair<int, int>> name; \
for (int i = 0; i < size; i++) { \
int a_i; \
cin >> a_i; \
name.emplace_back(a_i, i); \
} // Indexつきvector（pair型Vector,(data,index)）
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
} // cout<<t<<endl
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
/*判定出力*/
int first(bool i = true) {
return out(i ? "first" : "second");
} // iがfirstか判断，以下同様
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
/*vector探索*/
#define bSearch(v, k) \
binary_search(all(v), k) // ソートされた配列vの中の要素にkがあるか(boolean)
#define lowB(v, k) \
lower_bound(all(v), \
k) // ソートされた配列vの中の要素のうちk以上かつ最小のイテレータ
#define DLbetB(v, k) lowB(v, k) - v.begin() // 先頭からの距離
#define DLbetE(v, k) v.end() - lowB(v, k) // 末尾からの距離
#define uppB(v, k) \
upper_bound( \
all(v), \
k) // ソートされた配列vの中の要素のうちkより大きいかつ最小のイテレータ
#define DUbetB(v, k) uppB(v, k) - v.begin() // 先頭からの距離
#define DUbetE(v, k) v.end() - uppB(v, k) // 末尾からの距離
#define Cnt(v, k) count(all(v), k) // 配列vの中で要素kが何個あるかを返す(size_t)
#define CntIf(v, l) \
count_if(all(v), \
l) // 配列vの中で条件式(lambda式)を満たす個数を返す(ex.int num =
// count_if(v.begin(), v.end(), [](int i){return i % 3 == 0;});)
#define Sort2D(myVec, i) \
sort(myVec.begin(), myVec.end(), \
[](const vector<ll> &alpha, const vector<ll> &beta) { \
return alpha[i] < beta[i]; \
}); // i列めでソート
/*最大公約数*/
template <class T> T vgcd(T m, T n) { return gcd(m, n); }
template <class T, class... Args> T vgcd(T a, Args... args) {
return vgcd(a, vgcd(args...));
}
/*階乗*/
ll facctorialMethod(ll k) {
int sum = 1;
for (ll i = 1; i <= k; ++i) {
sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
}
return sum;
}
/*組み合わせnCk*/
ll comb(const ll N, const ll K) {
vector<vector<long long int>> v(N + 1, vector<long long int>(N + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
return v[N][K];
}
/*逆元 あまりの割り算をするときにこいつをかける*/
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/*ダブリング*/
/*
参考：http://satanic0258.hatenablog.com/entry/2017/02/23/222647
使える場所：1回遷移した先が明確にわかる時
目的：
・ある数XのQ乗を求める
・根付き木において、ある頂点vのQ個上の親を知る
・ある地点からQ回進んだ先を求める
*/
// int N; // 全体の要素数
// int Q;//試行回数
ll doubling(
const ll N, const ll Q,
vector<ll> a) { // cin>>N>>Q;//標準入力から要素数と試行回数を受け取る場合
ll LOG_Q = floor(log2(Q)) + 1;
// next[k][i]で、i番目の要素の「2^k個次の要素」を指す
// (なお、i番目の要素に対して「2^k個次の要素」が存在しないとき、
// next[k][i]が指し示す要素番号を-1とします)
std::vector<std::vector<ll>> next(LOG_Q + 1, std::vector<ll>(N));
// ll a[N];//各要素の次の行き先
// next[0]を計算
for (int i = 0; i < N; ++i) {
next[0][i] = a[i];
}
// nextを計算
for (ll k = 0; k < LOG_Q; ++k) {
for (int i = 0; i < N; ++i) {
if (next[k][i] == -1) {
// 2^k個次に要素が無い時、当然2^(k+1)個次にも要素はありません
next[k + 1][i] = -1;
} else {
// 「2^k個次の要素」の2^k個次の要素は、2^(k+1)個次の要素です
next[k + 1][i] = next[k][next[k][i]];
}
}
}
// ----ここまで準備----
// p番目の要素の「Q個次の要素」を求めることを考えます
ll p = 0;
for (ll k = LOG_Q - 1; k >= 0; --k) {
if (p == -1) {
// pがすでに存在しない要素を指していたら、
// それ以降で存在する要素を指すことはないためループを抜けます
break;
}
if ((Q >> k) & 1) { // ex(Q=5)5=101(2)であり，2^2+2^0回進むことを表す
// Qを二進展開した際、k番目のビットが立っていたら、
// pの位置を2^kだけ次にずらします
p = next[k][p];
}
}
return p; // ここでのpが最終的な答えになる
}
/*素数判定*/
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
/*ページのソースを表示->command+F->問題文 で問題文コピペする
*/
// deque<ll> deq;//両端キュー使う，先頭と末尾へのアクセスが早い
signed main() {
/*以下コード*/
LL(n, a, b);
ll n1 = n;
n /= a + b;
ll ans = a * n;
if (n1 % (a + b) < a)
ans += n1 % (a + b);
else
ans += a;
out(ans);
}
| replace | 532 | 545 | 532 | 539 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ちゃんと考えてわかって実装 */
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
int ans = 0;
int ttl = 0;
while (ttl <= n) {
if (ttl + a > n) {
ans += (n - ttl);
} else {
ans += a;
}
ttl += a;
ttl += b;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ちゃんと考えてわかって実装 */
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
ll block = n / (a + b);
ll amari = n % (a + b);
ll ans = block * a + min(amari, a);
cout << ans << endl;
return 0;
} | replace | 11 | 22 | 11 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll count = 0;
while (N > 0) {
if (N - A > 0) {
N -= A;
count += A;
} else {
count += N;
N = 0;
}
N -= B;
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll num = N / (A + B);
ll count = num * A;
ll remain = N - (num * (A + B));
if (remain - A > 0) {
count += A;
} else {
count += remain;
}
cout << count << endl;
return 0;
} | replace | 21 | 31 | 21 | 29 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
const long long INF = 1LL << 60;
#define pairint pair<int, int>
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0;
std::cin >> x >> y >> z;
std::vector<int> v;
if (y == 0) {
std::cout << 0 << '\n';
return 0;
} else if (z == 0) {
std::cout << x << '\n';
return 0;
}
while (v.size() < x) {
rep(i, y) v.pb(0);
rep(i, z) v.pb(1);
}
rep(i, x) if (v[i] == 0) n++;
std::cout << n << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
const long long INF = 1LL << 60;
#define pairint pair<int, int>
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0;
std::cin >> x >> y >> z;
if (x % (y + z) == 0)
std::cout << x / (y + z) * y << '\n';
else if (x % (y + z) <= y)
std::cout << x / (y + z) * y + x % (y + z) << '\n';
else
std::cout << x / (y + z) * y + y << '\n';
}
| replace | 20 | 34 | 20 | 26 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a, b;
int cnt;
int rem;
cin >> n >> a >> b;
cnt = 0;
cnt += (n / (a + b)) * a;
rem = n % (a + b);
cnt += min(rem, a);
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
long long a, b;
long long cnt;
long long rem;
cin >> n >> a >> b;
cnt = 0;
cnt += (n / (a + b)) * a;
rem = n % (a + b);
cnt += min(rem, a);
cout << cnt << endl;
return 0;
}
| replace | 3 | 8 | 3 | 8 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + N % (A + B) << endl;
}
}
// int型の2次元配列(3×4要素の)の宣言
// vector<vector<int>> data(3, vector<int>(4));
// 入力 (2重ループを用いる)
// for (int i = 0; i < 3; i++) {
// for (int j = 0; j < 4; j++) {
// cin >> data.at(i).at(j);
//}
//}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A) {
cout << (N / (A + B)) * A + A << endl;
} else {
cout << (N / (A + B)) * A + N % (A + B) << endl;
}
}
// int型の2次元配列(3×4要素の)の宣言
// vector<vector<int>> data(3, vector<int>(4));
// 入力 (2重ループを用いる)
// for (int i = 0; i < 3; i++) {
// for (int j = 0; j < 4; j++) {
// cin >> data.at(i).at(j);
//}
//}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int main() {
int n, a, b;
std::cin >> n >> a >> b;
std::cout << (n / (a + b)) * a + std::min(a, n % (a + b));
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
long long n, a, b;
std::cin >> n >> a >> b;
std::cout << (n / (a + b)) * a + std::min(a, n % (a + b));
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid ((l + r) >> 1)
#define ll long long
using namespace std;
int main() {
int n, a, b;
int ans;
cin >> n >> a >> b;
ans = n / (a + b) * a;
n -= n / (a + b) * (a + b);
if (n <= a)
ans += n;
else
ans += a;
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid ((l + r) >> 1)
#define ll long long
using namespace std;
int main() {
long long n, a, b;
long long ans;
cin >> n >> a >> b;
ans = n / (a + b) * a;
n -= n / (a + b) * (a + b);
if (n <= a)
ans += n;
else
ans += a;
cout << ans << endl;
}
| replace | 15 | 17 | 15 | 17 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ull n, a, b;
cin >> n >> a >> b;
if (a + b == 0)
cout << 0 << '\n';
else {
ull s = n % (a + b);
ull r = n - s;
r /= (a + b);
r *= a;
if (s != 0)
r += s % a;
cout << r << ' ';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ull n, a, b;
cin >> n >> a >> b;
ull s = n % (a + b);
ull r = ((n - s) / (a + b)) * a;
r += (s <= a ? s : a);
cout << r << '\n';
return 0;
} | replace | 9 | 20 | 9 | 13 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
int index = 1;
ll ans = 0;
while (n > 0) {
// add blue ball
if (index % 2 == 1) {
if (n > a) {
n = n - a;
ans += a;
} else {
ans += n;
n = 0;
}
} else // add red ball
{
n = n - b;
}
index++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = n / (a + b) * a;
ll remainder = n % (a + b);
if (remainder >= a)
ans += a;
else
ans += remainder;
cout << ans;
} | replace | 7 | 25 | 7 | 13 | TLE | |
p02754 | C++ | Runtime Error | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 1LL << 60
#define MOD 1e9 + 7
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define lower(v, x) (lower_bound(all(v), x) - v.begin())
#define upper(v, x) (upper_bound(all(v), x) - v.begin())
#define debug(x) cout << x << "\n";
#define debug2(x, y) cout << x << " " << y << "\n";
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
template <typename T, typename U> inline void remin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void remax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T> T pow(T a, T b, T m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
inline string to_str(int a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
inline int to_int(string a) {
char x[100];
int res;
strcpy(x, a.c_str());
sscanf(x, "%lld", &res);
return res;
}
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
// Debug
#define Debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define vdump(a, x, y) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, x, y) if (__i) cerr << " " << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
template <typename C,
typename T = std::decay_t<decltype(*begin(std::declval<C>()))>,
typename std::enable_if<!std::is_same<C, std::string>::value>::type
* = nullptr>
std::ostream &operator<<(std::ostream &os, const C &container) {
bool first = true;
std::stringstream ss;
cerr << '[';
for (const auto &x : container) {
if (!first) {
cerr << ", ";
}
first = false;
cerr << x;
}
cerr << ']';
cerr << endl;
return os << ss.str();
}
void solve() {
int n, a, b;
cin >> n >> a >> b;
int ans = a * ((a + b - 1) / b) + min(n % (a + b), a);
debug(ans);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
WL(t) { solve(); }
cerr << "Time elapsed: " << clock() / 1000 << " ms" << endl;
} | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 1LL << 60
#define MOD 1e9 + 7
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define lower(v, x) (lower_bound(all(v), x) - v.begin())
#define upper(v, x) (upper_bound(all(v), x) - v.begin())
#define debug(x) cout << x << "\n";
#define debug2(x, y) cout << x << " " << y << "\n";
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
template <typename T, typename U> inline void remin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void remax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T> T pow(T a, T b, T m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
inline string to_str(int a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
inline int to_int(string a) {
char x[100];
int res;
strcpy(x, a.c_str());
sscanf(x, "%lld", &res);
return res;
}
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
// Debug
#define Debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << endl; \
}
#define vdump(a, x, y) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, x, y) if (__i) cerr << " " << a[__i]; \
else cerr << a[__i]; \
cerr << "]" << endl; \
}
template <typename C,
typename T = std::decay_t<decltype(*begin(std::declval<C>()))>,
typename std::enable_if<!std::is_same<C, std::string>::value>::type
* = nullptr>
std::ostream &operator<<(std::ostream &os, const C &container) {
bool first = true;
std::stringstream ss;
cerr << '[';
for (const auto &x : container) {
if (!first) {
cerr << ", ";
}
first = false;
cerr << x;
}
cerr << ']';
cerr << endl;
return os << ss.str();
}
void solve() {
int n, a, b;
cin >> n >> a >> b;
if (a == 0) {
debug(0);
return;
}
if (b == 0) {
debug(n);
return;
}
int ans = (n / (a + b)) * a + min(n % (a + b), a);
debug(ans);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
WL(t) { solve(); }
cerr << "Time elapsed: " << clock() / 1000 << " ms" << endl;
} | replace | 134 | 135 | 134 | 143 | 0 | Time elapsed: 26 ms
|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, ans;
cin >> n >> a >> b;
if (n % (a + b) <= a)
ans = a * (n / (a + b)) + n % (a + b);
else
ans = a * (n / (a + b)) + a;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, ans;
cin >> n >> a >> b;
if (n % (a + b) <= a)
ans = a * (n / (a + b)) + n % (a + b);
else
ans = a * (n / (a + b)) + a;
cout << ans;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << a * (n / (a + b)) + min(a, n % (a + b)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << a * (n / (a + b)) + min(a, n % (a + b)) << endl;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pii pair<int, int>
ll ans;
int N, A, B, k, l;
void solve() {
k = N / (A + B);
l = N % (A + B);
cout << A * k + min(l, A) << endl;
}
int main() {
cin >> N >> A >> B;
solve();
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pii pair<int, int>
ll N, A, B, k, l;
void solve() {
k = N / (A + B);
l = N % (A + B);
cout << A * k + min(l, A) << endl;
}
int main() {
cin >> N >> A >> B;
solve();
}
| replace | 17 | 19 | 17 | 18 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<char> balls;
int i, j, k;
for (i = 0; i < n;) {
for (j = 0; j < a; ++j) {
balls.push_back('b');
i++;
}
for (k = 0; k < b; ++k) {
balls.push_back('r');
i++;
}
}
int ans = 0;
for (i = 0; i < n; ++i) {
// cout << balls.at(i);
if (balls.at(i) == 'b') {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long x = N / (A + B);
long r = N % (A + B);
long ans = A * x;
if (A <= r) {
ans += A;
} else {
ans += r;
}
cout << ans << endl;
} | replace | 4 | 24 | 4 | 13 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned int N, div, rem;
unsigned int A, B, ans;
cin >> N >> A >> B;
div = N / (A + B);
rem = N % (A + B);
if (rem < A) {
ans = A * div + rem;
} else {
ans = A * div + A;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned long N, div, rem;
unsigned long A, B, ans;
cin >> N >> A >> B;
div = N / (A + B);
rem = N % (A + B);
if (rem < A) {
ans = A * div + rem;
} else {
ans = A * div + A;
}
cout << ans << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
ll A, B;
cin >> N >> A >> B;
ll x, y;
x = N / (A + B) * A;
y = N % (A + B);
ll cnt = x;
if (y > 0) {
for (ll i = 0; i < y; i++) {
if (i < A)
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
ll A, B;
cin >> N >> A >> B;
ll x, y;
x = N / (A + B) * A;
y = N % (A + B);
ll cnt = x;
if (y > 0) {
if (y > A)
cnt += A;
else
cnt += y;
}
cout << cnt << endl;
return 0;
}
| replace | 15 | 19 | 15 | 19 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) < A) {
cout << (N / (A + B)) * A + N % (A + B) << endl;
} else {
cout << (N / (A + B)) * A + A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) < A) {
cout << (N / (A + B)) * A + N % (A + B) << endl;
} else {
cout << (N / (A + B)) * A + A << endl;
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "w", stdout);
#endif
fast ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
if (a == 0) {
cout << 0;
return 0;
}
ans = ans + (n / (a + b));
ans *= a;
// cout<<ans<<" "<<n%(a+b)<<endl;
// ll x=(n%(a+b))%a;
if ((n % (a + b)) > 0 && (n % (a + b) <= a))
ans += (n % (a + b));
else if ((n % (a + b) > a))
ans += a;
cout << ans;
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl '\n'
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "w", stdout);
// #endif
fast ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
if (a == 0) {
cout << 0;
return 0;
}
ans = ans + (n / (a + b));
ans *= a;
// cout<<ans<<" "<<n%(a+b)<<endl;
// ll x=(n%(a+b))%a;
if ((n % (a + b)) > 0 && (n % (a + b) <= a))
ans += (n % (a + b));
else if ((n % (a + b) > a))
ans += a;
cout << ans;
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
} | replace | 9 | 13 | 9 | 13 | 0 |
Time elapsed: 0.029013 s.
|
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << a / (b + c) * b + min(a % (b + c), b);
} | #include <bits/stdc++.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
cout << a / (b + c) * b + min(a % (b + c), b);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
void solve() {
int n, b, r, ball_count, ans = 0;
cin >> n >> b >> r;
ball_count = b + r;
ans = n / ball_count * b + (n - n / ball_count * ball_count < b
? n - n / ball_count * ball_count
: b);
cout << ans << endl;
}
signed main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
void solve() {
ll n, b, r, ball_count, ans = 0;
cin >> n >> b >> r;
ball_count = b + r;
ans = n / ball_count * b + (n - n / ball_count * ball_count < b
? n - n / ball_count * ball_count
: b);
cout << ans << endl;
}
signed main() {
solve();
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll cnt = 0;
while (n > (a + b)) {
n -= a;
n -= b;
cnt++;
}
ll ans = 0;
if (n - a > 0) {
ans = cnt * a + a;
} else {
ans = cnt * a + n;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a, b;
cin >> a >> b;
ll cnt = 0;
cnt = n / (a + b);
n -= cnt * (a + b);
ll ans = 0;
if (n - a > 0) {
ans = cnt * a + a;
} else {
ans = cnt * a + n;
}
cout << ans << endl;
} | replace | 13 | 18 | 13 | 15 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1e10;
const long double PI = (acos(-1));
signed main() {
int N, A, B;
cin >> N >> A >> B;
int sum = 0;
int cnt = 0;
int i = 0;
while (sum <= N) {
if (i % 2 == 0) {
sum += A;
if (sum > N) {
int num = sum - N;
cnt += -num;
}
cnt += A;
} else
sum += B;
i++;
}
cout << cnt;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1e10;
const long double PI = (acos(-1));
signed main() {
int N, A, B;
cin >> N >> A >> B;
int num = N / (A + B);
int ans = num * A;
int sa = N - num * (A + B);
ans += min(sa, A);
cout << ans;
} | replace | 24 | 40 | 24 | 29 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
int set;
set = n / (a + b);
ans += set * a;
ans += min(n - set * (a + b), a);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
int set;
set = n / (a + b);
ans += set * a;
ans += min(n - set * (a + b), a);
cout << ans << endl;
}
| replace | 2 | 3 | 2 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fi first
#define se second
#define FIO \
{ \
ios::sync_with_stdio(0); \
cin.tie(nullptr); \
cout.tie(nullptr); \
}
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef long double ld;
int main() {
FIO int n, a, k;
cin >> n >> a >> k;
int b = n / (a + k);
if (b > 0) {
cout << b * a + n % (a + k);
} else
cout << a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fi first
#define se second
#define FIO \
{ \
ios::sync_with_stdio(0); \
cin.tie(nullptr); \
cout.tie(nullptr); \
}
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef long double ld;
int main() {
FIO long long n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b) * a) + min(a, n % (a + b));
return 0;
}
| replace | 71 | 79 | 71 | 74 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, A, B, C, D, E, F;
cin >> N >> A >> B;
C = (A + B);
D = N / C;
E = D * A;
F = N % C;
if (A == 0) {
cout << 0 << endl;
} else {
if (F <= A) {
cout << E + F << endl;
} else {
cout << E + A << endl;
}
}
} | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
long long int N, A, B, C, D, E, F;
cin >> N >> A >> B;
C = (A + B);
D = N / C;
E = D * A;
F = N % C;
if (A == 0) {
cout << 0 << endl;
} else {
if (F <= A) {
cout << E + F << endl;
} else {
cout << E + A << endl;
}
}
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
int n, a, b, ans, rem, rep;
cin >> n >> a >> b;
rep = n / (a + b);
rem = n % (a + b);
ans = rep * a;
ans += min(rem, a);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
ll n, a, b, ans, rem, rep;
cin >> n >> a >> b;
rep = n / (a + b);
rem = n % (a + b);
ans = rep * a;
ans += min(rem, a);
cout << ans;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll w = N / (A + B);
ll x = w * A;
ll rem = N % (w * (A + B));
rem = rem < A ? rem : A;
cout << x + rem << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll w = N / (A + B);
ll x = w * A;
ll rem = min(A, N % (A + B));
cout << x + rem << endl;
}
| replace | 13 | 15 | 13 | 14 | 0 | |
p02754 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int n, a, b;
void solve() {
if (n % (a + b) > a) {
cout << n / (a + b) * a + a << endl;
} else {
cout << n / (a + b) * a + n % (a + b) << endl;
}
}
int main() {
cin >> n >> a >> b;
solve();
} | #include "bits/stdc++.h"
using namespace std;
long long n, a, b;
void solve() {
if (n % (a + b) > a) {
cout << n / (a + b) * a + a << endl;
} else {
cout << n / (a + b) * a + n % (a + b) << endl;
}
}
int main() {
cin >> n >> a >> b;
solve();
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int i = 0, j = 0, ans = 0;
int n, a, b;
cin >> n >> a >> b;
j = n / (a + b);
ans = a * j;
for (i = 1; i <= a; i++) {
if ((a + b) * j + i <= n)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int i = 0, j = 0, ans = 0;
int n, a, b;
cin >> n >> a >> b;
j = n / (a + b);
ans = a * j;
if (a + (a + b) * j <= n)
ans += a;
else
ans += n - (a + b) * j;
cout << ans << endl;
return 0;
} | replace | 13 | 17 | 13 | 18 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
if (n - (a + b) * c >= a) {
d = a * (c + 1);
} else {
d = a * c + n - c * (a + b);
}
cout << d << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n, a, b, c, d;
cin >> n >> a >> b;
c = n / (a + b);
if (n - (a + b) * c >= a) {
d = a * (c + 1);
} else {
d = a * c + n - c * (a + b);
}
cout << d << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
int bc = 0;
long long i = 0;
while (i < n) {
for (int d = 0; d < a; d++) {
if (i < n) {
bc += 1;
i++;
} else {
cout << bc << endl;
return 0;
}
}
for (int d = 0; d < b; d++) {
if (i < n) {
i++;
} else {
cout << bc << endl;
return 0;
}
}
}
cout << bc << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long p = a + b;
long long w = n / p;
long long m = n % p;
long long x = a < m ? a : m;
cout << (w * a + x) << endl;
return 0;
}
| replace | 7 | 29 | 7 | 13 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define isOdd(n) (n & 1)
#define LLMAX LLONG_MAX
#define LLMIN LLONG_MIN
#define IMN INT_MIN
#define IMX INT_MAX
#define pow(n, m) power((ll)n, (ll)m)
#define numOfDigits(n) ((n) ? (ll)(log10(n)) + 1 : 1)
#define mem(x, val) memset(x, val, sizeof(x)) // be careful
#define sz(x) (int)x.size()
#define MOD 1000000007
#define EPS 1e-7
typedef long long ll;
typedef long double ld;
typedef double dd;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
START
// freopen("test cases\\in.txt", "r", stdin) ;
ll n, a, b;
cin >> n >> a >> b;
ll cnt = 1, sum;
while (cnt * (a + b) < n)
cnt++;
sum = (cnt - 1) * a;
n -= (cnt - 1) * (a + b);
sum += min(n, a);
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define isOdd(n) (n & 1)
#define LLMAX LLONG_MAX
#define LLMIN LLONG_MIN
#define IMN INT_MIN
#define IMX INT_MAX
#define pow(n, m) power((ll)n, (ll)m)
#define numOfDigits(n) ((n) ? (ll)(log10(n)) + 1 : 1)
#define mem(x, val) memset(x, val, sizeof(x)) // be careful
#define sz(x) (int)x.size()
#define MOD 1000000007
#define EPS 1e-7
typedef long long ll;
typedef long double ld;
typedef double dd;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
START
// freopen("test cases\\in.txt", "r", stdin) ;
ll n, a, b;
cin >> n >> a >> b;
ll cnt = 1, sum;
cnt = n / (a + b) + (n % (a + b) != 0);
sum = (cnt - 1) * a;
n -= (cnt - 1) * (a + b);
sum += min(n, a);
cout << sum;
return 0;
}
| replace | 39 | 41 | 39 | 40 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long blue;
blue = N / (A + B) * A;
for (long i = 0; i < N % (A + B); ++i) {
if (i < A)
blue += 1;
}
cout << blue << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long N, A, B;
cin >> N >> A >> B;
long blue;
blue = N / (A + B) * A;
if (N % (A + B) >= A) {
blue += A;
} else if (N % (A + B) < A) {
blue += N % (A + B);
}
cout << blue << endl;
return 0;
} | replace | 8 | 11 | 8 | 12 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
vector<bool> line;
while (line.size() < N) {
for (int j = 0; j < A; j++) {
line.push_back(true);
}
for (int j = 0; j < B; j++) {
line.push_back(false);
}
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (line.at(i))
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 6 | 21 | 6 | 7 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
ll total = 0;
ll ans = 0;
bool isBlue = true;
while (n > total) {
if (isBlue) {
total += a;
ans += a;
isBlue = false;
} else {
total += b;
isBlue = true;
}
}
if (!isBlue)
ans -= (total - n);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(a, n % (a + b)) << endl;
} | replace | 6 | 22 | 6 | 7 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll m = 0;
while ((a + b) * m <= n)
m++;
m--;
n -= (a + b) * m;
cout << (a * m) + min(n, a) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll m = n / (a + b);
n -= (a + b) * m;
cout << (a * m) + min(n, a) << endl;
return 0;
}
| replace | 86 | 90 | 86 | 87 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, r, ans, rem;
cin >> a >> b >> r;
ans = a / (b + r) * b;
rem = a % (b + r);
ans += min(rem, b);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int a, b, r, ans, rem;
cin >> a >> b >> r;
ans = a / (b + r) * b;
rem = a % (b + r);
ans += min(rem, b);
cout << ans << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, t, s, ans;
bool can;
can = false;
// string S,A;
cin >> N >> A >> B;
t = N / (A + B);
s = N - (A + B) * t;
ans = t * A;
if (s > A)
ans += A;
else
ans += s;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long N, A, B, t, s, ans;
bool can;
can = false;
// string S,A;
cin >> N >> A >> B;
t = N / (A + B);
s = N - (A + B) * t;
ans = t * A;
if (s > A)
ans += A;
else
ans += s;
cout << ans << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, o;
cin >> n >> a >> b;
o = n / (a + b) * a;
if (n % (a + b) > a) {
o = o + a;
} else {
o = o + (n % (a + b));
}
cout << o << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, o;
cin >> n >> a >> b;
o = n / (a + b) * a;
if (n % (a + b) > a) {
o = o + a;
} else {
o = o + (n % (a + b));
}
cout << o << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, x;
cin >> N >> A >> B;
x = N / (A + B) * A;
if (N % (A + B) > A)
x += A;
else
x += N % (A + B);
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, x;
cin >> N >> A >> B;
x = N / (A + B) * A;
if (N % (A + B) > A)
x += A;
else
x += N % (A + B);
cout << x << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int N, A, B, Z, count, D, sum, Q;
int main() {
cin >> N >> A >> B;
::sum = A + B;
D = N / ::sum;
::count += D * A;
Z += D * ::sum;
Q = N - Z;
if (Q <= A) {
::count += Q;
} else {
::count += A;
}
cout << ::count << endl;
} | #include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
long int N, A, B, Z, count, D, sum, Q;
int main() {
cin >> N >> A >> B;
::sum = A + B;
D = N / ::sum;
::count += D * A;
Z += D * ::sum;
Q = N - Z;
if (Q <= A) {
::count += Q;
} else {
::count += A;
}
cout << ::count << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep1(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
int main() {
int N, A, B, C = 0, D, E;
cin >> N >> A >> B;
C = A + B;
D = N / C;
E = N - D * C;
if (E > A)
cout << A * D + A << endl;
else
cout << A * D + E << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep1(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
int main() {
long long int N, A, B, C = 0, D, E;
cin >> N >> A >> B;
C = A + B;
D = N / C;
E = N - D * C;
if (E > A)
cout << A * D + A << endl;
else
cout << A * D + E << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02754 | C++ | Time Limit Exceeded | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define deb(x) cout << #x << " is " << x << "\n";
using namespace std;
using namespace __gnu_pbds;
const double PI = 2 * acos(0.0);
const long long INF = 1e18L + 5;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, a, b;
cin >> n >> a >> b;
long long ans = 0;
long long cnt = 0;
while (cnt <= n) {
if (cnt + a <= n) {
cnt += a;
ans += a;
} else {
ans += (n - cnt);
cnt += a;
}
cnt += b;
}
cout << ans;
return 0;
}
| /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define deb(x) cout << #x << " is " << x << "\n";
using namespace std;
using namespace __gnu_pbds;
const double PI = 2 * acos(0.0);
const long long INF = 1e18L + 5;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, a, b;
cin >> n >> a >> b;
cout << ((n / (a + b)) * a) + min(n % (a + b), a);
return 0;
}
| replace | 32 | 45 | 32 | 33 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <string> //文字列
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) // REPが0の時
#define ll long long int
using namespace std;
double PI = 3.141592653589793; // 円周率
// 常設関数↓
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// degree → radian
ll chg_DegRad(int deg) { return deg * PI / 180.0; }
// radian → degree
ll chg_RadDeg(int rad) { return rad * 180.0 / PI; }
// 提出コード↓
int n, a, b, c;
int main() {
cin >> n >> a >> b;
c = a + b;
if ((n % c) > a) {
cout << ((n / c) + 1) * a << endl;
} else
cout << ((n / c) * a) + (n % c) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip> //doubleの桁数指定
#include <iostream>
#include <string> //文字列
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++) // forの短縮
#define rep(i, n) REP(i, 0, n) // REPが0の時
#define ll long long int
using namespace std;
double PI = 3.141592653589793; // 円周率
// 常設関数↓
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// degree → radian
ll chg_DegRad(int deg) { return deg * PI / 180.0; }
// radian → degree
ll chg_RadDeg(int rad) { return rad * 180.0 / PI; }
// 提出コード↓
ll n, a, b, c;
int main() {
cin >> n >> a >> b;
c = a + b;
if ((n % c) > a) {
cout << ((n / c) + 1) * a << endl;
} else
cout << ((n / c) * a) + (n % c) << endl;
return 0;
}
| replace | 34 | 35 | 34 | 36 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) == 0)
cout << N / (A + B) * A << endl;
else
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) == 0)
cout << N / (A + B) * A << endl;
else
cout << N / (A + B) * A + min(N % (A + B), A) << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool is_ok(ll x, ll y) {
if (x == y)
return true;
else
return false;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
int num = 0;
int b_num = 0;
for (ll i = 0; i < pow(10, 100); i++) {
for (ll j = 0; j < a; j++) {
b_num++;
num++;
if (is_ok(n, num)) {
cout << b_num << endl;
return 0;
}
}
for (ll k = 0; k < b; k++) {
num++;
if (is_ok(n, num)) {
cout << b_num << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool is_ok(ll x, ll y) {
if (x == y)
return true;
else
return false;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll r_b = a + b;
ll ans = (n / r_b) * a;
if ((n % r_b) < a)
ans += (n % r_b);
else
ans += a;
cout << ans << endl;
}
| replace | 32 | 51 | 32 | 39 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
long long N, A, B;
int main() {
#define LOCAL
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> A >> B;
if (A + B >= N) {
if (A >= N)
cout << N << endl;
else
cout << A << endl;
} else {
long long ans = N / (A + B) * A;
long long mod = N % (A + B);
if (mod <= A)
ans += mod;
else
ans += A;
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
long long N, A, B;
int main() {
// #define LOCAL
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> A >> B;
if (A + B >= N) {
if (A >= N)
cout << N << endl;
else
cout << A << endl;
} else {
long long ans = N / (A + B) * A;
long long mod = N % (A + B);
if (mod <= A)
ans += mod;
else
ans += A;
cout << ans << endl;
}
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(o, 0, n) cout << v[o] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define tihs \
if (fopen("inp.txt", "r")) \
freopen("inp.txt", "r", stdin), freopen("out.txt", "w", stdout);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 100010
int main() {
IOS;
tihs;
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0, cnt = 0, t = 0;
while (cnt <= n) {
if (!t) {
ans += min(n - cnt, a), cnt += a;
} else {
cnt += b;
}
t = !t;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(o, 0, n) cout << v[o] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define tihs \
if (fopen("inp.txt", "r")) \
freopen("inp.txt", "r", stdin), freopen("out.txt", "w", stdout);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 100010
int main() {
IOS;
tihs;
ll n, a, b;
cin >> n >> a >> b;
ll cnt = n / (a + b);
ll rem = n - cnt * (a + b);
ll ans = cnt * a + min(rem, a);
cout << ans;
return 0;
} | replace | 62 | 71 | 62 | 65 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n, a, b;
cin >> n >> a >> b;
int sum = a + b;
int ans = 0;
ans = (n / sum) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main() {
int n, a, b;
cin >> n >> a >> b;
int sum = a + b;
int ans = 0;
ans = (n / sum) * a;
n %= (a + b);
ans += min(a, n);
cout << ans << endl;
} | insert | 1 | 1 | 1 | 2 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll length = 0, ans = 0;
for (ll i = 0; length < N; i++) {
if (i % 2 == 0)
length += A;
else
length += B;
if (length < N && i % 2 == 0)
ans += A;
else if (i % 2 == 0)
ans += N - (length - A);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll duplicate = floor(double(N) / double(A + B)), mod = N % (A + B), ans;
// cerr << "duplicate = " << duplicate << endl;
ans += duplicate * A;
ans += min(mod, A);
cout << ans << endl;
return 0;
} | replace | 58 | 70 | 58 | 62 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, mod, div;
cin >> n >> a >> b;
div = n / (a + b);
mod = n % (a + b);
if (mod > a) {
mod = a;
}
cout << mod + a * div;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long n, a, b, mod, div;
cin >> n >> a >> b;
div = n / (a + b);
mod = n % (a + b);
if (mod > a) {
mod = a;
}
cout << mod + a * div;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
const int INF = 1e9;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
const int INF = 1e9;
template <typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a) << endl;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, A, B, rest;
cin >> N >> A >> B;
rest = N % (A + B);
if (rest > A)
rest = A;
N = (N / (A + B)) * A;
cout << rest + N;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long N, A, B, rest;
cin >> N >> A >> B;
rest = N % (A + B);
if (rest > A)
rest = A;
N = (N / (A + B)) * A;
cout << rest + N;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
bool ok = true;
int64_t i = 0;
int64_t ans = 0;
while (ok) {
if ((A + B) + i < N) {
ans += A;
i += (A + B);
} else if ((i + A) < N) {
ans += A;
ok = false;
} else {
ans += (N - i);
ok = false;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
cin >> N >> A >> B;
int64_t i = (A + B) * (N / (A + B));
int64_t ans = A * (N / (A + B));
if ((i + A) < N) {
ans += A;
} else {
ans += (N - i);
}
cout << ans << endl;
} | replace | 6 | 20 | 6 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, X;
cin >> N >> A >> B;
X = N / (A + B);
cout << X * A + min(N % (A + B), A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, X;
cin >> N >> A >> B;
X = N / (A + B);
cout << X * A + min(N % (A + B), A) << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A)
cout << N / (A + B) * A + A << endl;
else
cout << N / (A + B) * A + N % (A + B) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (N % (A + B) > A)
cout << N / (A + B) * A + A << endl;
else
cout << N / (A + B) * A + N % (A + B) << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
int k, l, p;
cin >> N >> A >> B;
k = N / (A + B);
l = N - (A + B) * k;
if (l < A) {
p = l + k * A;
} else {
p = A + k * A;
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B;
int64_t k, l, p;
cin >> N >> A >> B;
k = N / (A + B);
l = N - (A + B) * k;
if (l < A) {
p = l + k * A;
} else {
p = A + k * A;
}
cout << p << endl;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
int count, ama;
cin >> N >> A >> B;
count = N / (A + B);
ama = N % (A + B);
if (ama > A > 0) {
ama = A;
}
cout << count * A + ama << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, A, B;
long long int count, ama;
cin >> N >> A >> B;
count = N / (A + B);
ama = N % (A + B);
if (ama > A > 0) {
ama = A;
}
cout << count * A + ama << endl;
} | replace | 3 | 5 | 3 | 5 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long m = a + b;
long r = n % m;
long ans = (a / m) * a + min(r, a);
return ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long m = a + b;
long r = n % m;
long ans = (n / m) * a + min(r, a);
cout << ans;
return 0;
} | replace | 9 | 11 | 9 | 12 | 1 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(n % (a + b), a);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
ll cnt = n;
while (cnt > 0) {
ans += a;
cnt -= a;
if (cnt <= 0) {
ans += cnt;
break;
}
cnt -= b;
if (cnt <= 0) {
break;
}
}
dunk(ans);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(a, n % (a + b)) << endl;
}
| replace | 15 | 32 | 15 | 16 | TLE | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a);
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long n, a, b;
cin >> n >> a >> b;
cout << (n / (a + b)) * a + min(n % (a + b), a);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b;
c = n / (a + b) * a;
if (n % (a + b) > a) {
c = c + a;
} else {
c = c + n % (a + b);
}
cout << c << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int n, a, b, c;
cin >> n >> a >> b;
c = n / (a + b) * a;
if (n % (a + b) > a) {
c = c + a;
} else {
c = c + n % (a + b);
}
cout << c << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long count = 0;
bool turn = true;
while (N) {
if (turn) {
if (N > A) {
count += A;
N -= A;
} else {
count += N;
N = 0;
}
turn = false;
} else {
if (N > B)
N -= B;
else
N = 0;
turn = true;
}
}
cout << count << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int N, A, B;
cin >> N >> A >> B;
long long int fixedcount = (N / (A + B)) * A;
long long int remainder = (N % (A + B));
if (remainder < A)
cout << (fixedcount + remainder) << "\n";
else
cout << (fixedcount + A) << "\n";
return 0;
} | replace | 8 | 30 | 8 | 14 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main(int argc, char *argv[]) {
ll n, a, b;
cin >> n >> a >> b;
string r;
ll ans = 0;
rep(i, n) {
rep(j, a) {
ans++;
r.append("b");
if (r.size() >= n)
goto fin;
}
rep(k, b) {
r.append("r");
if (r.size() >= n)
goto fin;
}
}
fin:
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main(int argc, char *argv[]) {
ll n, a, b;
cin >> n >> a >> b;
if ((n - n / (a + b) * (a + b)) > a)
cout << n / (a + b) * a + a << endl;
else
cout << n / (a + b) * a + n - n / (a + b) * (a + b) << endl;
return 0;
}
| replace | 15 | 32 | 15 | 20 | TLE | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll sum = 0;
ll ans = 0;
while (sum + a + b < n) {
sum += a + b;
ans += a;
}
if (n - sum <= a) {
ans += n - sum;
} else {
ans += a;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll sum = 0;
ll ans = 0;
ans += n / (a + b) * a;
if (n % (a + b) <= a) {
ans += n % (a + b);
} else {
ans += a;
}
cout << ans << endl;
}
| replace | 22 | 28 | 22 | 25 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, A, B, tmp, r, ans;
cin >> N >> A >> B;
tmp = N / (A + B);
r = N % (A + B);
if (A <= r) {
ans = (tmp + 1) * A;
} else {
ans = tmp * A + r;
}
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long int N, A, B, tmp, r, ans;
cin >> N >> A >> B;
tmp = N / (A + B);
r = N % (A + B);
if (A <= r) {
ans = (tmp + 1) * A;
} else {
ans = tmp * A + r;
}
cout << ans;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
int64_t i = 0;
int64_t sum = 0;
int64_t r = b;
while (i < a) {
if (r != 0) {
r--;
sum = sum + 1;
i++;
}
if (r == 0) {
r = b;
i = i + c;
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
int64_t count = a / (b + c);
if (a - count * (b + c) > b)
cout << (count + 1) * b;
else
cout << count * b + a - count * (b + c);
}
| replace | 9 | 25 | 9 | 14 | TLE | |
p02754 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#define pb push_back
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
inline int read() {
int x = 0, neg = 1;
char op = getchar();
while (!isdigit(op)) {
if (op == '-')
neg = -1;
op = getchar();
}
while (isdigit(op)) {
x = 10 * x + op - '0';
op = getchar();
}
return neg * x;
}
inline void print(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x >= 10)
print(x / 10);
putchar(x % 10 + '0');
}
int n, blue, red;
int main() {
// freopen("in.txt","r",stdin);
cin >> n >> blue >> red;
cout << n / (blue + red) * blue + min(n % (blue + red), blue) << endl;
return 0;
}
| #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#define pb push_back
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
inline int read() {
int x = 0, neg = 1;
char op = getchar();
while (!isdigit(op)) {
if (op == '-')
neg = -1;
op = getchar();
}
while (isdigit(op)) {
x = 10 * x + op - '0';
op = getchar();
}
return neg * x;
}
inline void print(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x >= 10)
print(x / 10);
putchar(x % 10 + '0');
}
ll n, blue, red;
int main() {
// freopen("in.txt","r",stdin);
cin >> n >> blue >> red;
cout << n / (blue + red) * blue + min(n % (blue + red), blue) << endl;
return 0;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int ans, amariblue;
cin >> n >> a >> b;
ans = n / (a + b) * a;
amariblue = min(n % (a + b), a);
ans += amariblue;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a, b;
long long int ans, amariblue;
cin >> n >> a >> b;
ans = n / (a + b) * a;
amariblue = min(n % (a + b), a);
ans += amariblue;
cout << ans << endl;
return 0;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
int main() {
int n, a, b;
int q, r;
int sum = 0;
std::cin >> n >> a >> b;
q = (n / (a + b));
r = (n % (a + b));
sum = q * a;
if (r >= a)
sum += a;
else
sum += r;
std::cout << sum << std::endl;
return 0;
} | #include <iostream>
int main() {
long long n, a, b;
long long q, r;
long long sum = 0;
std::cin >> n >> a >> b;
q = (n / (a + b));
r = (n % (a + b));
sum = q * a;
if (r >= a)
sum += a;
else
sum += r;
std::cout << sum << std::endl;
return 0;
} | replace | 3 | 6 | 3 | 6 | 0 | |
p02754 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = 1e-9;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
lint mypow(lint a, lint b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
lint memo = mypow(a, b >> 1);
return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
lint memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
std::string to_string(std::vector<int> &vec) {
std::string res = "[";
rep(i, vec.size() - 1) res += std::to_string(vec[i]) + ", ";
res += std::to_string(vec.back()) + "]";
return res;
}
int main() {
int n, a, b;
std::cin >> n >> a >> b;
std::cout << n / (a + b) * a + std::min(a, n % (a + b)) << std::endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = 1e-9;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
lint mypow(lint a, lint b) {
if (!b)
return 1;
if (b & 1)
return mypow(a, b - 1) * a;
lint memo = mypow(a, b >> 1);
return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
lint memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
rep(i, vec.size() - 1) std::cout << vec[i] << " ";
std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
T rprev = r;
rprev--;
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
std::string to_string(std::vector<int> &vec) {
std::string res = "[";
rep(i, vec.size() - 1) res += std::to_string(vec[i]) + ", ";
res += std::to_string(vec.back()) + "]";
return res;
}
int main() {
lint n, a, b;
std::cin >> n >> a >> b;
std::cout << n / (a + b) * a + std::min(a, n % (a + b)) << std::endl;
return 0;
}
| replace | 108 | 109 | 108 | 109 | 0 | |
p02754 | C++ | Runtime Error | // #pragma warning(disable:4996)
// #include <Windows.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <bitset>
#include <complex>
#include <cstdio>
#include <list>
// #include <stdio.h>
//< in.txt > out.txt
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
typedef long long LL;
typedef long double LD;
// typedef boost::multiprecision::cpp_int bigint;
typedef pair<LL, LL> PLL;
typedef pair<int, int> PI;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef unsigned long long ULL;
template <class T> inline void chmin(T &a, T b) { a = min(a, b); }
template <class T> inline void chmax(T &a, T b) { a = max(a, b); }
void input();
void solve();
void daminput();
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
input();
// daminput();
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
int N, A, B;
void input() { cin >> N >> A >> B; }
void daminput() {}
void solve() {
LL ans = (N / (A + B)) * A;
N -= (N / (A + B)) * (A + B);
ans += min(A, N);
cout << ans << "\n";
} | // #pragma warning(disable:4996)
// #include <Windows.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <bitset>
#include <complex>
#include <cstdio>
#include <list>
// #include <stdio.h>
//< in.txt > out.txt
using namespace std;
// std::ios::sync_with_stdio(false);
// std::cin.tie(0);
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
typedef long long LL;
typedef long double LD;
// typedef boost::multiprecision::cpp_int bigint;
typedef pair<LL, LL> PLL;
typedef pair<int, int> PI;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef unsigned long long ULL;
template <class T> inline void chmin(T &a, T b) { a = min(a, b); }
template <class T> inline void chmax(T &a, T b) { a = max(a, b); }
void input();
void solve();
void daminput();
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
input();
// daminput();
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
LL N, A, B;
void input() { cin >> N >> A >> B; }
void daminput() {}
void solve() {
LL ans = (N / (A + B)) * A;
N -= (N / (A + B)) * (A + B);
ans += min(A, N);
cout << ans << "\n";
} | replace | 64 | 65 | 64 | 65 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, a, b, set, res;
cin >> n >> a >> b;
set = n / (a + b);
res = set * a;
n -= set * (a + b);
if (n > a) {
res += a;
} else {
res += n;
}
cout << res << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
unsigned long long n, a, b, set, res;
cin >> n >> a >> b;
set = n / (a + b);
res = set * a;
n -= set * (a + b);
if (n > a) {
res += a;
} else {
res += n;
}
cout << res << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, r, ans;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
r = n % (a + b);
ans += min(r, a);
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long int n, a, b, ans, r;
cin >> n >> a >> b;
ans = (n / (a + b)) * a;
r = n % (a + b);
ans += min(r, a);
cout << ans;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a, b, c, d, e, f;
string s;
cin >> n >> a >> b;
c = a + b;
d = n % c;
e = n / c;
if (d > a) {
e = e + 1;
f = e * a;
cout << f;
} else {
f = e * a;
f = f + d;
cout << f;
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int n, a, b, c, d, e, f;
cin >> n >> a >> b;
c = a + b;
d = n % c;
e = n / c;
if (d > a) {
e = e + 1;
f = e * a;
cout << f;
} else {
f = e * a;
f = f + d;
cout << f;
}
} | replace | 5 | 7 | 5 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int q, r;
cin >> n >> a >> b;
q = n / (a + b);
r = n % (a + b);
if (r > a)
cout << a * q + a << endl;
else
cout << a * q + r << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
long long q, r;
cin >> n >> a >> b;
q = n / (a + b);
r = n % (a + b);
if (r > a)
cout << a * q + a << endl;
else
cout << a * q + r << endl;
return 0;
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
cout << N / (A + B) * A + min(A, N % (A + B)) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02754 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long int in, blue, red, ans = 0;
cin >> in >> blue >> red;
if (blue == 0) {
cout << 0 << endl;
return (0);
}
while (1) {
if (in <= 0)
break;
if (in - blue <= 0) {
ans += in;
break;
}
ans += blue;
in -= (blue + red);
}
cout << ans << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
long long int in, blue, red, ans = 0;
cin >> in >> blue >> red;
if (blue == 0) {
cout << 0 << endl;
return (0);
}
ans = in / (blue + red) * blue;
ans += in % (blue + red) > blue ? blue : in % (blue + red);
cout << ans << endl;
return (0);
} | replace | 10 | 20 | 10 | 12 | TLE | |
p02754 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = 0;
if (a == 0) {
ans = 0;
cout << ans << endl;
return ans;
}
if (b == 0) {
ans = n;
cout << ans << endl;
return ans;
}
ll total = 0;
rep(i, n) {
total += (i % 2 == 0) ? a : b;
// cout << ans << " " << total << endl;
if (i % 2 == 0)
ans += a;
if (total >= n) {
if (i % 2 == 0) {
ans -= total - n;
break;
} else {
break;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll ans = a * (n / (a + b));
ans += min(n % (a + b), a);
cout << ans << endl;
} | replace | 19 | 46 | 19 | 21 | 0 | |
p02754 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, a, b, sum = 0;
cin >> n >> a >> b;
sum += n / (a + b) * a;
n = n % (a + b);
if (n > a)
sum += a;
else
sum += n;
cout << sum;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long n, a, b, sum = 0;
cin >> n >> a >> b;
sum += n / (a + b) * a;
n = n % (a + b);
if (n > a)
sum += a;
else
sum += n;
cout << sum;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02754 | C++ | Time Limit Exceeded | // ここから「ここまでテンプレ」までテンプレ
#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a; c > 0 ? i < b : i > b; i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
#ifdef LOCAL_ENV
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int inf = (int)1 << 60;
const int undefined = inf;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
typedef long double Real;
const Real eps = 1e-10;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
//.....................
const int MAX = (int)2e5 + 5;
const int MAX2 = (int)3e2;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
template <typename T>
string join(
const vector<T> &v, const string delim = 0,
function<string(T)> f = [](int a) { return to_string(a); }) {
string s;
if (!v.empty()) {
s += f(v[0]);
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim != "")
s += delim;
s += f(v[i]);
}
}
return s;
}
string join_str(const vector<string> &v, const string delim = 0) {
return join<string>(v, delim, [](string a) { return a; });
}
string operator*(const string &s, const int &n) {
string res = "";
rep(i, n) res += s;
return res;
}
template <class InputIterator> int sum(InputIterator begin, InputIterator end) {
return accumulate(begin, end, 0ll);
}
template <typename T> T gcd(T a, T b) {
if (a == inf)
return b;
if (b == inf)
return a;
T c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
template <typename T> T lcm(T m, T n) { return ((m / gcd(m, n)) * n); }
template <typename T> T bit_count(T N) {
T cnt = 0;
while (N) {
if (N & 1)
cnt++;
N >>= 1;
}
return cnt;
}
template <typename T> void print_vec(ostream &ostream, vector<T> a) {
rep(i, a.size() - 1) ostream << a[i] << " ";
ostream << a.back() << endl;
}
template <typename T> void print_enumerable(ostream &ostream, T a_) {
for (auto a : a_) {
cerr << a << " ";
}
cerr << endl;
}
ll pow_n(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
n >>= 1;
}
return res;
}
template <class T, class U> T mod_pow(T x, U n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
x %= mod_n;
n >>= 1;
res %= mod_n;
}
return res;
}
template <class T> T mod_rev(T a) {
T res = 1;
return mod_pow(a, mod_n - 2);
}
int H, W;
bool grid_ng(int y, int x) { return y < 0 || y >= H || x < 0 || x >= W; }
struct Point {
int x, y;
Point(int y_, int x_) : y(y_), x(x_) {}
bool operator<(const Point &r) const {
if (y != r.y)
return y < r.y;
return x < r.x;
}
};
struct Vertex {
int id, dist;
bool operator>(const Vertex &r) const { return dist > r.dist; }
};
struct Edge {
int to, weight;
Edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<Edge>>;
Graph g;
// ここまでテンプレ
int n, k;
string s;
int l;
class Solver {
public:
void solve() {
int n, a, b;
cin >> n >> a >> b;
vector<int> vec;
while (vec.size() < n) {
rep(i, a) vec.push_back(0);
rep(i, b) vec.push_back(1);
}
int cnt = 0;
rep(i, n) {
if (vec[i] == 0)
cnt++;
}
cout << cnt << endl;
}
};
// ここから最後までテンプレ
signed main() {
srand((unsigned int)time(NULL));
cout << fixed << setprecision(20);
cerr << fixed << setprecision(3);
auto ptr = new Solver();
ptr->solve();
delete ptr;
// while(true) {
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
// while (true) {
// if (cin.eof() == true) break;
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
return 0;
}
| // ここから「ここまでテンプレ」までテンプレ
#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a; c > 0 ? i < b : i > b; i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
#ifdef LOCAL_ENV
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int inf = (int)1 << 60;
const int undefined = inf;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
typedef long double Real;
const Real eps = 1e-10;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
//.....................
const int MAX = (int)2e5 + 5;
const int MAX2 = (int)3e2;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
template <typename T>
string join(
const vector<T> &v, const string delim = 0,
function<string(T)> f = [](int a) { return to_string(a); }) {
string s;
if (!v.empty()) {
s += f(v[0]);
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim != "")
s += delim;
s += f(v[i]);
}
}
return s;
}
string join_str(const vector<string> &v, const string delim = 0) {
return join<string>(v, delim, [](string a) { return a; });
}
string operator*(const string &s, const int &n) {
string res = "";
rep(i, n) res += s;
return res;
}
template <class InputIterator> int sum(InputIterator begin, InputIterator end) {
return accumulate(begin, end, 0ll);
}
template <typename T> T gcd(T a, T b) {
if (a == inf)
return b;
if (b == inf)
return a;
T c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
template <typename T> T lcm(T m, T n) { return ((m / gcd(m, n)) * n); }
template <typename T> T bit_count(T N) {
T cnt = 0;
while (N) {
if (N & 1)
cnt++;
N >>= 1;
}
return cnt;
}
template <typename T> void print_vec(ostream &ostream, vector<T> a) {
rep(i, a.size() - 1) ostream << a[i] << " ";
ostream << a.back() << endl;
}
template <typename T> void print_enumerable(ostream &ostream, T a_) {
for (auto a : a_) {
cerr << a << " ";
}
cerr << endl;
}
ll pow_n(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
n >>= 1;
}
return res;
}
template <class T, class U> T mod_pow(T x, U n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
x %= mod_n;
n >>= 1;
res %= mod_n;
}
return res;
}
template <class T> T mod_rev(T a) {
T res = 1;
return mod_pow(a, mod_n - 2);
}
int H, W;
bool grid_ng(int y, int x) { return y < 0 || y >= H || x < 0 || x >= W; }
struct Point {
int x, y;
Point(int y_, int x_) : y(y_), x(x_) {}
bool operator<(const Point &r) const {
if (y != r.y)
return y < r.y;
return x < r.x;
}
};
struct Vertex {
int id, dist;
bool operator>(const Vertex &r) const { return dist > r.dist; }
};
struct Edge {
int to, weight;
Edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<Edge>>;
Graph g;
// ここまでテンプレ
int n, k;
string s;
int l;
class Solver {
public:
void solve() {
int n, a, b;
cin >> n >> a >> b;
int c = n / (a + b);
int res = c * a;
res += min(n - c * (a + b), a);
cout << res << endl;
}
};
// ここから最後までテンプレ
signed main() {
srand((unsigned int)time(NULL));
cout << fixed << setprecision(20);
cerr << fixed << setprecision(3);
auto ptr = new Solver();
ptr->solve();
delete ptr;
// while(true) {
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
// while (true) {
// if (cin.eof() == true) break;
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
return 0;
}
| replace | 204 | 215 | 204 | 209 | TLE | |
p02754 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B, blues, r;
cin >> N >> A >> B;
r = N % (A + B);
blues = (N / (A + B)) * A;
blues += min(A, r);
cout << blues << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, blues, r;
cin >> N >> A >> B;
r = N % (A + B);
blues = (N / (A + B)) * A;
blues += min(A, r);
cout << blues << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.