Pagini recente » Cod sursa (job #1722605) | Cod sursa (job #446123) | Cod sursa (job #1076833) | Cod sursa (job #2593959) | Cod sursa (job #1017548)
#include <iostream>
#include <fstream>
using namespace std;
long long N, M, K;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f >> N >> K;
while ( M * ( M + 1 ) / 2 < K ) M++;
for ( int i = 1; i <= N - M - 1; ++i )
g << i << " ";
int x = M * ( M + 1 ) / 2 - K;
g << N - x << " ";
for ( int j = N; j >= N - M; --j )
if ( j != N - x )
g << j << " ";
f.close();
g.close();
return 0;
}