Pagini recente » Cod sursa (job #2482519) | Cod sursa (job #17819) | Cod sursa (job #1052269) | Cod sursa (job #2297979) | Cod sursa (job #2565131)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout ("farfurii.out");
long long n, k ;
void rezolva( )
{
long long i,j;
for( i = 1 ; i <= n ; i ++ )
if( ( n - i ) * ( n - i - 1) / 2 < k )
{
for( j = 1 ; j < i ; j ++ )
fout<< j << " ";
k = k - (n-i) * ( n - i + 1 ) / 2 ;
break ;
}
k = - k ;
fout << n - k << " " ;
for( j = n ; j > n - k ; j -- )
fout << j << " " ;
for( j = n - k - 1 ; j >= i ; j-- )
fout << j << " " ;
}
int main()
{ fin >> n >> k ;
rezolva();
return 0;
}