Pagini recente » Borderou de evaluare (job #3187432) | Cod sursa (job #72043) | Cod sursa (job #475862) | Borderou de evaluare (job #380398) | Cod sursa (job #3301897)
#include <fstream>
#include <vector>
#include <cassert>
#define ll long long
using namespace std;
const int NMAX = 1e5;
bool seen[NMAX + 1];
ll gauss(int val)
{
return 1LL * val * (val - 1) / 2;
}
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int n, i, j;
ll k;
cin >> n >> k;
for (i = 1; i <= n; i++)
{
int cate = 0;
for (j = 1; j <= n; j++)
if (!seen[j])
{
if (cate + gauss(n - i) >= k)
{
cout << j << " ";
seen[j] = 1;
k -= cate;
break;
}
cate++;
}
}
}