#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define sz size()
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
fast
ll n,k,m;cin>>n>>k>>m;
ll x=m/(k*n);
vector<int>ans(n);
if(x%2==0){
for(int i=0;i<n;i++){
ans[i]=k*x;
}
ll y=m-k*n*x;
for(int i=(ans[0]>0);i<n;i++){
if(y){
if(y>=k){
y-=k;
ans[i]+=k;
}
else{
ans[i]+=y;
y=0;
}
}
}
}
else{
ll p=0;
for(int i=0;i<n;i++){
ans[i]=k*(x-1);
p+=k*(x-1);
}
for(int i=(ans[0]>0);i<n;i++){
ans[i]+=k;
p+=k;
}
ll y=m-p;
for(int i=n-2;i>=0;i--){
if(y){
if(y>=k){
y-=k;
ans[i]+=k;
}
else{
ans[i]+=y;
y=0;
}
}
}
}
for(auto i:ans){
cout<<i<<" ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Correct |
15 ms |
1500 KB |
Output is correct |
| 4 |
Correct |
16 ms |
1500 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 7 |
Incorrect |
17 ms |
2072 KB |
Output isn't correct |
| 8 |
Incorrect |
17 ms |
2132 KB |
Output isn't correct |
