Cod sursa(job #998002)
| Utilizator | Data | 15 septembrie 2013 14:26:13 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
long long N, K, M = 1, MM;
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
cin >> N >> K;
while(M * (M + 1) < 2 * K) M ++;
for(int i = 1; i <= N - M - 1; ++ i) cout << i << " ";
MM = M * (M + 1) / 2 - K;
cout << N - MM << " ";
for(int j = N; j >= N - M; -- j)
if(j != N - MM)
cout << j << " ";
return 0;
}
