Advertisement
Guest User

Untitled

a guest
Nov 22nd, 2019
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.73 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6. const int n=1000009;
  7. int fib[n];
  8. long long tab[10000000];
  9.  
  10. int main()
  11. { ios_base::sync_with_stdio(0);
  12.  
  13. fib[0]=1;fib[1]=1;fib[2]=1;
  14. int a=1,b=2,c;
  15. while(a+b<n)
  16. {
  17. c=a+b;
  18. fib[c]=1;
  19. a=b;
  20. b=c;
  21. }
  22.  
  23. long long n,u,z=1,f=0,y,x,d,s=0,i;
  24. cin>>n;
  25. for(i=0; i<n; i++)
  26. {
  27. cin>>u;
  28.  
  29. if(fib[u]==1)
  30. {
  31. f=f+1;
  32. tab[z]=f;
  33. z=z+1;
  34. }
  35. else{tab[z]=f;z=z+1;}
  36. }
  37. cin>>z;
  38. for(int p=0; p<z; p++)
  39. {
  40. cin>>x;
  41. cin>>y;
  42.  
  43. cout<<tab[y]-tab[x-1]<<endl;
  44. }
  45.  
  46. return 0;
  47. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement