Cod sursa(job #64566)
Utilizator | Casu-Pop Bogdan bogdanhm999 | Data | 4 iunie 2007 10:15:24 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <stdio.h>
int main(){
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
long long n,k,m,x,i;
scanf("%lld %lld",&n,&k);
m=1;
while ((m+1)*m<=2*k){
m++;
}
x=n-(m+1)*m/2+k;
//printf("%lld %lld\n",n,k);
//printf("%lld %lld",m,((m-1)*m)/2);
for (i=1;i<=n-m-(bool)x;i++)if (i!=x)printf("%lld ",i);
if(x)printf("%lld ",x);
for (i=n;i>=n-m+1-(bool)x;i--)if(i!=x)printf("%lld ",i);
return 0;
}