Cod sursa(job #2902679)
Utilizator | Andrei-Daniel Tava widz | Data | 16 mai 2022 18:23:46 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
ifstream in("farfurii.in");
ofstream out("farfurii.out");
vector<int> nrs;
long long n,k,inv;
in >> n >> k;
in.close();
inv = (n-1) * (n - 2) / 2;
int i = 1;
while(inv > k)
{
inv -= n - i - 1;
out << i << " ";
++i;
}
int nr = k - inv + i;
out << nr << " ";
int j = n;
while(j>i-1)
{
if (j != nr)
out << j << " ";
--j;
}
out.close();
return 0;
}