2017.8.15 杭电多校训练 Problem - 1010 Kolakoskit(杭电多校签到题)

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

分析：

这是一个名叫Kolakoski的序列（ https://baike.baidu.com/item/Kolakoski%E5%BA%8F%E5%88%97/16683856?fr=aladdin）

按照规律打表，直接输出即可。

[cpp] view plain copy

1. #include<bits/stdc++.h>  
2. using namespace std;  
3. int a[10000005];  
4. int f[5];  
5. int main()  
6. {  
7.     int t,sum=1,k=2,z=2,n;  
8.     cin>>t;  
9.     a[1]=1;a[2]=2;  
10.     for(long long i=3;i<=10000005;i++)  
11.     {  
12.         sum++;  
13.         a[i]=z;  
14.         if(sum==a[k])  
15.         {  
16.             sum=0;k++;  
17.             if(z==2) z=1;  
18.             else z=2;  
19.         }  
20.     }  
21.     while(t--)  
22.     {  
23.         cin>>n;  
24.         cout<<a[n]<<endl;  
25.     }  
26. }  

本文来自CSDN博客，转载出处： http://blog.csdn.net/Dingle_Captain/article/details/77187745