Pagini recente » Cod sursa (job #332770) | Cod sursa (job #1107069) | Cod sursa (job #3335774) | Cod sursa (job #1637542) | Cod sursa (job #3314816)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k;
int main()
{
fin >> n >> k;
int pf;
for(int i = 1; i <= n; i++)
{
long long inv = 1LL * (n - i) * (n - i + 1) / 2;
if(inv < k)
{
pf = i - 1;
break;
}
else if(inv == k)
{
for(int j = 1; j < i; j++)
fout << j << " ";
for(int j = n; j >= i; j--)
fout << j << " ";
return 0;
}
}
for(int i = pf + 1; i <= n - 1; i++)
{
long long inv = 1LL * (n - pf - 1) * (n - pf) / 2 + (i - pf);
if(inv == k)
{
for(int j = 1; j < pf; j++)
fout << j << " ";
fout << i << " ";
for(int j = n; j > i; j--)
fout << j << " ";
for(int j = i - 1; j >= pf; j--)
fout << j << " ";
return 0;
}
}
return 0;
}