Pagini recente » Cod sursa (job #1979002) | Cod sursa (job #2569009) | Cod sursa (job #2479280) | Cod sursa (job #2415796) | Cod sursa (job #2020209)
#include <stdio.h>
long long int n , k , i ;
long long int p;
int main(){
freopen( "farfurii.in" , "r" , stdin );
freopen( "farfurii.out" , "w" , stdout );
scanf( "%lld %lld" , &n , &k );
p = 1;
while( p * ( p - 1 )/ 2 < k ){
p++;
}
for( i = 1 ; i <= n - p ; i++ ){
printf( "%lld " , i );
}
k = n + k - p * ( p - 1 )/ 2;
printf( "%lld " , k );
for( i = n ; i >= n - p + 1 ; i-- ){
if( i != k ){
printf( "%lld " , i );
}
}
return 0;
}