Cod sursa(job #2682914)
Utilizator | Zarzu Victor victorzarzu | Data | 9 decembrie 2020 21:48:16 |
---|---|---|---|
Problema | Farfurii | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int n, k, maxim, i, rez, init_n;
int main()
{
f>>n>>k, init_n = n, --n;
maxim = n * (n + 1) / 2;
for(i = 1;maxim - n >= k;++i)
g<<i<<" ", maxim -= n, --n;
g<<i + k - maxim + n<<" ";
for(int j = init_n;j >= i;--j)
if(j != i + k - maxim + n)
g<<j<<" ";
return 0;
}