Pagini recente » Cod sursa (job #1233789) | Cod sursa (job #2358377) | Cod sursa (job #931126) | Cod sursa (job #2636939) | Cod sursa (job #2423910)
#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;
}