Pagini recente » Cod sursa (job #2392190) | Cod sursa (job #369461) | Cod sursa (job #1063814) | Cod sursa (job #2286528) | Cod sursa (job #2068092)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int v[100002];
int main()
{
int n,m,s=0;
fin>>n>>m;
int k=1;
while(s<m)
{
s+=k;
k++;
}
int ramas=s-m-k+1;
if(ramas<0)
ramas*=-1;
if(ramas)
{
int co=0;
for(int i=1;i<=n-k+1;i++)
{
v[++co]=i;
}
for(int i=n;i>n-k+1;i--)
{
v[++co]=i;
}
int k1=n-ramas+1;
k=n-k+1;
int aux=v[k];
v[k]=v[k1];
v[k1]=aux;
for(int i=1;i<k1;i++)
{
fout<<v[i]<<" ";
}
for(int i=k1+1;i<=n;i++)
{
fout<<v[i]<<" ";
}
fout<<v[k1];
}
else
{
for(int i=1;i<=n-k;i++)
{
fout<<i<<" ";
}
for(int i=n;i>=n-k+1;i--)
{
fout<<i<<" ";
}
}
return 0;
}