Pagini recente » Cod sursa (job #1178642) | Cod sursa (job #1054177) | Cod sursa (job #1905521) | Cod sursa (job #44927) | Cod sursa (job #767987)
Cod sursa(job #767987)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
int n,k,i,m;
in>>n>>k;
for(m=1;m<=n;++m)
if(m*(m-1)/2>k)
break;
m--;
if(m*(m-1)/2==k)
{
for(i=1;i<=n-m;++i)
out<<i<<" ";
for(i=n;i>n-m;--i)
out<<i<<" ";
return 0;
}
for(i=1;i<n-m;++i)
out<<i<<" ";
out<<n-((m+1)*m/2-k)<<" ";
for(i=n;i>n-m;--i)
{
if(i!=n-((m+1)*m/2-k))
out<<i<<" ";
}
out<<n-m<<"\n";
return 0;
}