Submission #650086

#TimeUsernameProblemLanguageResultExecution timeMemory
650086inksamuraiKotrljanje (COCI18_kotrljanje)C++17
28 / 140
436 ms65536 KiB
#include <bits/stdc++.h> #define int ll using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,c,n) for(int i=c;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e signed main(){ _3yqVz8E; int c,d,b,n; cin>>c>>d>>b>>n; auto logb_=[&](int n,int b){ int res=0; while(n){ n/=b; res+=1; } return res; }; auto digit_sum=[&](int n){ int res=0; while(n){ res+=(n%b); n/=b; } return res; }; vec(vi) ds(b*(logb_(1e15,b)+3)); for(int i=1;;i++){ int val=digit_sum(c*i+d); ds[val].pb(i); if(sz(ds[val])==n){ for(auto x:ds[val]){ cout<<x<<" "; } exit(0); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...