Cod sursa(job #1066929)
Utilizator | Data | 25 decembrie 2013 20:41:51 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.35 kb |
#include<cstdio>
using namespace std;
int N,i,C,D;
long long K;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d%lld",&N,&K);
for(i=1;1LL*i*(i-1)/2<K;i++); C=i; D=1LL*i*(i-1)/2-K;
for(i=1;i<=N-C;i++) printf("%d ",i);
printf("%d ",N-D);
for(i=N;i>N-C;i--) if(i!=N-D) printf("%d ",i);
return 0;
}