Cod sursa(job #1155877)
Utilizator | Iordan Vlad Vladinho97 | Data | 27 martie 2014 11:29:16 |
---|---|---|---|
Problema | Farfurii | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
long long n,k,i;
scanf("%lld%lld",&n,&k);
i=n;
while(i>1)
{
if(i/2*(i-1)>=k)
{
if((i-1)/2*(i-2)>=k)
{
printf("%lld ",n-i+1);
}
else
{
k=i*(i-1)/2-k;
break;
}
}
i--;
}
int ult=n-i+1;
printf("%lld ",n-k);
for(i=n;i>=ult;i--)
{
if(i!=n-k)
printf("%d ",i);
}
return 0;
}