Pagini recente » pregatire_pt_oji | Istoria paginii runda/simulare_oji10_2009/clasament | Arhiva de probleme | Autentificare | Cod sursa (job #1369897)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,k;
int main()
{
fin>>n>>k;
int x,s=0,p,i;
for( i=1;;i++)
{
s+=i;
if(s>=k)break;
}
x=n-s+k;
p=i;
for(int i=1;i<n-p;i++)
fout<<i<<" ";
fout<<x<<" ";
for(int i=n;i>=n-p;i--)
{
if(i==x)continue;
fout<<i<<" ";
}
fin.close();
fout.close();
return 0;
}