Pagini recente » Cod sursa (job #2911942) | Cod sursa (job #2119563) | Cod sursa (job #350351) | Cod sursa (job #1814663) | Cod sursa (job #327969)
Cod sursa(job #327969)
#include <fstream>
#include <cmath>
using namespace std;
long long n, k, m;
int main() {
long long i, aux;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
in>>n>>k;
m=(long long)((double)1+sqrt(1+8*k))/2;
if (m*(m-1)/2==k) {
for (i=1; i<=n-m; ++i) out<<i<<' ';
for (i=n; i>=n-m+1; --i) out<<i<<' ';
out<<'\n';
}
else {
for (i=1; i<=n-m-1; ++i) out<<i<<' ';
aux=n-((m+1)*m/2-k);
out<<aux<<' ';
for (i=n; i>=n-m; --i)
if (i!=aux) out<<i<<' ';
out<<'\n';
}
return 0;
}