Pagini recente » Cod sursa (job #1139538) | Cod sursa (job #690529) | Cod sursa (job #1936083) | Cod sursa (job #1848538) | Cod sursa (job #2700900)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
set <int> v;
int main() {
ifstream fin( "farfurii.in" );
ofstream fout( "farfurii.out" );
int n, k, i, cnt;
fin >> n >> k;
for ( i = 1; i <= n; i ++ )
v.insert( i );
cnt = 0;
while ( !v.empty() ) {
cnt = ( v.size() - 2 ) * ( v.size() - 1 ) / 2;
if ( cnt < k ) {
auto it = v.begin();
advance( it, k - cnt );
k = cnt;
fout << (*it);
v.erase( it );
} else {
auto it = v.begin();
fout << (*it);
v.erase( it );
}
fout << ' ';
}
return 0;
}