Cod sursa(job #327950)
| Utilizator | Data | 30 iunie 2009 16:45:45 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<cstdio>
const int N=100001;
long long n,k;
bool marc[N];
void calcul()
{
long long i,j;
for(i=1;i<=n;++i)
if((n-i)*(n-i-1)/2 >= k)
{
printf("%lld ",i);
marc[i]=true;
}
else
{
j=i+k-(n-i)*(n-i-1)/2;
printf("%lld ",j);
marc[j]=true;
break;
}
for(i=n;i>=1;--i)
if(!marc[i])
printf("%lld ",i);
}
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%lld%lld",&n,&k);
calcul();
return 0;
}
