Pagini recente » Cod sursa (job #1329511) | Cod sursa (job #1797082) | Cod sursa (job #2412868) | Cod sursa (job #2350628) | Cod sursa (job #3133380)
#include <fstream>
int main() {
std::ifstream f("farfurii.in");
std::ofstream g("farfurii.out");
int n;
long long k;
f>>n>>k;
int m;
long long rr;
for (m = 0, rr = ((long long)m*(m+1))/2; rr < k; ++m, rr = ((long long)m*(m+1))/2);
for (int i = 1; i<n-m; ++i)
g<<i<<" ";
int x = n-(rr - k);
if (x > 0)
g<<x<<" ";
for (int i = n; i>=n-m && i>0; --i)
if (i != x)
g<<i<<" ";
g<<"\n";
return 0;
}