Cod sursa(job #2206166)
Utilizator | Data | 21 mai 2018 15:57:02 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,m,i;
long long t,k;
fin>>n>>k;
m=1;
while((m*(m-1))/2<k)
m++;
t=(m*(m-1))/2-k;
for (i=1;i<=n-m;++i)
fout<<i<<" ";
if(t>0)
fout<<n-t<<" ";
for(i=n;i>=n-m+1;--i)
{
if (i!=n-t)
fout<<i<<" ";
else
if(t==0)
fout<<i<<" ";
}
return 0;
}