Pagini recente » Cod sursa (job #2213956) | Cod sursa (job #1448683) | Cod sursa (job #734040) | Cod sursa (job #973269) | Cod sursa (job #1073197)
#include <fstream>
using namespace std;
void read( int &x, int &y ){
ifstream cin( "farfurii.in" );
cin >> x >> y;
cin.close();
}
void solve( int N, int K ){
ofstream cout( "farfurii.out" );
for( int i = 1; i <= N && K; ++i ){
long long inv = 1LL * ( N - i ) * ( N - i - 1 ) >> 1;
if( inv >= K ){
cout << i << " ";
if( inv == K ){
for( int j = N; j > i; --j )
cout << j << " ";
K = 0;
}
}
else {
cout << i + K - inv << " ";
for( int j = N; j >= i; --j )
if( j != i + K - inv ) cout << j << " ";
K = 0;
}
}
cout.close();
}
int main(){
int N, K;
read( N, K );
solve( N, K );
return 0;
}