Cod sursa(job #1700325)
Utilizator | Gabi Tulba-Lecu GabiTulba | Data | 10 mai 2016 00:35:34 |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <cstdio>
unsigned long long K,N,v[1000001]={},aux[1000001]={};
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d%d",&N,&K);
for(unsigned long long i=1;i<=N;i++)
v[i]=i;
unsigned long long i=1;
while(i<N&&K>0)
{
if((N-i)*(N-i-1)/2<K)
{
aux[0]++;
aux[aux[0]]=v[i];
v[i]=0;
K-=N-i;
}
i++;
}
for(unsigned long long i=1;i<=N;i++)
if(v[i]==i)
printf("%d ",v[i]);
for(unsigned long long i=aux[0];i>0;i--)
printf("%d ",aux[i]);
return 0;
}