Poj 1781 In Danger (Joseph's ring, finding Rules)

Poj 1781 In Danger (Joseph's ring, finding Rules)

 

Joseph Ring template, each time count to 2 people out of the ring.

However, we can directly find that TLE and n are too large.

The answer is related to n. When n is the power of 2, the answer is 1. If n is not the power of 2, it is a multiple of 2 that is different from the power less than 2.

 

 

#include 
 
  #include 
  
   #include
   #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            
             #include #define LL long long#define _LL __int64#define eps 1e-12#define PI acos(-1.0)#define C 240#define S 20using namespace std;int p[30];int main(){for(int i = 0; i <= 27; i++){p[i] = 1<
             
              = n)break;if(p[i] == n)printf(1);elseprintf(%d,(n-p[i-1])*2+1); } return 0;}