제출 #1158260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158260		mnbvcxz123	Kotrljanje (COCI18_kotrljanje)	C++20	140 / 140	222 ms	16820 KiB

kotrljanje

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int constexpr DS = 32768;
vector<ll> vals[DS];
int B;

int ds(ll n) {
    int s = 0;
    while (n) s += n%B, n /= B;
    return s;
}

int main() {
    int C, D, M;
    cin >> C >> D >> B >> M;

    int mx_cnt = 0, mxi = -1;
    for (ll n = 1; mx_cnt < M; n += B-1) {
        int s = ds(C*n+D);
        vals[s].push_back(n);
        if (vals[s].size() > mx_cnt) {
            mx_cnt = vals[s].size();
            mxi = s;
        }
    }

    for (ll const n : vals[mxi]) {
        cout << n << ' ';
    }
    cout << '\n';
}

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