Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define MOD 123457
- using namespace std;
- int powlog(int a,int b)
- {
- if(b==0)
- return 1;
- int x=powlog(a,b/2);
- if(b%2==0)
- return (1ULL*x*x)%MOD;
- return (((1ULL*x*x)%MOD)*a)%MOD;
- }
- void euclid(int a,int b,int &x,int &y)
- {
- if(b==0)
- x=1,y=1;
- else
- {
- int x1,y1;
- euclid(b,a%b,x1,y1);
- x=y1;
- y=x1-a/b*y1;
- }
- }
- int main()
- {
- int n,x,y;
- cin>>n;
- euclid(2,MOD,x,y);
- cout<<((4ULL*powlog(3,n-1))%MOD*x)%MOD;
- return 0;
- }
Add Comment
Please, Sign In to add comment