Pagini recente » Cod sursa (job #2524688) | Cod sursa (job #3195350) | Cod sursa (job #1389521) | Cod sursa (job #1019460) | Cod sursa (job #1190657)
#include <fstream>
#include<iostream>
using namespace std;
long long n,i,k,j,p,q;
void Citire()
{
ifstream fin("farfurii.in");
fin>>n>>k;
fin.close();
}
void Rezolvare()
{
ofstream fout("farfurii.out");
while(i*(i+1)/2 < k) i++;
p= i*(i+1)/2-k;
cout<<p;
for(j=1;j<=n-i-1;j++) fout<<j<<" ";
q=n-p;
fout<<q<<" ";
for(j=n;j>=n-i;j--)
if(j!=n-p) fout<<j<<" ";
fout<<"\n";
fout.close();
}
int main()
{
Citire();
Rezolvare();
return 0;
}