Cod sursa(job #1660396)
| Utilizator | Data | 23 martie 2016 01:58:43 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <cstdio>
#define nmax 100005
using namespace std;
int n,m;
long long k;
int main()
{
int i,j;
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d %lld",&n,&k);
while (m*(m-1)/2<k)
m++;
k=m*(m-1)/2-k;
for (i=1;i<=n-m;i++)
printf("%d ",i);
if (m)
printf("%d ",n-k);
for (i=n;i>=n-k+1;i--)
printf("%d ",i);
for (i=n-k-1;i>n-m;i--)
printf("%d ",i);
return 0;
}
