text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
if (a < b) a = b;
}
int d[22];
int dp[22][5];
pair<pair<int, int>, int> pre[22][5];
int cnt[22][2];
int main() {
int t;
long long n;
for (scanf("%d", &t); t--;) {
scanf("%I64d", &n);
int m = 0;
while (n) {
d[m++] = n % 10;
n /= 10;
}
memset(dp, 0, sizeof(dp));
dp[m][0] = 1;
for (int i = m; i--;) {
for (int j = 0; j < 5; j++) {
for (int a = 0; a <= 6; a++) {
for (int b = 0; b <= 6 - a; b++) {
int val = a * 4 + b * 7;
if ((val + j) % 10 != d[i]) continue;
if (dp[i + 1][(val + j) / 10]) {
dp[i][j] = 1;
pre[i][j] = pair<pair<int, int>, int>(pair<int, int>(a, b),
(val + j) / 10);
break;
}
}
if (dp[i][j]) break;
}
}
}
if (!dp[0][0])
puts("-1");
else {
for (int i = 0, up = 0; i < m; i++) {
cnt[i][0] = pre[i][up].first.first;
cnt[i][1] = pre[i][up].first.second;
up = pre[i][up].second;
}
for (int i = 0; i < 6; i++) {
long long val = 0;
for (int i = m; i--;) {
val *= 10;
if (cnt[i][0] > cnt[i][1])
val += 4, cnt[i][0]--;
else if (cnt[i][1])
val += 7, cnt[i][1]--;
}
printf("%I64d ", val);
}
puts("");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class _T>
inline void ina(_T a[], int n) {
for (int i = 0; i < n; i++) In(a[i]);
}
int TEST_CASE = 0;
template <class _T>
inline _T pow(_T a, _T b, _T m) {
a %= m;
_T ans = 1 % m;
while (b) {
if (b & 1) ans *= a, ans %= m;
a *= a;
a %= m;
b >>= 1;
}
return ans;
}
template <class _T>
inline _T pow(_T a, _T b) {
_T ans = 1;
while (b) {
if (b & 1) ans *= a;
a *= a;
b >>= 1;
}
return ans;
}
template <class _T>
inline _T add(_T a, _T b, _T m) {
return a >= m - b ? a - (m - b) : a + b;
}
template <class _T>
inline _T multiply(_T a, _T b, _T m) {
_T ans = 0;
if (b > a) swap(a, b);
while (b) {
if (b & 1) ans = add(ans, a, m);
b >>= 1;
a = add(a, a, m);
}
return ans;
}
template <class _T>
inline _T bigpow(_T a, _T b, _T m) {
a %= m;
_T ans = 1 % m;
while (b) {
if (b & 1) ans = multiply(ans, a, m);
a = multiply(a, a, m);
b >>= 1;
}
return ans;
}
template <class _T>
inline _T modinvers(_T a, _T m) {
return m > 2000000000LL ? bigpow(a, m - 2, m) : pow(a, m - 2, m);
}
template <class _T>
_T _egcd(_T a, _T b, _T &x, _T &y) {
if (!b) {
x = 1, y = 0;
return a;
}
_T _g = _egcd(b, a % b, x, y);
_T xt = x;
x = y, y = xt - (a / b) * y;
return _g;
}
template <class _T>
inline _T fmodinvers(_T a, _T m) {
_T x, y;
_egcd(a, m, x, y);
x %= m;
if (x < 0) x += m;
return x;
}
template <class _T>
inline _T _lcm(_T a, _T b) {
return (a * b) / __gcd(a, b);
}
template <class T>
inline T SQ(T a) {
return a * a;
}
long long SQRT(long long n) {
long long e = sqrt(n * 1.0);
long long l = max(0LL, e - 2), r = min(n, e + 2);
long long ans = 0;
while (l <= r) {
long long m = ((l + r) >> 1);
if (m * m <= n)
ans = m, l = m + 1;
else
r = m - 1;
}
return ans;
}
long long CBRT(long long n) {
long long e = cbrt(n * 1.0);
long long l = max(0LL, e - 2), r = min(n, e + 2);
long long ans = 0;
while (l <= r) {
long long m = ((l + r) >> 1);
if (m * m * m <= n)
ans = m, l = m + 1;
else
r = m - 1;
}
return ans;
}
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
const int SIZE = 1e6;
long long mod = 1e9 + 7;
int mem[5][20], ch4[5][20], ch7[5][20];
char N[22];
int dp(int i, int c) {
if (c < 0 || c > 4) return 0;
if (i == 19) return !c;
int &res = mem[c][i];
if (~res) return res;
res = 0;
for (int f = 0; f <= 6; f++) {
for (int s = 0; s + f <= 6; s++) {
res = res | dp(i + 1, c * 10 + N[i] - '0' - 4 * f - 7 * s);
if (res) {
ch4[c][i] = f, ch7[c][i] = s;
return res = 1;
}
}
}
return res;
}
char NM[6][20];
int main() {
int tc;
long long n;
cin >> tc;
while (tc--) {
cin >> n;
sprintf(N, "%019lld", n);
memset(mem, -1, sizeof(mem));
bool res = dp(0, 0);
if (res) {
for (int i = 0, c = 0; i < 19; i++) {
int j = 0;
for (; j < ch4[c][i]; j++) NM[j][i] = '4';
for (; j < ch4[c][i] + ch7[c][i]; j++) NM[j][i] = '7';
for (; j < 6; j++) NM[j][i] = '0';
c = c * 10 + N[i] - '0' - ch4[c][i] * 4 - ch7[c][i] * 7;
}
for (int j = 0; j < 6; j++) {
sscanf(NM[j], "%lld\n", &n);
cout << n << " ";
}
cout << '\n';
} else
cout << -1 << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline int size(const T& c) {
return c.size();
}
using namespace std;
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
const int d[3] = {0, 4, 7};
const int maxcs = 20;
struct tracer {
int i, j;
int s1, s2, s3, s4, s5, s6;
} tr[maxcs][10];
struct p6 {
int i1, i2, i3, i4, i5, i6;
} t6[100];
string s;
int t;
int G[100];
bool F[maxcs][10];
long long so[6];
p6 m6(int i1, int i2, int i3, int i4, int i5, int i6) {
p6 u;
u.i1 = i1;
u.i2 = i2;
u.i3 = i3;
u.i4 = i4;
u.i5 = i5;
u.i6 = i6;
return u;
}
tracer maketrace(int i, int j, int k) {
tracer res;
res.i = i;
res.j = j;
res.s1 = d[t6[k].i1];
res.s2 = d[t6[k].i2];
res.s3 = d[t6[k].i3];
res.s4 = d[t6[k].i4];
res.s5 = d[t6[k].i5];
res.s6 = d[t6[k].i6];
return res;
}
void trace(int i, int j) {
if (i == 0 && j == 0) return;
so[0] = so[0] * 10 + tr[i][j].s1;
so[1] = so[1] * 10 + tr[i][j].s2;
so[2] = so[2] * 10 + tr[i][j].s3;
so[3] = so[3] * 10 + tr[i][j].s4;
so[4] = so[4] * 10 + tr[i][j].s5;
so[5] = so[5] * 10 + tr[i][j].s6;
trace(tr[i][j].i, tr[i][j].j);
}
int main() {
cin >> t;
for (int i1 = (0), _b = (2); i1 <= _b; i1++)
for (int i2 = (0), _b = (2); i2 <= _b; i2++)
for (int i3 = (0), _b = (2); i3 <= _b; i3++)
for (int i4 = (0), _b = (2); i4 <= _b; i4++)
for (int i5 = (0), _b = (2); i5 <= _b; i5++)
for (int i6 = (0), _b = (2); i6 <= _b; i6++) {
G[d[i1] + d[i2] + d[i3] + d[i4] + d[i5] + d[i6]] = true;
t6[d[i1] + d[i2] + d[i3] + d[i4] + d[i5] + d[i6]] =
m6(i1, i2, i3, i4, i5, i6);
}
for (int i = (1), _b = (t); i <= _b; i++) {
cin >> s;
int l = 0;
int r = s.length() - 1;
while (l <= r) {
char tg = s[l];
s[l] = s[r];
s[r] = tg;
l++;
r--;
}
s = " " + s;
memset(F, false, sizeof(F));
F[0][0] = true;
for (int i = (0), _b = (s.length() - 2); i <= _b; i++) {
for (int j = (0), _b = (4); j <= _b; j++) {
if (F[i][j] == false) continue;
for (int k = (0), _b = (42); k <= _b; k++) {
if (G[k] && (k + j) % 10 == s[i + 1] - '0') {
F[i + 1][(k + j) / 10] = true;
tr[i + 1][(k + j) / 10] = maketrace(i, j, k);
}
}
}
}
if (F[s.length() - 1][0] == false)
cout << -1 << endl;
else {
memset(so, 0, sizeof(so));
trace(s.length() - 1, 0);
for (int i = (0), _b = (5); i <= _b; i++) cout << so[i] << ' ';
cout << endl;
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t;
bool vis[20][10];
vector<int> v;
int l;
long long n;
vector<int> ans[6];
void add(int s, int f) {
for (int i = 0; i < 6; ++i) ans[i].push_back(0);
for (int i = 0; i < s; ++i) ans[i].back() += 7;
for (int i = s; i < s + f; ++i) ans[i].back() += 4;
}
void print() {
for (int i = 0; i < 6; ++i) {
long long x = 0;
for (int j = ans[i].size() - 1; j >= 0; --j) x = (x * 10) + ans[i][j];
printf("%I64d ", x);
}
printf("\n");
}
bool check(int i, int ex) {
if (vis[i][ex]) return false;
vis[i][ex] = true;
if (i == 0) {
for (int s = 0; s <= 6; ++s)
for (int f = 0; s + f <= 6; ++f) {
int num = (s * 7) + (f * 4);
if (num % 10 == v[0] && num / 10 == ex) {
add(s, f);
return true;
}
}
return false;
}
for (int s = 0; s <= 6; ++s)
for (int f = 0; s + f <= 6; ++f) {
for (int prev = 0; prev <= 9; ++prev) {
int num = (s * 7) + (f * 4) + prev;
if (num % 10 == v[i] && num / 10 == ex) {
bool x = check(i - 1, prev);
if (x) {
add(s, f);
return true;
}
}
}
}
return false;
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%I64d", &n);
memset(vis, 0, sizeof vis);
for (int i = 0; i < 6; ++i) ans[i].clear();
v.clear();
long long x = n;
while (x) {
v.push_back(x % 10);
x /= 10;
}
l = v.size();
x = false;
x = check(l - 1, 0);
if (x) {
print();
continue;
}
if (l >= 2) {
x = check(l - 2, v[l - 1]);
if (x) {
print();
continue;
}
}
puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long T, X;
vector<long long> lucky, l = {0, 4, 7};
vector<long long> ans(6);
bool DP[10000][7];
bool dp(long long x, int i) {
if (i == 6) return (x == 0);
if (!DP[x][i]) return false;
for (long long y : lucky) {
if (y > x) break;
if (dp(x - y, i + 1)) {
ans[i] = y;
return true;
}
}
return DP[x][i] = false;
}
int main() {
for (int i1 = 0; i1 < (int)3; i1++)
for (int i2 = 0; i2 < (int)3; i2++)
for (int i3 = 0; i3 < (int)3; i3++)
lucky.push_back(l[i1] * 100 + l[i2] * 10 + l[i3]);
cin >> T;
while (T--) {
memset(DP, true, sizeof DP);
ans.assign(6, 0ll);
cin >> X;
long long X1 = X % 4000ll, X2 = X - X1;
if (!dp(X1, 0)) {
X1 += 4000ll;
X2 -= 4000ll;
if (X2 < 0 or !dp(X1, 0)) {
cout << -1 << '\n';
continue;
}
}
long long pow = 1000;
X2 = X2 / 4000ll;
while (X2) {
long long d = X2 % 10ll;
X2 /= 10ll;
if (d > 6) {
for (int i = 0; i < (int)4; i++) ans[i + 2] += 7ll * pow;
d -= 7ll;
}
for (int i = 0; i < (int)d; i++) ans[i] += 4ll * pow;
pow *= 10ll;
}
for (int i = 0; i < (int)6; i++) cout << ans[i] << ' ';
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct elements {
bool canBuild;
int digits[7];
};
struct path {
int a, b;
};
elements s[7 * 6 + 2];
int d[10];
void Try(int i, int sum) {
if (i > 6) {
s[sum].canBuild = true;
for (int j = 1; j <= 6; j++) s[sum].digits[j] = d[j];
return;
}
d[i] = 0;
Try(i + 1, sum);
d[i] = 4;
Try(i + 1, sum + 4);
d[i] = 7;
Try(i + 1, sum + 7);
}
void init() {
for (int i = 0; i <= 7 * 6; i++) s[i].canBuild = false;
Try(1, 0);
}
int main() {
init();
int testCases;
cin >> testCases;
while (testCases--) {
long long n;
cin >> n;
int digits[20], m = 0;
while (n > 0) {
m++;
digits[m] = n % 10;
n = n / 10;
}
bool f[m + 5][5];
path trace[m + 5][5];
memset(f, false, sizeof(f));
f[0][0] = true;
for (int i = 0; i <= m - 1; i++) {
for (int j = 0; j <= 4; j++) {
if (f[i][j]) {
for (int k = 0; k <= 42; k++) {
if ((s[k].canBuild) && ((j + k) % 10 == digits[i + 1])) {
int x = (j + k);
f[i + 1][x / 10] = true;
trace[i + 1][x / 10].a = j;
trace[i + 1][x / 10].b = k;
}
}
}
}
}
if (f[m][0]) {
long long res[10], j = 0;
memset(res, 0, sizeof(res));
while (m > 0) {
int x = trace[m][j].b;
for (int i = 1; i <= 6; i++) res[i] = res[i] * 10 + s[x].digits[i];
j = trace[m][j].a;
m--;
}
for (int i = 1; i <= 6; i++) cout << res[i] << " ";
cout << endl;
} else
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T Abs(T first) {
return (first < 0 ? -first : first);
}
template <typename T>
T Sqr(T first) {
return (first * first);
}
string plural(string s) {
return (int((s).size()) && s[int((s).size()) - 1] == 'x' ? s + "en"
: s + "s");
}
const int INF = (int)1e9;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
bool Read(int &first) {
char c, r = 0, n = 0;
first = 0;
for (;;) {
c = getchar();
if ((c < 0) && (!r)) return (0);
if ((c == '-') && (!r))
n = 1;
else if ((c >= '0') && (c <= '9'))
first = first * 10 + c - '0', r = 1;
else if (r)
break;
}
if (n) first = -first;
return (1);
}
int main() {
if (0) freopen("in.txt", "r", stdin);
int T;
int i, j, k, a, b, c;
long long ans[6];
char s[19];
int dig[19];
bool dyn[20][10];
int prevA[20][10], prevB[20][10], prevC[20][10], prevJ[20][10];
Read(T);
while (T--) {
scanf("%s", &s);
memset(dig, 0, sizeof(dig));
j = strlen(s);
for (i = 0; i < j; i++) dig[i] = s[j - i - 1] - '0';
memset(dyn, 0, sizeof(dyn));
dyn[0][0] = 1;
for (i = 0; i < 19; i++)
for (j = 0; j < 10; j++)
if (dyn[i][j])
for (a = 0; a < 7; a++)
for (b = 0; b < 7 - a; b++) {
c = 6 - a - b;
k = j + b * 4 + c * 7;
if (k % 10 != dig[i]) continue;
k /= 10;
if (!dyn[i + 1][k]) {
dyn[i + 1][k] = 1;
prevA[i + 1][k] = a;
prevB[i + 1][k] = b;
prevC[i + 1][k] = c;
prevJ[i + 1][k] = j;
}
}
if (!dyn[19][0])
printf("-1\n");
else {
memset(ans, 0, sizeof(ans));
j = 0;
for (i = 19; i > 0; i--) {
a = prevA[i][j];
b = prevB[i][j];
c = prevC[i][j];
for (k = 0; k < a; k++) ans[k] = ans[k] * 10;
for (k = a; k <= a + b - 1; k++) ans[k] = ans[k] * 10 + 4;
for (k = a + b; k <= 5; k++) ans[k] = ans[k] * 10 + 7;
j = prevJ[i][j];
}
for (i = 0; i < 6; i++) {
cout << ans[i];
if (i == 5)
printf("\n");
else
printf(" ");
}
}
}
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const int MAXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
long long x;
long long n1, n2;
bool little_lucky[11111];
long long lucky[] = {0, 4, 7, 40, 44, 47, 70, 74, 77,
400, 404, 407, 440, 444, 447, 470, 474, 477,
700, 704, 707, 740, 744, 747, 770, 774, 777};
vector<long long> dp_lucky[11111][7];
vector<long long> dp_g_lucky[11111][7];
vector<long long> g_lucky;
long long ans[6];
long long t_ans[6];
long long stk;
long long pot10 = 1;
long long tmp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int T;
cin >> T;
for (int(i) = (0); (i) < (11111); ++(i)) {
bool ok = 1;
int ret = i;
for (int j = 0; j < 7; ++j) {
int yo = ret % 10;
ret /= 10;
if (yo != 0 && yo != 4 && yo != 7) ok = 0;
}
if (ok) {
g_lucky.push_back(i);
dp_g_lucky[i][1].push_back(i);
}
}
for (int(i) = (0); (i) < (27); ++(i))
dp_lucky[lucky[i]][1].push_back(lucky[i]);
for (int(i) = (0); (i) < (11111); ++(i)) {
for (int(j) = (2); (j) < (7); ++(j)) {
for (int(k) = (0); (k) < (27); ++(k)) {
if (lucky[k] > i) break;
if (!dp_lucky[i - lucky[k]][j - 1].empty()) {
int len = int(dp_lucky[i - lucky[k]][j - 1].size());
dp_lucky[i][j].push_back(lucky[k]);
for (int(tt) = (0); (tt) < (len); ++(tt)) {
dp_lucky[i][j].push_back(dp_lucky[i - lucky[k]][j - 1][tt]);
}
break;
}
}
}
}
for (int(i) = (0); (i) < (11111); ++(i))
if (!dp_lucky[i][6].empty()) little_lucky[i] = 1;
for (int(i) = (0); (i) < (11111); ++(i)) {
for (int(j) = (2); (j) < (7); ++(j)) {
for (int(k) = (0); (k) < (g_lucky.size()); ++(k)) {
if (g_lucky[k] > i) break;
if (!dp_g_lucky[i - g_lucky[k]][j - 1].empty()) {
int len = int(dp_g_lucky[i - g_lucky[k]][j - 1].size());
dp_g_lucky[i][j].push_back(g_lucky[k]);
for (int(tt) = (0); (tt) < (len); ++(tt)) {
dp_g_lucky[i][j].push_back(dp_g_lucky[i - g_lucky[k]][j - 1][tt]);
}
break;
}
}
}
}
for (int(u) = (0); (u) < (T); ++(u)) {
cin >> x;
if (x < 11111) {
if (dp_g_lucky[x][6].empty())
cout << "-1" << endl;
else {
for (int(i) = (0); (i) < (6); ++(i)) cout << dp_g_lucky[x][6][i] << " ";
cout << endl;
}
continue;
}
n1 = x % 4000;
if (!little_lucky[n1]) {
n1 += 4000;
}
n2 = x - n1;
for (int(i) = (0); (i) < (6); ++(i)) ans[i] = dp_lucky[n1][6][i];
for (int(i) = (0); (i) < (6); ++(i)) t_ans[i] = 0LL;
stk = n2 / 4000;
pot10 = 1LL;
for (int(j) = (0); (j) < (15); ++(j)) {
tmp = stk % 10;
stk /= 10;
if (tmp <= 6) {
for (int(i) = (0); (i) < (tmp); ++(i)) t_ans[i] += 4 * pot10;
} else {
for (int(i) = (0); (i) < (4); ++(i)) t_ans[i] += 7 * pot10;
for (int(i) = (0); (i) < (tmp - 7); ++(i)) t_ans[i + 4] += 4 * pot10;
}
pot10 *= 10;
}
for (int(i) = (0); (i) < (6); ++(i)) ans[i] += 1000 * t_ans[i];
for (int(i) = (0); (i) < (6); ++(i)) {
cout << ans[i] << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const long long LINF = 1e18 + 100;
int32_t main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int a, b;
cin >> a >> b;
int x = 0, ans = 0;
while (a) {
ans += a;
x += a;
a = x / b;
x %= b;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, n = 0, i;
scanf("%d%d", &a, &b);
n = a;
for (i = 0; a / b != 0; i++) {
n += a / b;
a = a / b + a % b;
}
printf("%d\n", n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = a;
while (a >= b) {
cnt += (a / b);
int x = (a % b);
a = a / b + x;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, count = 0;
cin >> n >> x;
count += n;
while (n >= x) {
count += n / x;
n = n / x + n % x;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans;
ans = n;
while (n >= m) {
ans += n / m;
n = n % m + n / m;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k = n;
int f = n;
while (f >= m) {
k += f / m;
f = f % m + f / m;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, sum, x;
int main() {
cin >> a >> b;
while (a) {
sum += a;
x += a % b;
a /= b;
a += x / b;
x %= b;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ms[100005];
int main() {
int a, b;
cin >> a >> b;
int ans = a;
int tmp;
while (true) {
int new_s = a / b;
ans += new_s;
a = new_s + (a % b);
if (a < b) break;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, sum = 0, c;
scanf("%d%d", &a, &b);
sum = a;
while (1) {
c = a / b;
a = c + (a % b);
sum += c;
if (a < b) break;
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, count = 0;
cin >> a >> b;
count += a;
while (a / b > 0) {
count += (a / b);
a = (a / b) + (a % b);
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, h = 0, r = 0;
scanf("%d %d", &a, &b);
while (a > 0) {
h += a;
r += a % b;
a = a / b;
while (r >= b) {
a++;
r -= b;
}
}
printf("%d\n", h);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0, t = 0;
cin >> a >> b;
while (a) {
if (++t % b != 0) a--;
sum++;
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, e, g, s;
cin >> n >> m;
s = n;
while (1) {
e = n % m;
g = n / m;
s += g;
g += e;
n = g;
if (g < m) {
break;
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = a;
while (a >= b) {
s = s + (a / b);
a = a / b + (a % b);
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, hours = 0, rem = 0;
std::cin >> a >> b;
while (a > 0) {
hours += a;
int d = (a + rem) / b;
rem = (a + rem) % b;
a = d;
}
std::cout << hours << "\n";
}
|
#include <bits/stdc++.h>
int a, b;
int old;
int leftold;
int hours;
int main() {
scanf("%d %d", &a, &b);
hours = a;
old = a / b;
leftold = a;
while (!(old == 0 && leftold < b)) {
leftold %= b;
while (old > 0) {
hours += old;
leftold += old % b;
old /= b;
}
old = leftold / b;
}
printf("%d\n", hours);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int numb1, numb2;
scanf("%d%d", &numb1, &numb2);
int temp1, temp2;
int sum = 0;
for (int i = 1; i <= 100; i++) {
temp1 = numb1 / numb2;
temp2 = numb1 % numb2;
sum = sum + numb2 * temp1;
numb1 = temp1 + temp2;
}
printf("%d", sum + temp2);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, sum, aa;
while (~scanf("%d %d", &a, &b)) {
sum = 0;
aa = a;
while (a >= b) {
sum += a / b;
a = a % b + a / b;
}
printf("%d\n", aa + sum);
}
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
int ans = a;
while (a / b != 0) {
ans += a / b;
a = a / b + a % b;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
int temp;
temp = a;
while (a >= b) {
temp = temp + (a / b);
a = (a / b) + (a % b);
}
printf("%d\n", temp);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
int x, y, n, m, i, u, w, z, sum, best, j, k, t, ans;
int a[N], d[N];
int main() {
cin >> n >> x;
k = n;
while (n >= x) {
ans += n / x;
n = n / x + (n % x);
}
ans += k;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
bool f = false;
char ch = getchar();
x = 0;
while (ch < 48) f = (ch == '-'), ch = getchar();
while (47 < ch) x = (x << 3) + (x << 1) + ch - 48, ch = getchar();
if (f) x = -x;
}
int a, b, ans;
int main() {
read(a), read(b);
while (a) {
if (a >= b)
ans += a / b * b, a = a - a / b * b + a / b;
else
ans += a, a = 0;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m, sum;
while (scanf("%d%d", &n, &m) != EOF) {
sum = n;
while (n / m != 0) {
sum = sum + n / m;
n = n / m + n % m;
}
printf("%d\n", sum);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b;
c = a;
while (a >= b) {
long long d = a / b;
c += d;
long long k = a % b;
a = d + k;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, m, s;
cin >> a >> b;
c += a;
while (a >= b) {
s = a / b;
m = a % b;
c += s;
a = s + m;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int rem = 0;
int hrs = 0;
while (a > 0) {
hrs += a;
rem += a;
a = rem / b;
rem %= b;
}
cout << hrs << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, sum;
scanf("%d %d", &a, &b);
sum = a;
int r = 0;
int n = a;
while (n > 0) {
r = r + n % b;
n = n / b;
sum = sum + n;
}
while (r >= b) {
n = r;
r = 0;
while (n > 0) {
r = r + n % b;
n = n / b;
sum = sum + n;
}
}
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[100] = {0};
int main() {
long long int n, m, b = 0;
cin >> n >> m;
long long int ans = n;
while (n >= m) {
ans += n / m;
b = n % m;
n /= m;
n += b;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mem[20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long a, b, cnt = 0;
cin >> a >> b;
a *= b;
a--;
b--;
a /= b;
cout << a << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e;
scanf("%d %d", &a, &b);
c = a * b;
d = c - 1;
e = b - 1;
printf("%d\n", d / e);
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long a, b;
cin >> a >> b;
long long dem = 0, du = 0;
while (1) {
dem += a;
du += a % b;
a /= b;
if (du >= b) {
a += 1;
du -= b;
}
if (a == 0 && du < b) {
dem += a;
break;
}
}
cout << dem;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = a;
while (a >= b) {
cnt += a / b;
a = a / b + a % b;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a;
while (a >= b) {
sum += a / b;
a = a / b + a % b;
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
while (a >= b) {
ans = ans + (a / b) * b;
a = a % b + a / b;
}
cout << ans + a << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
printf("%d", ((a * b - 1) / (b - 1)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(const T &a) {
return a * a;
}
int a, b, x, ans;
int main() {
scanf("%d%d", &a, &b);
while (1) {
ans += a;
x += a;
if (x / b == 0) break;
a = x / b;
x -= (x / b) * b;
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
int sum = 0, c;
sum = a;
while (1) {
c = a / b;
a = c + (a % b);
sum += c;
if (a < b) break;
}
printf("%d\n", sum);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t = 0;
cin >> a >> b;
t += a;
while (a >= b) {
t += (a / b);
a = a / b + (a % b);
}
cout << t;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, s;
cin >> n >> m;
cout << n + (n - 1) / (m - 1);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long n, k, x, a, y;
scanf("%ld %ld", &n, &k);
a = n;
x = n;
while (x >= k) {
y = x % k;
x = x / k;
a = a + x;
x = x + y;
}
printf("%ld\n", a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, kq, i;
int main() {
cin >> a >> b;
while (a) {
a--;
kq++;
i++;
if (i == b) {
a++;
i = 0;
}
}
cout << kq;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, hours = 0, mod = 0, i = 0;
cin >> a >> b;
while (a) {
hours += a;
mod += (a % b);
a = a / b;
++i;
if (a == 0) {
a = (mod / b);
mod = mod % b;
}
}
cout << hours;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, fol, rem = 0;
cin >> a >> b;
fol = a;
while (a >= b) {
fol = fol + (a / b);
a = (a / b) + (a % b);
}
cout << fol << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, t = 0, r;
scanf("%d%d", &a, &b);
r = a;
while (a >= b) {
c = a / b;
r = r + c;
t = a % b;
c = c + t;
a = c;
}
printf("%d", r);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, k = 0;
cin >> a >> b;
while (a > 0) {
a--;
c++;
if (c == b) {
a++;
c = 0;
}
k++;
}
cout << k;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, day = 1;
cin >> n >> m;
while (true) {
if (n == 0) return cout << day - 1, 0;
n--;
if (day % m == 0) n++;
day++;
}
cout << day << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace ::std;
int main() {
int j = 1, n, m, o = 0;
cin >> n >> m;
cout << n + ((n - 1) / (m - 1));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int left = a;
while (left / b) {
a += left / b;
left = left - left / b * b + left / b;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int a, b;
cin >> a >> b;
int ans = 0, good = a, burnt = 0;
while (true) {
ans += good;
int p = burnt;
if (good + p < b) break;
burnt = (good + p) % b;
good = (good + p) / b;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
sum += a;
while (a > 0) {
sum += a / b;
a = a / b + a % b;
if (a < b) break;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int a = 0, b = 0;
cin >> a >> b;
int count = 0;
count += a;
while (a >= b) {
int temp = a / b;
int rim = a % b;
count += temp;
a = temp + rim;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, count = 0;
cin >> a >> b;
count = a;
while (a - b >= 0) {
int x = a / b;
count += x;
a = x + a % b;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, b, a, totc = 0;
cin >> c >> b;
a = c;
totc += c;
while (b <= a) {
totc += a / b;
a = (a / b) + (a % b);
}
cout << totc << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int kMaxN = 1000000;
int main() {
int a, b;
cin >> a >> b;
int rez = 0;
rez = a;
while (a >= b) {
int d = a / b;
rez += d;
a -= d * b;
a += d;
}
cout << rez << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b - 1) / (b - 1);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
int s, k;
while (~scanf("%d%d", &a, &b)) {
int sum = 0;
sum += a;
s = a;
while (s >= b) {
k = s % b;
s = s / b;
sum = sum + s;
s = s + k;
}
printf("%d\n", sum);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
int hours = a;
int surplus;
int t = 0;
while (a >= b) {
surplus = a % b;
a /= b;
hours += a;
a += surplus;
}
printf("%d", hours);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, s = 0, c;
cin >> a >> b;
s = a;
while (1) {
c = a / b;
a = c + (a % b);
s += c;
if (a < b) break;
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, div, mod;
scanf("%d%d", &a, &b);
int sum = a;
while (a >= b) {
div = (a / b);
sum = sum + div;
mod = (a % b);
a = (div + mod);
}
printf("%d\n", sum);
}
|
#include <bits/stdc++.h>
using namespace std;
int calc2(int r, int b) {
static int ans2 = 0;
static int r2 = 0;
if (r >= b) {
ans2 += r / b;
r2 += r % b;
calc2(r / b, b);
} else {
r2 += r;
ans2 += r2 / b;
}
return ans2;
}
int calc(int a, int b) {
static int ans = 0;
static int r = 0;
if (a >= b) {
ans += a / b;
r += a % b;
calc(a / b, b);
} else {
r += a;
if (r >= a) ans += calc2(r, b);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >> a >> b;
cout << calc(a, b) + a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
long long int ans = 0;
while (a > 0) {
a--;
ans++;
if (ans % b == 0) a++;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum, mod;
cin >> a >> b;
sum = a;
while (a >= b) {
int div = a / b;
sum = sum + div;
mod = a % b;
a = mod + div;
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
sum += a;
while ((a / b) > 0) {
if (a % b == 0) {
sum += a / b;
a /= b;
} else {
sum += a / b;
a = (a / b) + a % b;
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
int main() {
int a, b;
std::cin >> a >> b;
int hours = 0;
int used = 0;
while (a != 0) {
--a;
++used;
++hours;
if (used == b) {
++a;
used = 0;
}
}
std::cout << hours << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, m, s = 0;
scanf("%d %d", &a, &b);
s = a;
while (1) {
m = a / b;
a = m + (a % b);
s += m;
if (a < b) break;
}
printf("%d", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int res = n;
while (n >= m) {
res += (n / m);
n = (n / m) + (n % m);
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long a, b;
cin >> a >> b;
long long p, q;
long long count = a;
while (a >= b) {
p = a / b;
count += p;
q = a % b;
a = q + p;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
if (a >= b) {
ans = a;
while (a >= b) {
ans += (a / b);
a = (a / b) + a % b;
}
cout << ans << endl;
} else {
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int count = a;
int num_of_candles = a, went_out = 0;
while (went_out >= 0) {
went_out += num_of_candles;
if (went_out / b == 0) break;
num_of_candles = went_out / b;
went_out -= b * num_of_candles;
count += num_of_candles;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, s, k;
cin >> a >> b;
s = a;
while (1) {
c = a / b;
a = c + (a % b);
s += c;
if (a < b) break;
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int div = a / b;
int mod = a % b;
int ans = 0, temp = 0;
bool flag = false;
while (div + mod >= b) {
flag = true;
ans += div;
temp = mod;
mod = (div + mod) % b;
div = (div + temp) / b;
}
ans += div;
if (flag == true)
cout << ans + a;
else
cout << div + a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t1, t2, res;
cin >> a >> b;
res = a;
for (;;) {
t1 = a / b;
res = res + t1;
t2 = a % b;
if (t1 + t2 > 0) {
a = t1 + t2;
}
if (a / b == 0) {
break;
}
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s = 0;
while (n != 0) {
s++;
n--;
if (s % m == 0) n++;
}
cout << s;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
if (i % m == 0) n++;
}
printf("%d", n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int count = a;
int rest = 0;
while (a >= b) {
rest = a % b;
a = (a / b);
count += a;
a += rest;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
int add = 0;
for (int i = a; i > 0; i--) {
ans++;
add++;
if (add == b) {
i++;
add = 0;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = 0, x = a, r = 0;
while (x >= b) {
sum = sum + x / b;
x = x / b + x % b;
}
cout << sum + a;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c = 0, ans = 0;
scanf("%d%d", &a, &b);
while (a) {
ans += a;
c += (a % b);
a /= b;
if (a == 0 && c >= b) a = (c / b), c = c % b;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p, q, i, j, r, n;
cin >> a >> b;
p = a;
while (a >= b) {
q = a / b;
p += q;
r = a % b;
a = q + r;
}
cout << p << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, toth = 0, ca, cb;
cin >> a >> b;
toth += a;
ca = a;
cb = 0;
while (1) {
if (ca > 0) {
cb += ca;
ca = cb / b;
toth += ca;
cb = cb % b;
} else {
break;
}
}
cout << toth;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int start_up() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}
int static r = start_up();
int main() {
long long a, b;
cin >> a >> b;
long long sum = 0;
sum = a;
while (b <= a) {
long long c = a / b;
a = c + (a % b);
sum = sum + c;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, hrs = 0;
cin >> a >> b;
while (a > 0) {
if (a - b >= 0) {
hrs = b + hrs;
a = a - b;
a = a + 1;
} else {
hrs = hrs + a;
a = a - a;
}
}
cout << hrs;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, sum = 0;
scanf("%d%d", &a, &b);
sum += a;
while (a >= b) {
sum = sum + a / b;
c = a / b;
d = a % b;
a = c + d;
}
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int64_t a, b, result = 0, wasted = 0;
cin >> a >> b;
cout << a + ((a - 1) / (b - 1)) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0, m, r, k;
cin >> a >> b;
k = a;
while (a >= b) {
m = a / b;
r = a % b;
a = r + m;
sum = sum + m;
}
cout << k + sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0, nn = 0;
scanf("%d%d", &n, &m);
while (n) {
cnt++;
n--;
nn++;
n += nn / m;
nn %= m;
}
printf("%d\n", cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b, a, s, d, sum = 0;
cin >> n >> b;
s = n;
while (n >= b) {
sum = sum + n / b;
d = n % b;
a = n / b;
n = a + d;
}
cout << s + sum;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, a, b, x, y;
int main() {
cin >> a >> b;
while (a > 0) {
a--;
x++;
if (x % b == 0) a++;
}
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, ans;
int main() {
scanf("%d%d", &a, &b);
while (a) {
ans += a;
int t = a + c;
a = t / b;
c = t % b;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, w;
cin >> a >> b;
w = a;
while (w >= b) {
w = w - b + 1;
a++;
}
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
int i, q, r, sum, days = (n / m) * m;
for (i = 1; i <= 10000; i++) {
q = n / m;
r = n % m;
sum = q + r;
n = sum;
days = days + (sum / m) * m;
if (sum / m == 0) {
days = days + sum % m;
break;
}
}
printf("%d", days);
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b;
int sum;
int main() {
cin >> a >> b;
while (a >= b) {
sum += a / b * b;
a = a / b + a % b;
}
cout << sum + a;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.