Pagini recente » Cod sursa (job #352365) | Cod sursa (job #2390454) | Cod sursa (job #2754374) | Cod sursa (job #521255) | Cod sursa (job #1012793)
#include <fstream>
using namespace std;
long long int N, K;
int main() {
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f >> N >> K;
for(int x = 1; x <= N; ++x) {
if((long long) x*(x - 1)/2 >= K) {
for(int i = 1; i <= N - x; ++i)
g << i << " ";
for(int i = N - x + 1; i <= N; ++i)
if(i - (N-x) - 1 + (long long) (x - 1)*(x - 2)/2 == K) {
g << i << " ";
for(int j = N; j >= N - x + 1; --j)
if(j != i)
g << j << " ";
g << "\n";
i = x = N;
}
}
}
f.close();
g.close();
return 0;
}