ACdream - 1020 - The Game about KILL（找规律）

The Game about KILL

Time Limit: 2000/1000MS (Java/Others)  Memory Limit: 128000/64000KB (Java/Others)

Problem Description

Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.

Teacher HU and his 40 students will stand in a circle, and every second person would leave, and the last people in the circle would be killed.

For example, if there are 5 persons in the circle, counting proceeds as 2, 4, 1, 5 and person 3 will be killed.

To make his students alive, teacher HU calculated the position to be the last man standing, and sacrifice himself.

Now we consider a more common condition, if teacher HU has N - 1 students, which place should he stand to be the last person.

Input

There are multiple test cases.
Each test case only contains an integer  N. (1 ≤ N ≤ 1,000,000,000)

Output

For each test case, output an integer indicating which place should teacher HU stand.

Sample Input

2
3

Sample Output

1
3

Source

dut200901102

刚开始想了会除了暴力就完全没有思路了，然后就打表看看，规律就出来了

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define LL long long
LL n,b[50],base = 2;
int main()
{
	b[0] = 0;
	for(int i=1;i<=30;i++){
		b[i] = base - 1;
		base <<= 1;
	}
	while(scanf("%lld",&n)!=EOF){
		for(int i=0;i<=30;i++){
			if(b[i]>=n){
				LL m = n - b[i-1];
				printf("%lld\n",1+2*(m-1));
				break;
			}
		}
	}
	return 0;
}