Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <algorithm>
- using namespace std;
- const int n=1000009;
- int fib[n];
- long long tab[10000000];
- int main()
- { ios_base::sync_with_stdio(0);
- fib[0]=1;fib[1]=1;fib[2]=1;
- int a=1,b=2,c;
- while(a+b<n)
- {
- c=a+b;
- fib[c]=1;
- a=b;
- b=c;
- }
- long long n,u,z=1,f=0,y,x,d,s=0,i;
- cin>>n;
- for(i=0; i<n; i++)
- {
- cin>>u;
- if(fib[u]==1)
- {
- f=f+1;
- tab[z]=f;
- z=z+1;
- }
- else{tab[z]=f;z=z+1;}
- }
- cin>>z;
- for(int p=0; p<z; p++)
- {
- cin>>x;
- cin>>y;
- cout<<tab[y]-tab[x-1]<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement