Hdu6130 Kolakoski（2017多校第7场）

Kolakoski

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

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\leq T\leq5)$, denoting the number of test cases.
For each test case:
A single line contains a positive integer $n(1\leq n\leq10^7)$.

 

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

————————————————————————————————————

题目的意思思给出一个序列，他的生成是每个数表示几个相同的连续一样的

思路：打表

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <complex>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <unordered_map>
#include <functional>

using namespace std;

int a[10000007];

int main()
{
    a[1]=1;
    a[2]=2;
    int cnt=2;
    for(int i=1; i<10000001;)
    {
        for(int j=0; j<a[cnt]; j++)
        {
            a[i+j+1]=a[i]^3;
        }
        i+=a[cnt];
        cnt++;
    }
    int T,x;
    for(scanf("%d",&T); T--;)
    {
        scanf("%d",&x);
        printf("%d\n",a[x]);
    }
    return 0;
}