#include <bits/stdc++.h>
using namespace std;
using tint = long long;
using ld = long double;
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define trav(a, x) for(auto& a : x)
using vi = vector<int>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ins insert
#define esta(x,c) ((c).find(x) != (c).end())
using pi = pair<int,int>;
using pl = pair<tint,tint>;
#define f first
#define s second
#define mp make_pair
#define DBG(x) cerr << #x << " = " << x << endl;
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 2e5+5;
const tint INF = 1e18;
const int inf = 2e9;
const ld PI = acos(ld(-1));
const ld eps = 1e-8;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
template<class T> void remDup(vector<T> &v){
sort(all(v)); v.erase(unique(all(v)),end(v));
}
bool valid(int x, int y, int n, int m){
return (0<=x && x<n && 0<=y && y<m);
}
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
void NACHO(string name = "cbarn"){
ios_base::sync_with_stdio(0); cin.tie(0);
//freopen((name+".in").c_str(), "r", stdin);
//freopen((name+".out").c_str(), "w", stdout);
}
int modd(int a, int b){
if(a % b == 0) return b;
return a % b;
}
int main(){
NACHO();
int n, k, m; cin >> n >> k >> m;
int a = cdiv(m, k);
int voy;
bool ok = 0;
if(cdiv(a, n) % 2 == 1) voy = modd(a, n);
else{
voy = n-modd(a, n);
}
if(a <= n){
forn(i, voy-1){
cout << k << " ";
m -= k;
}
cout << m << " ";
forn(i, n-voy) cout << 0 << " ";
}else{
forn(i, voy-1) cout << k << " ";
cout << m-k*(n-1) << " ";
forn(i, n-voy) cout << k << " ";
}
}
Compilation message
timovi.cpp: In function 'int main()':
timovi.cpp:70:7: warning: unused variable 'ok' [-Wunused-variable]
70 | bool ok = 0;
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Correct |
17 ms |
748 KB |
Output is correct |
| 4 |
Correct |
17 ms |
748 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 7 |
Incorrect |
17 ms |
748 KB |
Output isn't correct |
| 8 |
Incorrect |
16 ms |
748 KB |
Output isn't correct |
