Pagini recente » Cod sursa (job #1666221) | Cod sursa (job #2139839) | Cod sursa (job #3248038) | Cod sursa (job #1549359) | Cod sursa (job #2914663)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream in ("farfurii.in");
ofstream out ("farfurii.out");
vector<int> domain;
int v[100000],n,k;
in >> n >> k;
for (int i = n; i > 0; i--)
{
int p = ((i-1) * (i-2))/2;
if ( p < k && p >= 0 )
{
v[n - i] = k - p;
k = p;
}
else
{
v[n - i] = 0;
}
domain.push_back(n - i + 1);
}
for (int i = 0; i < n; i++)
{
out << domain[v[i]] <<" ";
domain.erase(domain.begin()+v[i]);
}
in.close();
out.close();
return 0;
}