Cod sursa(job #1334018)
Utilizator | Data | 3 februarie 2015 20:08:59 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
long long n,k,s,t,x,p;
int main()
{
int i,j;
cin>>n>>k;
for (i=1;;i++)
{
s+=i;
if (s>=k)
break;
}
t=s-k;
p=i;
for (i=1;i<n-p;i++)
cout<<i<<" ";
cout<<n-t<<" ";
for (i=1;i<=p+1;i++)
{
if ((n-i+1)==n-t)
continue;
cout<<n-i+1<<" ";
}
}