| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 361671 | israeladewuyi | Nadan (COCI18_nadan) | C++17 | 1 ms | 512 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<int,int>> vp;
#define int ll
#define PB push_back
#define pb pop_back
#define in insert 
#define endl "\n"
#define MP make_pair
#define f first
#define Trav(a,x) for(auto &a: x)
#define	sort(x) sort(x.begin(),x.end());
const int MOD  = 998244353;
const int maxn = 1e5+1;
int a,b,c,d,k,n,m,x,s,y,ans;
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin>>k>>n;
	vi A(n);
	if(k % n == 0) 
		for(int i = 0; i < n; i++){
			A[i] = k/n;
		}
	b = 0;
	for(int  i = 0; i < n; i++){
		if(i == n-1)A[i]+=b;
		else{
			A[i]-=(i+1);
			b+=i+1;
		}
		
	}
	Trav(a,A)cout<<a<<endl;
	return 0;
}
 
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
