Cod sursa(job #1366109)
| Utilizator | Data | 28 februarie 2015 19:47:28 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <cstdio>
using namespace std;
int nr=0,n,i,j,x;
long long Max,k;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d %lld\n",&n,&k);
Max=1LL*n*(n-1)/2;
for(i=1;i<=n;++i)
{
nr+=n-i;
if(k<=Max-nr)
printf("%d ",i);
else
{
x=n-k+(Max-nr);
printf("%d ",x);
for(j=n;j>=i;--j)
if(j!=x)
printf("%d ",j);
break;
}
}
printf("\n");
return 0;
}
