Computer Transformation

Problem Description

A sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer simultaneously tranforms each digit 0 into the sequence 1 0 and each digit 1 into the sequence 0 1. So, after the first time step, the sequence 0 1 is obtained; after the second, the sequence 1 0 0 1, after the third, the sequence 0 1 1 0 1 0 0 1 and so on.

How many pairs of consequitive zeroes will appear in the sequence after n steps?

 

 

Input

Every input line contains one natural number n (0 < n ≤1000).

 

 

Output

For each input n print the number of consecutive zeroes pairs that will appear in the sequence after n steps.

 

 

Sample Input

  
  

   
   2
3
  
  

 

 

Sample Output

  
  

   
   1
1
  
  

 

 

Source

Southeastern Europe 2005

 

 

Recommend

JGShining

 

分析：此题主要考察两个内容：1、00个数的规律；2、大数相加的计算方式；

参考答案：

  /* num(i) = num(i-1) + num(i-2)*2; */ #include<iostream> #include <string> using namespace std; // v1乘2后将v2加到v1上, 相加结果即为v1 void calproc(char* v1, char* v2) { if (!v1 || !v2) return ; int l1 = strlen(v1), l2 = strlen(v2); int s = 0, val, wadd = 0; while (s <l1 || s < l2) { if (s < l1 && s < l2) { val = 2*(v1[s]-'0')+v2[s]-'0'+wadd; } else if (s < l1) { val = 2*(v1[s]-'0')+wadd; } else if (s < l2) { val = v2[s]-'0'+wadd; } v1[s] = val%10+'0'; wadd = val/10; ++s; } while (wadd > 0) { v1[s++] = wadd%10+'0'; wadd = wadd/10; } v1[s] = '/0'; } void swap(char*& p1, char*& p2) { char* p = p1; p1 = p2; p2 = p; } void revert(char* v) { if (!v) return ; int l = strlen(v), i; char tmp; for (i = 0; i < l/2; ++i) { tmp = v[i]; v[i] = v[l-i-1]; v[l-i-1] = tmp; } } int main(int argc, char* argv[]) { int n, i; char add1[10000]; char add2[10000]; char* v1, *v2; while (cin>>n) { if (n == 1) { cout<<"0"<<endl; continue; } else if (n == 2) { cout<<"1"<<endl; continue; } memset(add1, 0, sizeof(add1)); memset(add2, 0, sizeof(add2)); add1[0] = '0'; add2[0] = '1'; v1 = add1, v2 = add2; for (i = 3; i <= n; ) { calproc(v1, v2); if (++i <= n) swap(v1, v2); } revert(v1); cout <<v1<<endl; } return 0; }