很好,这题不错~
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a) for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a) scanf(in64,&a)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define SZ(a) ((int)a.size())
#define PP(n,m,a) puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
i64 gcd(i64 _a, i64 _b)
{
if (!_a || !_b)
{
return max(_a, _b);
}
i64 _t;
while (_t = _a % _b)
{
_a = _b;
_b = _t;
}
return _b;
};
i64 ext_gcd (i64 _a, i64 _b, i64 &_x, i64 &_y)
{
if (!_b)
{
_x = 1;
_y = 0;
return _a;
}
i64 _d = ext_gcd (_b, _a % _b, _x, _y);
i64 _t = _x;
_x = _y;
_y = _t - _a / _b * _y;
return _d;
}
i64 invmod (i64 _a, i64 _p)
{
i64 _ans, _y;
ext_gcd (_a, _p, _ans, _y);
_ans < 0 ? _ans += _p : 0;
return _ans;
}
const int maxn = 1011;
vector<int>v;
void find(int n,int k)
{
/* cout<<n<<" | "<<k<<endl;
for(int i=0;i<v.size();i++)
{
cout<<v[i]<<" ";
}
cout<<endl; */
if(n==1)
{
v.clear();
v.pb(k);
return ;
}
else if(k==1)
{
v.clear();
for(int i=1;i<=n-1;i++)
{
v.pb(0);
}
v.pb(1);
}
else if(n>k)
{
int temp = n%k;
int t2 = n/k;
find(temp,k);
vector<int>x;
x.clear();
for(int i=0;i<v.size();i++)
{
x.pb(0);
for(int u=1;u<=v[i];u++)
{
for(int e=1;e<=t2-1;e++)
{
x.pb(0);
}
x.pb(1);
}
}
v = x;
return ;
}
else if(k>n)
{
int temp = k%n;
int t2 = k/n;
find(n,temp);
for(int i=0;i<v.size();i++)
{
v[i] += t2;
}
return ;
}
else
{
assert(false);
}
}
int n,k;
int main()
{
cin>>n>>k;
find(n,k);
for(int i=0;i<v.size()-1;i++)
{
cout<<v[i]<<" ";
}
cout<<v.back()<<endl;
return 0;
}