Pagini recente » Cod sursa (job #1007779) | Cod sursa (job #625259) | Cod sursa (job #1047239) | Cod sursa (job #48660) | Cod sursa (job #1829656)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int n, k, use[100005], v[100005];
int main()
{
int i, j, cnt, lft,act=0,maim=0;
f >> n >> k;
for (i = 1; i <= n; i++)
{
maim = 0;
for (j = 1; j <= n; j++)
{
if (!use[j])
{
lft = (n - i)*(n - i - 1) / 2;
if (lft + act + maim>= k)
{
v[i] = j;
use[j] = 1;
act += maim;
break;
}
else maim++;
}
}
}
for (i = 1; i <= n; i++)
{
g << v[i] << " ";
}
return 0;
}