hdu6130Kolakoski（第七场打表）

Kolakoski

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 638    Accepted Submission(s): 314

Problem Description

This is Kolakosiki sequence:  1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1…… . This sequence consists of  1  and  2 , and its first term equals  1 . Besides, if you see adjacent and equal terms as one group, you will get  1,22,11,2,1,22,1,22,11,2,11,22,1…… . Count number of terms in every group, you will get the sequence itself. Now, the sequence can be uniquely determined. Please tell HazelFan its  n th element.

 

Input

The first line contains a positive integer  T(1≤T≤5) , denoting the number of test cases.
For each test case:
A single line contains a positive integer  n(1≤n≤107) .

 

Output

For each test case:
A single line contains a nonnegative integer, denoting the answer.

 

Sample Input

  
  

   
   2
1
2
  
  

 

Sample Output

  
  

   
   1
2
  
  

 

Source

2017 Multi-University Training Contest - Team 7

打表

/**
   by z_guibin
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
int a[10000007];
int main()
{

    int t;
    a[1]=1;
    a[2]=2;
    int cnt=2;
    for(int i=2;; i++)
    {
        if(a[i]==1)
        {
            if(1==a[cnt-1])
            {
                a[cnt]=2;
            }
            else
                a[cnt]=1;
            cnt+=1;
        }
        else
        {
            if(1==a[cnt-1])
            {
                a[cnt]=a[cnt+1]=2;
            }
            else
                a[cnt]=a[cnt+1]=1;
            cnt+=2;
        }
        if(cnt>10000007)
            break;
    }
    scanf("%d",&t);
    int n;
    while(t--)
    {
        scanf("%d",&n);
        cout<<a[n]<<endl;
    }
    return 0;
}