# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624481 | Do_you_copy | Kotrljanje (COCI18_kotrljanje) | C++17 | 414 ms | 15200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define taskname "test"
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());
ll min(const ll &a, const ll &b){
return (a < b) ? a : b;
}
ll max(const ll &a, const ll &b){
return (a > b) ? a : b;
}
//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 5001 + 1;
int n;
int c, d, b, m;
vector <ll> cnt[maxN];
inline ll sumdigit(ll u){
if (u < b) return u;
return sumdigit(u / b) + u % b;
}
void Init(){
cin >> c >> d >> b >> m;
int pivot;
for (int i = 0; ; ++i){
ll _ = i * (b - 1);
ll tem = c * _ + d;
ll sum = sumdigit(tem);
if (sum % (b - 1) != 0){
cout << i << " ";
assert(false);
}
if (i >= 1e8) cout << "TLE:",assert(0);
cnt[sum / (b - 1)].pb(tem);
if (cnt[sum / (b - 1)].size() == m){
pivot = sum / (b - 1);
break;
}
}
for (ll i: cnt[pivot]) cout << i << " ";
}
signed main(){
if (fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
//freopen(taskname".out", "w", stdout);
}
faster;
ll tt = 1;
//cin >> tt;
while (tt--){
Init();
}
if (fopen("timeout.txt", "r")){
ofstream testout("timeout.txt");
testout << double(clock()) / CLOCKS_PER_SEC;
cerr << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << "ms\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |