#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 n,k,m;
cin>>n>>k>>m;
int x=m/(k*(2*n-1));
vi a(n,2*x*k);
a[n-1]=x*k;
m-=x*(k*(2*n-1));
while(m){
rep(i,n){
a[i]+=min(m,k);
m-=min(m,k);
}
per(i,n-1){
a[i]+=min(m,k);
m-=min(m,k);
}
}
rep(i,n){
cout<<a[i]<<" ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Correct |
15 ms |
2272 KB |
Output is correct |
| 4 |
Correct |
14 ms |
2256 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 7 |
Incorrect |
14 ms |
2900 KB |
Output isn't correct |
| 8 |
Incorrect |
16 ms |
2900 KB |
Output isn't correct |
