Pagini recente » Istoria paginii utilizator/cristianbudin | Cod sursa (job #828148) | Cod sursa (job #2990787) | Statistici Mihaly Anett (mihalyanett) | Cod sursa (job #1201843)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
#define MAX 100010
int n, dr, y, aux;
int a[MAX];
long long k, x;
void Write();
int main()
{
f >> n >> k;
x = (long long)sqrt( 2 * k );
if(x * (x + 1) / 2 <= k)
{
x++;
}
k -= (( x - 1 ) * x / 2);
for( int i = 1; i <= n - x - 1; i++)
{
a[i]=++dr;
}
y = n - x - 1;
for( int i = n; !a[i]; i--)
{
a[i] =++dr;
}
for( int i = n - k; i > y + 1; i--)
{
}
Write();
}
void Write()
{
for( int i = 1; i <= n; i++)
{
g << a[i] <<' ';
}
g<<'\n';
}