fork download
copy 
  1. #include<iostream>
  2.  
  3. #define mod 314159
  4. using namespace std;
  5. long long moduluss(long long base, long long exponent)
  6. {
  7.     long long result = 1;
  8.     while (exponent > 0)
  9.     {
  10.         if (exponent % 2 == 1)
  11.             result = (result * base) % mod;
  12.         exponent = exponent >> 1;
  13.         base = (base * base) % mod;
  14.     }
  15.     return result;
  16. }
  17.  
  18. int main()
  19.  
  20. {int t;
  21. int i;
  22. long long n;
  23. cin>>t;
  24. while(t--)
  25. {
  26. 	cin>>n;
  27.  
  28. cout<<((moduluss(10,n)+moduluss(8,n))%mod)/2<<endl;}
  29. //else
  30. return 0;}
Success #stdin #stdout 0s 3344KB
comments (?)
stdin
copy 
1
20000
stdout
copy 
97809
https://ideone.com/lvl35D
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!