Submission #239060

#	Time	Username	Problem	Language	Result	Execution time	Memory
239060		VEGAnn	Kotrljanje (COCI18_kotrljanje)	C++14	28 / 140	493 ms	65540 KiB

kotrljanje

#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define i2 array<int,2>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 100100;
const ll OO = 1e18;
const int oo = 2e9;
const int md = int(1e9) + 7;
vector<ll> sms[N];
ll C, D, B, M;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> C >> D >> B >> M;

    for (ll i = 1; ; i++){
        ll cur = i * C + D;

        ll sum = 0;

        while (cur > 0){
            sum += cur % B;
            cur /= B;
        }

        sms[sum].PB(i);

        if (sz(sms[sum]) == M){
            for (ll x : sms[sum])
                cout << x << " ";
            return 0;
        }
    }

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14