1, 10, 100, 1000...

原文地址：1, 10, 100, 1000... 作者：凌晨一度

Description

Let's consider an infinite sequence of digits constructed of ascending powers of 10 written one after another. Here is the beginning of the sequence: 110100100010000… You are to find out what digit is located at the definite position of the sequence.

Input

There is the only integer N in the first line (1 ≤ N ≤ 65535). The i-th of N left lines contains the integer K_i — the number of position in the sequence (1 ≤ K_i ≤ 2 ³¹ − 1) .

Output

You are to output N digits 0 or 1 separated with a space. More precisely, the i-th digit of output is to be equal to the K_i-th digit of described above sequence.

Sample Input

input	output
4 3 14 7 6	0 0 1 0

#include<stdio.h>
int  c[66000];
int a[67000];
int search(int x)//查找x是否在等于1的位置上；
{
 int low,high,mid;
 low=0;high=65536;
 while(low<=high)
 {
  mid=(low+high)/2;
  if(x==a[mid])return 1;//若在数组a中找到x，说明第x个位置上是1；
  else if(x<a[mid])
  high=mid-1;
  else low=mid+1;
 }
 return 0;否则是0；
}
int main()
{
 int n,i,j,k;
 int x;
 
 a[1]=1;j=1;k=2;
 for(i=1;i<=65537;i++)//把所有是1的位置存到数组a中；
 {a[k]=j+i;j=j+i;k++;
 
 }
 scanf("%d",&n);
 for(i=1;i<=n;i++)
 {
  scanf("%d",&x);
  
  c[i]=search(x);
 }
 for(i=1;i<=n-1;i++)//输出最后结果；
  printf("%d ",c[i]);
    printf("%dn",c[n]);
 return 0;
}