Pagini recente » Cod sursa (job #1300994) | Cod sursa (job #403186) | Cod sursa (job #1959016) | Cod sursa (job #518438) | Cod sursa (job #3134229)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,a=1;
f>>n>>k;
if(k== 1 || k==3)
{
for(int i = 1; i <= n - a; i++)
g<<i<<" ";
for(int i = n; i >= n - a + 1; i--)
g<<i<< " ";
return 0;
}
if(k==2)
a = 3;
if(k==0)
{
for(int i = 0;i < n;i++)
{
g<<i<<" ";
}
return 0;
}
while((a * (a - 1) / 2) <k)
{
a++;
}
a--;
for(int i = 1;i <= n - a - 1;i++)
{
g<<i<<" ";
}
g<<n - (a * (a + 1) / 2) + k << " ";
for(int i = n;i>=n - a;i--)
{
if(i != (n - (a * (a + 1) / 2) + k))
g<<i<<" ";
}
f.close();
g.close();
return 0;
}