fork(1) download
copy 
  1.  
  2. #include<cstdio>
  3. #include<iostream>
  4. #include<string>
  5. #include<cstdlib>
  6. #include<queue>
  7. #include<stack>
  8. #include<utility>
  9. #include<string>
  10. #include<cstring>
  11. #include<set>
  12. #include<cmath>
  13. #include<vector>
  14. #include<fstream>
  15. #include<map>
  16. #include<list>
  17. #include<algorithm>
  18. #define VI vector<int>
  19. #define VF vector<float>
  20. #define VD vector<double>
  21. #define VC vector<char>
  22. #define VVI vector<VI>
  23. #define VVF vector<VF>
  24. #define VVD vector<VD>
  25. #define VVC vector<VC>
  26. #define SI set<int>
  27. #define SF set<float>
  28. #define SD set<double>
  29. #define SC set<char>
  30. #define SSI set<SI>
  31. #define SSF set<SF>
  32. #define SSD set<SD>
  33. #define SSC set<SC>
  34. #define STI stack<int>
  35. #define STF stack<float>
  36. #define STD stack<double>
  37. #define STC stack<char>
  38. #define STSTI stack<STI>
  39. #define STSTF stack<STF>
  40. #define STSTD stack<STD>
  41. #define STSTC stack<STC>
  42. #define MOD 314159
  43. typedef long long int LLD;
  44. typedef unsigned long long int LLU;
  45. using namespace std;
  46. int even[1000001], odd[1000001];
  47. int main(){
  48. odd[1] = 1;
  49. even[1] = 9;
  50. for(int i=2;i<1000001;i++){
  51. odd[i] = (((9 * odd[i-1]) % MOD) + even[i-1]) % MOD;
  52. even[i] = (((9 * even[i-1]) % MOD) + odd[i-1]) % MOD;
  53. }
  54. int t, n;
  55. scanf("%d", &t);
  56. while(t--){
  57. scanf("%d", &n);
  58. printf("%d\n", even[n]);
  59. }
  60. return 0;
  61. }
Success #stdin #stdout 0.02s 11112KB
comments (?)
stdin
copy 
1
20000
stdout
copy 
254889
https://ideone.com/PREzxV
language:
C++ (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!