text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int c, l, v0, v1, a;
cin >> c >> v0 >> v1 >> a >> l;
int day, read = v0, v = v0;
for (day = 1; read < c; ++day) {
read -= l;
v = min(v + a, v1);
read += v;
}
cout << day;
}
|
#include <bits/stdc++.h>
using namespace std;
int pages, speed, maxspeed, accel, reread, days;
int main() {
scanf("%d%d%d%d%d", &pages, &speed, &maxspeed, &accel, &reread);
while (pages > 0) {
if (days > 0) pages += reread;
pages -= speed;
speed = min(maxspeed, speed + accel);
days++;
}
printf("%d\n", days);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int loc = v0, ans = 1;
if (v0 >= c)
cout << 1;
else {
while (loc < c) {
ans++;
v0 = min(v1, v0 + a);
loc -= l;
loc += v0;
if (loc >= c) break;
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
long long int d = 0;
while (c > 0) {
if (c > 0) d++;
c = c - v0;
if (d > 1) c = c + l;
if (v0 + a > v1) {
v0 = v1;
} else
v0 = v0 + a;
}
cout << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, v1, v2, a, l, c = 1, sum = 0;
cin >> n >> v1 >> v2 >> a >> l;
sum = v1;
while (sum < n) {
sum += (min(v2, (v1 + (c * a))) - l);
c++;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int c, v0, v1, a, l, i, p = 0;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
for (i = 0;; i++) {
if (i == 0)
p = v0;
else if (v0 + i * a <= v1)
p = p + v0 + i * a - l;
else
p = p + v1 - l;
if (p >= c) break;
}
printf("%d", i + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
if (c <= v0) {
cout << '1' << endl;
} else {
int sol = 1;
int i = 1;
c -= v0;
while (c > 0) {
if ((v0 + i * a) < v1) {
c -= (v0 + i * a - l);
i++;
} else {
c -= (v1 - l);
}
sol++;
}
cout << sol << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e5 + 10;
const long long MOD = (long long)1e9 + 7;
int main() {
int c, v1, v0, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int ans = 0, tol = 0;
while (tol < c) {
ans++;
tol += v0;
if (ans > 1) tol -= l;
v0 += a;
v0 = min(v1, v0);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000010], d[1000010];
long long b[100010], c[1010][1010];
long long mn = 1e18, mx = -1e18, ans, cnt, sm = 1, n, m, cur;
bool ok, okk, u[1000010], uu[310][310], uk[1000010];
char ck[510][510], ch[100010];
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
vector<long long> g[900010], an[100];
int main() {
std::ios::sync_with_stdio(false);
long long cc, v, vv, aa, l;
cin >> cc >> v >> vv >> aa >> l;
while (cc > 0) {
long long k = v + aa * cnt;
k = min(k, vv);
cc -= k;
cnt++;
if (cc <= 0) {
cout << cnt;
return 0;
}
cc += l;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, temp = 0, p = 1;
cin >> c >> v0 >> v1 >> a >> l;
temp = v0;
while (temp < c) {
if (v0 < v1) v0 = v0 + a;
if (v0 >= v1) v0 = v1;
temp = temp + v0 - l;
p++;
}
cout << p;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, l, a;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
int cur = 1;
c -= min(c, v0);
while (c > 0) {
cur++;
c += l;
v0 = min(v1, v0 + a);
c -= min(c, v0);
}
printf("%d\n", cur);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int day = 1;
int now = v0;
int speed = v0;
while (now < c) {
day++;
speed = min(speed + a, v1);
now += speed - l;
}
cout << day;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, v0, v1, a, l, pg;
scanf("%d %d %d %d %d", &c, &v0, &v1, &a, &l);
n = 1;
pg = v0;
while (pg < c) {
n++;
v0 = min(v1, v0 + a);
pg += (v0 - l);
}
printf("%d\n", n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MOD(1e9 + 7);
const int MAXN(1e5 + 11);
int n, first, z, a, l;
int main() {
scanf("%d%d%d%d%d", &n, &first, &z, &a, &l);
int ans = 0;
for (int ptr = 0; ptr < n;) {
if (ptr)
ptr += max(0, first - l);
else
ptr += first;
first += a;
first = min(first, z);
++ans;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename G>
inline void read(G &x) {
x = 0;
char c;
while (!isdigit(c = getchar()))
;
do {
x = x * 10 + c - '0';
} while (isdigit(c = getchar()));
}
template <typename G>
inline void write(G x) {
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
template <class T>
inline T min(T a, T b, T c) {
return min(a, min(b, c));
}
template <class T>
inline T min(T a, T b, T c, T d) {
return min(a, min(b, c, d));
}
template <class T>
inline T max(T a, T b, T c) {
return max(a, max(b, c));
}
template <class T>
inline T max(T a, T b, T c, T d) {
return max(a, max(b, c, d));
}
const int MAXN = 1e5 * 5;
const int base = 1e9 + 7;
const int N = 5000;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c, v1, v2, a, l;
cin >> c >> v1 >> v2 >> a >> l;
c -= v1;
v1 += a;
v1 = min(v1, v2);
int ans = 1;
while (c > 0) {
++ans;
c += l;
c -= v1;
v1 += a;
v1 = min(v1, v2);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int c, v0, v1, a, l, d;
int main() {
cin >> c >> v0 >> v1 >> a >> l;
while (c > 0) {
if (a * d + v0 < v1) {
if (d != 0)
c -= a * d + v0 - l;
else
c -= v0;
} else {
if (d != 0)
c -= v1 - l;
else
c -= v1;
}
d++;
}
cout << d;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int c, v0, v1, a, l;
int sum = 0;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
if (c < v0)
printf("1");
else {
c -= v0;
while (c > 0) {
if (v0 + a >= v1)
v0 = v1;
else
v0 += a;
c -= v0;
sum++;
c += l;
}
printf("%d", sum + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int v0, v1, a, l, c;
cin >> c >> v0 >> v1 >> a >> l;
int days = 0, pages = 0, speed;
while (pages < c) {
if (days == 0) {
pages = v0;
days++;
} else {
speed = v0 + days * a;
if (speed < v1) {
pages = pages + speed - l;
days++;
} else {
pages = pages + v1 - l;
days++;
}
}
}
cout << days << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, l, v1, a;
cin >> c >> v0 >> v1 >> a >> l;
int i = 0;
int cc = 0;
while (cc < c) {
cc += (min(v1, v0 + i * a));
if (i) cc -= l;
i++;
}
cout << (i) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int cur = 0, ans = 0;
while (cur < c) {
if (cur + v0 >= c) {
cout << ans + 1 << endl;
return 0;
}
cur = max(cur + v0 - l, 0);
v0 = min(v0 + a, v1);
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int c, l, v0, v1, a;
cin >> c >> v0 >> v1 >> a >> l;
int x = 1, s = v0;
while (s < c) {
s -= l;
v0 = min(v0 + a, v1);
++x;
s += v0;
}
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, day = 0, str = 0;
cin >> c >> v0 >> v1 >> a >> l;
while (str < c) {
if (day >= 1) {
v0 += a;
if (v0 > v1) v0 = v1;
str -= l;
}
str += v0;
day++;
}
cout << day;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c, vs, vm, a, l, d = 1, cur;
cin >> c;
cin >> vs;
cin >> vm;
cin >> a;
cin >> l;
cur = vs;
while (cur < c) {
cur = cur - l;
if ((vs + d * a) < vm)
cur += vs + d * a;
else
cur += vm;
d++;
}
cout << d;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gc(long long int kl, long long int yu) {
long long int pp;
for (pp = min(kl, yu); pp >= 1; pp--) {
if (kl % pp == 0 && yu % pp == 0) break;
}
if (pp == 1)
return 1;
else
return 0;
}
int isP(long int hj) {
long int op;
for (op = 2; op <= sqrt(hj); op++) {
if (hj % op == 0) return 0;
}
return 1;
}
void swap(int *p, int *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
void tog(int *p) {
if (*p == 1)
*p = 0;
else
*p = 1;
}
int fdi(int hi) {
switch (hi) {
case 0:
return 6;
case 1:
return 2;
case 2:
return 5;
case 3:
return 5;
case 4:
return 4;
case 5:
return 5;
case 6:
return 6;
case 7:
return 3;
case 8:
return 7;
case 9:
return 6;
}
}
int main() {
long long int v1, cur, p, up, a, b, lc, la, max, c, e, preI, t1, t2, g, brk,
L, clbp, clb, et, jmp, u, l1, l2, sp, sq, nd, maxi, li, ri, tr, mp, og,
prev, lt1, lt2, n1, n2, c1, c2, jb, minI, min1, dp, p2, p3, ze, fst, lst,
min2, s, sm1, sm2, sm3, sr, sl, l, ln, rz, rn, car, eq, r, shr, ng, d, v,
curr, spl, fl, z, ev, od, t, m, ct, j, q, k, maxI, max1, max2, lt, md, f,
n, xP, xN, w, h, d2, d1, u1, u2, sm, i, x, y;
cin >> c >> v >> v1 >> a >> l;
cur = 0;
cur = v;
d = 1;
if (cur >= c)
cout << "1";
else {
for (i = 1;; i++) {
if ((v + (i * a)) > v1)
cur += (v1 - l);
else
cur += ((v + (i * a)) - l);
d++;
if (cur >= c) break;
}
cout << d;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l, i, p;
int main() {
cin >> c >> v0 >> v1 >> a >> l;
for (i = 1, p = 0;; ++i) {
if (v0 > v1) v0 = v1;
p += v0;
if (p >= c) break;
p -= l;
v0 += a;
}
cout << i;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int c, v0, v1, a, l;
scanf("%d %d %d %d %d", &c, &v0, &v1, &a, &l);
int ans = 0;
while (c > 0) {
c = c - v0;
ans++;
if (c <= 0) break;
v0 = min(v0 + a, v1);
c = c + l;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int c, v0, v1, a, l, ans = 0, aux, read;
cin >> c >> v0 >> v1 >> a >> l;
aux = 0;
read = v0;
while (aux < c) {
aux = max(0, aux - l);
aux += read;
read += a;
read = min(read, v1);
ans++;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, tot, d = 1;
cin.tie(0);
cin.sync_with_stdio(0);
cout.tie(0);
cin >> c >> v0 >> v1 >> a >> l;
tot = v0;
while (tot < c) {
tot += min(v1, v0 + a * (d)) - l;
d++;
}
cout << d;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c;
int v0;
int v1;
int a;
int l;
int speed;
int main() {
cin >> c >> v0 >> v1 >> a >> l;
speed = v0;
if (speed >= c)
cout << 1;
else
for (int t = 2; t <= c; t++) {
speed = min(speed + a, v1);
v0 = v0 - l + speed;
if (v0 >= c) {
cout << t;
return 0;
}
}
}
|
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const double e = exp(1.0);
const int INF = 0x7fffffff;
;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <class T>
inline T Min(T a, T b) {
return a < b ? a : b;
}
template <class T>
inline T Max(T a, T b) {
return a > b ? a : b;
}
bool cmpbig(int a, int b) { return a > b; }
bool cmpsmall(int a, int b) { return a < b; }
using namespace std;
int main() {
int c, v0, v1, a, l;
while (~scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l)) {
int t = 1;
int v = v0;
c -= v;
while (c > 0) {
v = min(v0 + t * a, v1);
v -= l;
c -= v;
t++;
}
cout << t << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int c, v0, v1, a, l, i = 1;
cin >> c >> v0 >> v1 >> a >> l;
int days = 1;
int read = v0;
int to_read = 0;
while (1) {
if (read >= c) {
cout << days << endl;
break;
}
to_read = min(v1, v0 + i * a);
read = read + to_read - l;
days++;
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, k, x, res = 0, sum = 0;
int a[100007], b[100007];
std::vector<int> v;
int main() {
int c, v, v1, a, l, i;
cin >> c >> v >> v1 >> a >> l;
for (i = 0;; i++) {
c -= min(v1, v + (i * a));
if (i != 0) c += l;
if (c <= 0) {
cout << i + 1 << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long a, b, c, i, j, k, l, m, t, x, y, n, z;
vector<long long> a1;
string s;
cin >> c >> x >> y >> a >> l;
b = 0;
i = 0;
while (i < c) {
b++;
if (b > 1) i = i - l;
i = i + min(y, (x + ((b - 1) * a)));
}
cout << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct IntCmp {
bool operator()(const std::pair<std::string, int> &lhs,
const std::pair<std::string, int> &rhs) {
return lhs.second > rhs.second;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long c, v0, v1, a, l, cnt = 0, days = 0, speed;
cin >> c >> v0 >> v1 >> a >> l;
while (cnt < c) {
days++;
if (days == 1) {
speed = v0;
cnt += speed;
continue;
} else
speed += a;
if (speed > v1) speed = v1;
cnt += speed - l;
}
cout << days;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long c, v0, v1, a, l, tot = 0, d = 1;
cin >> c >> v0 >> v1 >> a >> l;
tot = v0;
while (tot < c) {
if (v0 + a <= v1)
v0 += a;
else
v0 = v1;
tot += v0 - l;
d++;
}
cout << d;
}
|
#include <bits/stdc++.h>
using namespace std;
long c, v, v1, a, l;
int main() {
cin >> c >> v >> v1 >> a >> l;
long sum = v, days = 1, num = v;
while (sum < c) {
num = min(v1, num + a);
sum += num - l;
days++;
}
cout << days;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int count = 1, temp = v0, i = 1, multiply;
while (temp < c) {
count++;
multiply = v0 + a * i;
if (multiply > v1) multiply = v1;
temp = temp + multiply - l;
i++;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int s = v0, ans = 1;
;
while (s < c) {
s -= l;
v0 = min(v0 + a, v1);
s += v0;
ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long c, v0, v1, a, l;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> c >> v0 >> v1 >> a >> l;
int cnt = v0;
for (int i = 1;; ++i) {
if (cnt >= c) {
cout << i;
return 0;
}
v0 = min(v0 + a, v1);
cnt += v0 - l;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int main() {
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
int cur = v0, cnt = 1;
while (cur < c) {
v0 = min(v1, v0 + a);
cur -= l;
cur += v0;
cnt++;
}
printf("%d", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, days = 1;
cin >> c >> v0 >> v1 >> a >> l;
c -= v0;
v0 += a;
if (v0 > v1) {
v0 = v1;
}
while (c > 0) {
days++;
c += l;
c -= v0;
v0 += a;
if (v0 > v1) {
v0 = v1;
}
}
cout << days;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int pages, v0, v1, l, a;
cin >> pages >> v0 >> v1 >> a >> l;
int last_day = v0;
pages = pages - v0;
int total = v0;
int today = 0;
for (int i = 1; i < 10005; i++) {
if (pages <= 0) {
cout << i;
break;
}
today = v0 + i * a;
if (today > v1) {
today = v1;
}
if (total < l) {
today = today - total;
} else {
today = today - l;
}
pages = pages - today;
last_day = today;
total = total + today;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
long long r = min(v0, v1);
long long ans = 1;
while (r < c) {
long long v = min(v0 + a, v1);
r = r + v - l;
ans++;
v0 = v;
}
std::cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int sol(int c, int v0, int v1, int a, int l) {
if (c <= v0) return 1;
int rp = v0;
int days = 1;
int x = 0;
while (1) {
days++;
x++;
int y = v0 + x * a;
if (y > v1) y = v1;
rp += y - l;
if (rp >= c) return days;
}
}
int main() {
int c, v0, v1, a, l;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
printf("%d\n", sol(c, v0, v1, a, l));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
int con = 0;
while (1) {
c = c - min(v0 + con * a, v1);
if (c < 1) break;
c += l;
con++;
}
printf("%d\n", con + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int speed = v0;
int ans = 0;
while (c > 0) {
if (ans > 0)
c = c - (speed) + l;
else
c = c - speed;
speed = speed + a;
if (speed > v1) speed = v1;
ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int c, v0, v1, a, l;
while (cin >> c >> v0 >> v1 >> a >> l) {
int cnt = 1;
while (cnt++) {
c -= v0;
if (c <= 0) break;
v0 += a;
if (v0 > v1) v0 = v1;
c += l;
}
cout << cnt - 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int cnt = 1, p = v0, rate = v0;
while (p < c) {
rate = min(v1, rate + a);
p += rate - l;
cnt++;
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, pages = 0, i;
cin >> c >> v0 >> v1 >> a >> l;
for (i = 0;; i++) {
if (i == 0 && v0 + i * a <= v1)
pages = pages + (v0 + i * a);
else if (v0 + i * a <= v1) {
pages = pages + (v0 + i * a - 1);
} else if (v0 + i * a > v1)
pages = pages + v1 - 1;
if (pages >= c) break;
pages = pages - l + 1;
}
cout << i + 1 << endl;
}
|
#include <bits/stdc++.h>
long long int gcd(long long int a, long long int b) {
return (b) ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(std::max(a, b), std::min(a, b));
}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int c, vi, vm, a, re;
cin >> c >> vi >> vm >> a >> re;
int ans = 0;
int te = vi;
ans++;
while (te < c) {
vi += a;
if (vi > vm) vi = vm;
te += vi - re;
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int modpow(long long int base, long long int exp, long long int mod) {
if (mod == 1) return 0;
long long int res = 1;
while (exp > 0) {
if (exp % 2) res = (res * base) % mod;
base = (base * base) % mod;
exp /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
long long int c, v0, v1, a, l, count = 0, flag = 1;
cin >> c >> v0 >> v1 >> a >> l;
while (c > 0) {
if (flag == 1) {
c = c - v0;
flag = 0;
if (v0 + a < v1)
v0 += a;
else
v0 = v1;
count++;
} else {
flag = 0;
c = c - v0 + l;
if (v0 + a < v1)
v0 += a;
else
v0 = v1;
count++;
}
}
cout << count << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int ans = 1;
c -= min(v0, v1);
int p = 0;
while (c > 0) {
v0 = v0 + a;
p = min(v0, v1);
p -= l;
c -= p;
ans++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> c >> v0 >> v1 >> a >> l;
int cnt = 0, curp = 0;
for (int i = 1;; i++) {
int last = min(v1, v0 + cnt * a);
if (i != 1) last -= l;
curp += last;
cnt++;
if (curp >= c) return cout << i, 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int get_today(int t) {
int ans = v0 + a * (t - 1);
if (ans >= v1) ans = v1;
if (t >= 2) {
int sub = l;
sub = min(sub, v0 + a * (t - 2));
ans -= sub;
}
return ans;
}
int main() {
cin >> c >> v0 >> v1 >> a >> l;
int ans = 1, sum = 0;
for (;; ++ans) {
sum += get_today(ans);
if (sum >= c) break;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c, v0, v1, a, l, c1 = 0, c2 = 0;
cin >> c >> v0 >> v1 >> a >> l;
while (true) {
c1++;
c2 += v0;
if (c2 >= c) {
cout << c1;
return 0;
}
v0 += a;
v0 = min(v0, v1);
c2 -= l;
c = max(c, (long long)0);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, s, v0, v1, l, a;
string st;
int main() {
cin >> n >> v0 >> v1 >> a >> l;
while (n > 0) {
n -= v0;
if (s) n += l;
v0 = min(v1, v0 + a);
s++;
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, v, a, l, page;
while (cin >> c >> v0 >> v1 >> a >> l) {
int i = 0;
for (;; i++) {
if (i == 0)
v = v0;
else
v = v0 + i * a;
if (v >= v1) v = v1;
if (i == 0)
c = c - v;
else
c = c - v + l;
if (c <= 0) break;
}
cout << i + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int t;
void solve();
struct edge {
int a, b, cost;
};
int n, m;
vector<edge> e;
const int INF = 1000000000;
int main() {
t = 1;
for (int i = 0; i < t; ++i) {
solve();
}
}
void solve() {
int l, v1, v2, c, a;
cin >> c >> v1 >> v2 >> a >> l;
c -= v1;
if (c <= 0) {
cout << 1 << endl;
return;
}
int ans = 1;
for (;;) {
ans++;
v1 += a;
if (v1 > v2) {
v1 = v2;
}
c += l;
c -= v1;
if (c <= 0) {
cout << ans;
return;
}
}
}
|
#include <bits/stdc++.h>
int main() {
int c, v, v1, a, l, d = 0, total = 0;
scanf("%d%d%d%d%d", &c, &v, &v1, &a, &l);
while (c > total) {
if (v + d * a > v1)
total = total + v1 - (d == 0 ? 0 : l);
else
total += v + d * a - (d == 0 ? 0 : l);
d++;
}
printf("%d", d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void solve() {
int c, u, v, a, l;
cin >> c >> u >> v >> a >> l;
int days = 0;
while (c > 0) {
days++;
if (days != 1) c += l;
int diff = u + (days - 1) * a;
if (v < diff) diff = v;
c -= diff;
}
cout << days << endl;
}
int main() { solve(); }
|
#include <bits/stdc++.h>
int main() {
int c, v0, v1, a, l, d = 1;
scanf("%d %d %d %d %d", &c, &v0, &v1, &a, &l);
c -= v0;
while (c > 0) {
d += 1;
c += l;
v0 += a;
if (v0 > v1) v0 = v1;
c -= v0;
}
printf("%d", d);
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int main() {
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
int num = 1, left = c;
for (;;) {
left -= v0;
if (num != 1) left += l;
if (left <= 0) break;
v0 += a;
v0 = (v0 > v1) ? v1 : v0;
num++;
}
printf("%d\n", num);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c, v0, v1, a, l, ctr = 0, pg = 0, xx;
scanf("%lld", &c);
scanf("%lld", &v0);
scanf("%lld", &v1);
scanf("%lld", &a);
scanf("%lld", &l);
while (1) {
xx = v0 + ctr * a;
ctr++;
if (xx >= v1) {
xx = v1;
}
if (ctr == 1)
pg += xx;
else
pg += (xx - l);
if (pg >= c) {
break;
}
}
cout << ctr << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int cpag = v0;
int add = v0;
int ans = 1;
while (cpag < c) {
add = min(v1, add + a);
cpag += add - l;
ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, v0, v1, l;
cin >> c >> v0 >> v1 >> a >> l;
int cur = v0;
int ans = 0;
int s = 0;
while (true) {
ans++;
s += cur;
if (s >= c) {
break;
}
cur = min(cur + a, v1);
s = s - l;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int c = 0, v0 = 0, v1 = 0, a = 0, l = 0;
cin >> c >> v0 >> v1 >> a >> l;
int lec = v0;
int days = 1;
while (lec < c) {
lec -= l;
if ((v0 + (a * days)) > v1) {
lec = lec + v1;
} else {
lec = lec + v0 + (a * days);
}
++days;
}
cout << days << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t n, v0, v1, a, l;
map<int, int> mp[51];
int main() {
int c = 0;
int ret = 0;
cin >> n >> v0 >> v1 >> a >> l;
while (c < n) {
if (c != 0) {
c -= l;
}
c += v0;
v0 = min(v1, v0 + a);
ret++;
}
cout << ret;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int days = 0, ans = 0, val;
while (true) {
val = (v0 + (days)*a);
ans += (val > v1) ? v1 : val;
days++;
if (days > 1) ans -= l;
if (ans >= c) break;
}
cout << days << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 113;
const long long INF = 2e18 + 113;
int c, v, mx, add, l;
int ans = 1;
int main() {
cin >> c >> v >> mx >> add >> l;
c = max(0, c - v);
v = min(mx, v + add);
while (c) {
c += l;
++ans;
c = max(0, c - v);
v = min(mx, v + add);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isSubSequence(string str1, string str2, int m, int n) {
int j = 0;
for (int i = 0; i < n && j < m; i++) {
if (str1[j] == str2[i]) j++;
}
return (j == m);
}
int isPrime(long long n) {
for (int i = 2; i < sqrt(n); i++)
if (n % i == 0) return 0;
return 1;
}
int isSquare(long long n) { return (long long)sqrt(n) * (sqrt(n)) == n; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int c, v0, v1, n, i, j, k, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int day = 1, speed = v0 - a, read = 0;
while (1) {
if ((speed + a <= v1))
speed = speed + a;
else
speed = v1;
if (day != 1) read -= l;
if (read < 0) read = 0;
read += speed;
if (read >= c) return cout << day, 0;
day++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void doRoutine() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
ifstream fin("/home/max/user/alg/codeforces_clion/input.txt");
ofstream fout("/home/max/user/alg/codeforces_clion/output.txt");
signed main() {
doRoutine();
int64_t c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int64_t ans = 0, cur_pages = 0, cur_v = v0;
bool is_first_day = true;
while (true) {
++ans;
int64_t last = cur_pages + cur_v;
if (!is_first_day) {
last -= l;
} else {
is_first_day = false;
}
if (last >= c) {
cout << ans << endl;
return 0;
}
cur_pages = last;
cur_v = min(cur_v + a, v1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
int vs, days = 0, npr = 0;
cin >> c;
cin >> v0;
cin >> v1;
cin >> a;
cin >> l;
vs = v0;
c -= v0;
days++;
while (c > 0) {
if (vs < v1) {
vs += a;
if (vs > v1) vs = v1;
c -= vs - l;
days++;
} else {
c -= v1 - l;
days++;
}
}
cout << days;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, a, v0, v1, l;
cin >> c >> v0 >> v1 >> a >> l;
int ans = 1;
int read = v0;
if (read >= c)
cout << ans << endl;
else {
while (read < c) {
read -= l;
if (v0 < v1) {
v0 += a;
}
if (v0 > v1) {
v0 = v1;
}
++ans;
read += v0;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const int mod = 1000000007;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int c, v0, v1, a, l;
int ans = 1;
cin >> c >> v0 >> v1 >> a >> l;
c = c - v0;
v0 = v0 + a;
while (c > 0 && v0 <= v1) {
ans++;
c = c - v0 + l;
v0 = v0 + a;
}
v1 = v1 - l;
while (c > 0) {
ans++;
c = c - v1;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int work() {
int c, v0, v1, a, l, ans = 1, num = 0, tmp = 0;
scanf("%d%d%d%d%d", &c, &v0, &v1, &a, &l);
num += v0, tmp += v0;
while (num < c) {
tmp += a;
if (tmp >= v1) tmp = v1;
ans++, num = num + tmp - l;
}
printf("%d", ans);
return 0;
}
int sh = work();
int main() { return 0; }
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c;
int v[2];
int a, l;
cin >> c;
cin >> v[0] >> v[1];
cin >> a >> l;
int pages = 0;
int count = 0;
while (pages < c) {
if (!count)
pages = v[0];
else
pages += v[0] - l;
v[0] += a;
v[0] = min(v[0], v[1]);
count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, vl, a, l, r = 0, day = 0;
cin >> c >> v0 >> vl >> a >> l;
if (v0 <= vl)
r += v0, v0 += a, day++;
else
r += vl, v0 += a, day++;
if (c <= r) {
cout << day << endl;
return 0;
}
while (1) {
r -= l;
if (v0 <= vl)
r += v0, v0 += a, day++;
else
r += vl, v0 += a, day++;
if (c == r || c < r) break;
}
cout << day << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double g = 10.0, eps = 1e-9;
const int N = 1000 + 10, maxn = 1000 + 10, inf = 1000000000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int sum = 0, k = 0;
while (sum < c) {
sum += v0;
if (k) sum -= l;
k++;
v0 += a;
if (v0 > v1) v0 = v1;
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k = 1, l, n, m, a, v0, v1, c;
cin >> c >> v0 >> v1 >> a >> l;
long long int q = v0;
for (i = 1;; i++) {
if (v0 >= c) {
cout << k;
return 0;
} else {
v0 -= l;
m = a * i + q;
if (m >= v1) {
v0 += (v1);
} else {
v0 += m;
}
k++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc, ca = 0;
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int ans = 1;
int i = 1;
c -= v0;
while (c > 0) {
int cut = v0 + (i * a);
cut = min(cut, v1) - l;
c -= cut;
ans++;
i++;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int ans;
int main() {
cin >> c >> v0 >> v1 >> a >> l;
while (1) {
ans++;
if (ans >= 2) c += l;
c -= v0;
if (c <= 0) break;
v0 = min(v1, v0 + a);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v1, v2, a, l;
cin >> c >> v1 >> v2 >> a >> l;
int ans = 1;
c = c - v1;
while (c > 0) {
if (v1 + a >= v2)
v1 = v2;
else
v1 = v1 + a;
c = c - v1 + l;
ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int res = 0, n = -1, atemp = a;
res = 1;
c = c - v0;
if (v0 == 0) {
res = 0;
}
while (c > 0) {
if ((v0 + a) > v1) {
break;
}
c = c - v0 - a + l;
a = a + atemp;
res++;
}
if (c > 0) {
n = ceil((float)c / (v1 - l));
res = res + n;
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int now = 0, ans = 0, re = v0;
while (now < c) {
ans++;
now = max(0, now - l);
now += re;
re += a;
re = min(re, v1);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int count = 0;
int pages = v0;
for (int i = 1;; i++) {
count++;
if (pages >= c) break;
pages = pages - l;
if (v0 + (i * a) <= v1)
pages = pages + (v0 + (i * a));
else {
pages = pages + v1;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, p = 1, s = 0;
cin >> a >> b >> c >> d >> e;
while (p <= a) {
p += min(b + d * s, c);
s++;
if (p > a) break;
p -= e;
}
cout << s << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int v0, v1, c, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int count = 1;
c -= v0;
while (c > 0) {
if (v0 + count * a > v1) {
c -= v1 - l;
} else
c -= v0 + count * a - l;
count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int c, v0, v1, a, l;
while (cin >> c >> v0 >> v1 >> a >> l) {
int k = 0, sum = 0, inc = v0;
while (true) {
k++, sum += inc;
if (sum >= c) break;
sum -= l;
inc += a;
if (inc >= v1) inc = v1;
}
cout << k << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int main() {
scanf("%d %d %d %d %d", &c, &v0, &v1, &a, &l);
int s = 0, d = v0 - a;
for (int i = 1;; i++) {
d += a;
if (d >= v1) d = v1;
if (i == 1)
s += d;
else
s += d - l;
if (s >= c) {
printf("%d\n", i);
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int cawal;
void sub(int day) {
c = min(cawal, c + l);
int kurang = min(v1, v0 + a * day);
c -= kurang;
}
int main() {
cin >> c >> v0 >> v1 >> a >> l;
cawal = c;
int i = 0;
while (c > 0) {
sub(i);
i++;
}
cout << i << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, v0, v1, c, l;
scanf("%d %d %d %d %d", &c, &v0, &v1, &a, &l);
int day = 0;
while (1) {
if (day >= 1) c = c + l;
c = c - v0;
if (v0 + a <= v1) {
v0 = v0 + a;
} else {
v0 = v1;
}
day++;
if (c <= 0) {
printf("%d\n", day);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int x = a;
long long total = v0;
int ans = 1;
while (total < c) {
total -= l;
total += min(v0 + a, v1);
a += x;
ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c, v0, v1, a, l, read, n, cnt = 1;
cin >> c >> v0 >> v1 >> a >> l;
read = v0;
if (read >= c) return (cout << cnt, 0);
while (read -= l, read < c) {
n = v0 + cnt * a + l;
if (n > v0 + cnt * a) n = v0 + cnt * a;
if (n > v1) n = v1;
read += n;
cnt++;
if (read >= c) break;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l, day = 0;
cin >> c >> v0 >> v1 >> a >> l;
while (c > 0) {
c -= v0;
day++;
if (c <= 0) break;
if (v0 + a > v1)
v0 = v1;
else
v0 += a;
c += l;
}
cout << day;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int ans = (c == 0 ? 0 : 1);
int inr = a;
c = c - v0;
while (c > 0) {
ans++;
if (v0 + inr < v1)
c = c + l - (v0 + inr);
else
c = c + l - v1;
inr += a;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
using namespace std;
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int j = 0;
int ans = 0;
while (j < c) {
ans++;
if (j > l)
j -= l;
else
j = 0;
j += v0;
if (v0 + a <= v1)
v0 += a;
else
v0 = v1;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int p = 0, d = 0, cnt = 0;
while (p < c) {
int q = min(v1, (v0 + (d * a)));
if (d >= 1) {
p += q - l;
} else {
p += q;
}
d++;
cnt++;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, v0, v1, a, l;
cin >> c >> v0 >> v1 >> a >> l;
int v = v0, k = 0;
while (c > 0) {
c -= v;
if (c <= 0) {
cout << k + 1 << endl;
return 0;
}
if (v + a <= v1)
v += a;
else
v = v1;
c += l;
k++;
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[10000], c, v0, v1, a, l;
int main() {
int i = 1, p;
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> c >> v0 >> v1 >> a >> l;
p = v0;
while (p < c) {
i++;
v0 += a;
if (p - l < 0)
p = 0;
else
p -= l;
if (v0 > v1)
p += v1;
else
p += v0;
}
cout << i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, v0, v1, a, l;
int d;
int main() {
cin >> c >> v0 >> v1 >> a >> l;
d = 1;
c = c - min(v0, v1);
v0 = min(v0, v1);
while (c > 0) {
d++;
c = c - min(v1, v0 + a) + l;
v0 = min(v0 + a, v1);
}
cout << d;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.