Pagini recente » Cod sursa (job #2396750) | Cod sursa (job #261252) | Cod sursa (job #1382030) | Cod sursa (job #3290431) | Cod sursa (job #2086731)
#include <fstream>
#include <cmath>
using namespace std;
int n,m,i,k;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
f>>n>>k;
m=sqrt(k);
while((m*(m-1))/2<=k)
{
m++;
}
m--;
if((m*(m-1))/2==k)
{
for(i=1;i<=n-m;i++)
{
g<<i<<" ";
}
for(i=n;i>=n-m+1;i--)
{
g<<i<<" ";
}
}
else
{
for(i=1;i<=n-m-1;i++)
{
g<<i<<" ";
}
g<<n-((m+1)*m/2-k)<<" ";
for(i=n;i>=n-m;i--)
{
if(i!=n-((m+1)*m/2-k))g<<i<<" ";
}
}
return 0;
}