Cod sursa(job #2626332)
| Utilizator | Data | 6 iunie 2020 13:35:27 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, m, i, j, k, aux, poz;
int main()
{
f >> n >> m;
k = 1;
while((k * (k + 1) / 2) <= m)
k++;
aux = m - (k * (k - 1) / 2);
poz = n - k;
for(i = 1; i < poz; i++)
g << i << ' ';
g << poz + aux << ' ';
for(i = n; i > poz + aux; i--)
g<<i<<' ';
for(i = poz + aux; i > poz; i--)
g << i - 1 << ' ';
}