Pagini recente » Cod sursa (job #838609) | Cod sursa (job #2498054) | Cod sursa (job #30777) | Cod sursa (job #1478351) | Cod sursa (job #3267398)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream f("order.in");
ofstream g("order.out");
const int nMax=3e4+5;
ll n;
ll a[nMax] , rez[nMax] , aib[nMax];
void add(int x , int val)
{
for(int i=x;i<=n;i+=i&-i) aib[i]+=val;
}
ll sum(int x)
{
ll rez=0;
for(int i=x;i>=1;i-=i&-i) rez+=aib[i];
return rez;
}
ll cb(int x)
{
int st=1 , dr=n , rez=n;
while(st<=dr){
int mij=st+(dr-st)/2;
ll p=sum(mij);
if(p>=x) dr=mij-1 , rez=mij;
else if(p<x) st=mij+1;
}
return rez;
}
int main()
{
ios_base::sync_with_stdio(NULL);
f >> n;
for(int i=1;i<=n;i++) add(i , 1);
ll ramas=n , poz=2;
for(int i=1;i<=n;i++){
poz=(poz+i-1)%ramas;
if(poz==0) poz=ramas;
ll k=cb(poz);
g << k << " ";
add(k , -1);
ramas--;
}
}