HDU 6130-Kolakoski（Kolakoski序列）

address :http://acm.hdu.edu.cn/showproblem.php?pid=6130

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 nth 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

找规律 打表就好
code ：

#include <iostream>#include <bits/stdc++.h>using namespace std;int a[10000005];int main(){    int N;    a[1]=1;    a[2]=2;    int count1=2;    for (int i=2;;i++)    {        if (a[i]==1)        {            if (a[count1-1]==1)                a[count1]=2;            else                a[count1]=1;            count1+=1;        }        else        {            if (a[count1-1]==1)                a[count1] = a[count1+1] = 2;            else                a[count1] = a[count1+1] = 1;            count1+=2;        }        if (count1>10000004)            break;    }    scanf("%d",&N);    while (N--)    {        int x;        scanf("%d",&x);        printf("%d\n",a[x]);    }    return 0;}