fork download
  1. /*
  2. AUTHOR : Chandan Agrawal
  3. College : Poornima College of Engg. jaipur, Raj
  4. Mail : chandanagrawal23@gmail.com
  5. */
  6.  
  7. #include<bits/stdc++.h>
  8. #include<stdio.h>
  9. using namespace std;
  10.  
  11. #define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  12. #define MAX 100050
  13.  
  14. #define ll long long
  15. #define ld long double
  16. #define lli long long int
  17.  
  18. #define pb emplace_back
  19. #define INF 1000000000
  20. #define mod 998244353
  21.  
  22. // trignometric function always give value in Radians only
  23. #define PI acos(-1) //3.1415926535897932384626433832795028
  24. #define dsin(degree) sin(degree*(PI/180.0))
  25. #define dcos(degree) cos(degree*(PI/180.0))
  26. #define dtan(degree) tan(degree*(PI/180.0))
  27.  
  28. #define rsin(radian) sin(radian)
  29. #define rcos(radian) cos(radian)
  30. #define rtan(radian) tan(radian)
  31.  
  32. #define loop(i,n) for (lli i = 0; i < n; i++)
  33. #define loopitr(xt,vec) for (auto xt : vec)
  34. #define FOR(i,a,b) for (lli i = a; i < b; i+=1)
  35. #define loop_rev(i,n) for (lli i = n-1; i >= 0; i--)
  36. #define FOR_REV(i,a,b) for (lli i = a; i >= b; i--)
  37. #define itr :: iterator it
  38. #define WL(t) while(t --)
  39.  
  40. #define all(v) v.begin(),v.end()
  41. #define sz(x) int(x.size())
  42. #define F first
  43. #define S second
  44.  
  45. #define mii map<lli,lli>
  46. #define vi vector<lli>
  47. #define seti set<lli>
  48. #define pii pair<lli,lli>
  49.  
  50. #define gcd(a,b) __gcd((a),(b))
  51. #define lcm(a,b) (a/gcd(a,b))*b
  52. #define abs(x) ((x < 0)?-(x):x)
  53.  
  54. template <typename T>
  55. void print(T x){cout<<x<<endl;}
  56. template <typename T1, typename T2>
  57. void print2(T1 x,T2 y){cout<<x<<" "<<y<<endl;}
  58. template <typename T1, typename T2,typename T3>
  59. void print3(T1 x, T2 y,T3 z){cout<<x<<" "<<y<<" "<<z<<endl;}
  60.  
  61. #define scanarr(a,n) for(lli i=0;i<n;i++) cin>>a[i];
  62. #define scanvector(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}
  63.  
  64. #define printarr(a,n) for(lli i=0;i<n;i++) cout<<a[i]<<" "; cout<<endl;
  65. #define printvector(vec) for(auto xt : vec) cout<<xt<<" "; cout<<"\n";
  66. #define printset(st) for(auto xt : st) cout<<xt<<" "; cout<<"\n";
  67.  
  68. #define FD(N) fixed<<setprecision(N)
  69.  
  70. #define endl '\n'
  71.  
  72. #define deb(x) cout<<#x<<" "<<x<<endl;
  73.  
  74. // chandan1,2
  75. void chandan1(){int y=1;return;}
  76. void chandan2(){
  77. loop(i,10){
  78. lli x=1;
  79. }
  80. return(chandan1());
  81. }
  82.  
  83.  
  84. lli find_mod(string s,lli pisano){
  85. lli i,x=0;
  86. for(i=0;i<s.length();i++)
  87. x=(x*10+s[i]-'0')%pisano;
  88. return x;
  89. }
  90.  
  91. int main(){
  92. fastio
  93. lli t=1;
  94. cin>>t;
  95. //chandan2();
  96. while(t--) {
  97. string n;
  98. cin>>n;
  99. if(n=="0"){
  100. print(n);
  101. continue;
  102. }
  103. lli pisano = 1996488708;
  104. lli val = find_mod(n,pisano);
  105. lli prev = 0;
  106. lli next = 1;
  107. if(val==0)
  108. print(0);
  109. if(val==1)
  110. print(1);
  111. else{
  112. loop(i,val-1){
  113. lli a = prev;
  114. prev = next ;
  115. next += a;
  116. next%=mod;
  117. }
  118. print(next%mod);
  119. }
  120.  
  121. }
  122. return 0;
  123. }
Success #stdin #stdout 2.03s 4360KB
stdin
3
0
1
419384601238473729475639183948326177846782649592628790267300203877
stdout
0
1
389871463