# Recently Oz has found a magical string consisting of single digit "1".After experimenting on the string, Oz found a weird

QUESTION :- Recently Oz has found a magical string consisting of single digit "1". After experimenting on the string, Oz found a weird
magical property of the string that is whenever he touches the string then each digit "1" of string changed to digit "0" and
each digit "0" of string changed to "01". Oz found this property interesting and immediately asked a question to RK :
"How many 1's and 0's will be in the magical string if he touches the string M times ?"

Input :
The first line contains the number of test cases T . Each test case consists of a positive integer - M .

Output :
For each test case output two space-separated integers, number of 1's and number of 0's in the magical string if Oz
touches the string M times.

Constraints :
1<= T <=20
1<= M <=90

2
1
2
0 1
1 1

Solution:-

#include<iostream>
using namespace std;
int main()
{
//Ghanendra
int t=0,m=1,n,i,j,t1;
int a1=1,a2=1;

cout<<"Enter the no of times Sample Input\n\n";
cin>>n;
cout<<t<<"  "<<m<<endl;
for(i=0;i<n;i++)
{
cout<<a1<<"  "<<a2<<endl;
t1=a1;
a1=a2;

a2=a2+t1;
}
}

Output:-