Pagini recente » Cod sursa (job #3331387) | Cod sursa (job #3331379) | Cod sursa (job #3338381) | Cod sursa (job #3334763) | Cod sursa (job #3331383)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("farfurii.in") ;
ofstream fout ("farfurii.out") ;
long long n , k ;
int main()
{
fin >> n >> k ;
long long m = 0 ;
while ( ( m + 1 ) * m / 2 <= k )
m ++ ;
long long im = m * ( m - 1 ) / 2 ;
if ( im == k )
{
for ( long long i = 1 ; i <= n - m ; i ++ )
fout << i << " " ;
for ( long long i = n ; i >= n - m + 1 ; i -- )
fout << i << " " ;
}
else
{
long long d = m * ( m + 1 ) / 2 - k ;
long long D = n - m + d ;
for ( long long i = 1 ; i <= n - m - 1 ; i ++ )
fout << i << " " ;
fout << D << " " ;
for ( long long i = n ; i >= n - m ; i -- )
if ( i != D )
fout << i << " " ;
}
return 0;
}