Cod sursa(job #2517391)
Utilizator | Data | 3 ianuarie 2020 14:48:21 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define Nmax 100005
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, m;
int main()
{
f >> n >> m;
long long nr=1;
while(nr*(nr+1)/2 <= m) nr++;
for (int i = 1; i <= n-nr-1; i++)
g << i << " ";
g << n+m-nr*(nr+1)/2 << " ";
for (int i = n; i >= n-nr; i--)
if (i != n+m-nr*(nr+1)/2) g << i << " ";
return 0;
}