fork download 
  1. // 내 코드가 승인됐으면 좋겠어
  2. // 나는 나쁜 짓을 하고 있음을 엄숙히 맹세합니다.
  3. //배신하지 말고 기수가 되십시오
  4. #include<bits/stdc++.h>
  5. using namespace std;
  6. #include <ext/pb_ds/assoc_container.hpp> // Common file
  7. #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
  8. using namespace __gnu_pbds;
  9. template<typename T>
  10. using ordered_set=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
  11. #define ll long long
  12. #define MAX 10e5+6
  13. #define MAXX 10e11+6
  14. #define pb push_back
  15. #define  mp make_pair
  16. #define E cout<<"\n"
  17. #define all(x) x.begin(),x.end()
  18. #define rall(x) x.rbegin(),x.rend()
  19. #define bl  bool
  20. #define MOD 1000000007
  21. void fast() {
  22.     std:
  23.     ios_base::sync_with_stdio(0);
  24.     cin.tie(NULL);
  25. }
  26. ll power(ll x,ll y){
  27.     if(y==0)return 1;
  28.     ll temp =power(x,y/2)%MOD;
  29.     ll res=(temp*temp)%MOD;
  30.     if(y%2==1)res=(res*x)%MOD;
  31.     return res%MOD;
  32. }
  33. ll power1(ll x,ll y){
  34.     ll res=1;
  35.     while(y>0){
  36.         if(y%2==1)res=(res*x)%MOD;
  37.       x=(x*x)%MOD;
  38.       y/=2;
  39.     }
  40.     return res%MOD;
  41. }
  42. int main() {
  43.     fast();
  44.     ll t=1;
  45. //    cin>>t;
  46.     while(t--) {
  47. //MMD();
  48. ll x,y; cin>>x>>y;
  49. cout<<power1(x,y);
  50.  
  51.     }
  52.     return 0;
  53. }
Success #stdin #stdout 0.01s 5304KB
comments (?)
stdin 
Standard input is empty
stdout 
796775391
https://ideone.com/1XaKdE
language:
C++ (gcc 8.3)
created:
11 days 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!