AtCoder Grand Contest 001

B - Mysterious Light

题意：从一个正三角形边上一点出发，遇到边和已走过的边则反弹，问最终路径长度

思路：GCD

数据爆long long

 #pragma comment(linker, "/STACK:102c000000,102c000000")
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <sstream>
 #include <string>
 #include <algorithm>
 #include <list>
 #include <map>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <cmath>
 #include <cstdlib>
 // #include <conio.h>
 using namespace std;
 #define clc(a,b) memset(a,b,sizeof(a))
 #define inf 0x3f3f3f3f
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 const int N = *1e6+;
 const int MOD = 1e9+;
 #define LL long long
 #define mi() (l+r)>>1
 double const pi = acos(-);

 void fre() {
     freopen("in.txt","r",stdin);
 }

 // inline int r() {
 //     int x=0,f=1;char ch=getchar();
 //     while(ch>'9'||ch<'0') {if(ch=='-') f=-1;ch=getchar();}
 //     while(ch>='0'&&ch<='9') { x=x*10+ch-'0';ch=getchar();}return x*f;
 // }

 LL Gcd(LL a,LL b){ return b? Gcd(b, a % b) : a; }
 int main(){
     LL n,x; cin >> n >> x;
     LL d = Gcd(n,x);
     n/=d;
     unsigned long long ans=d**(n-);
     printf("%llu\n",ans);
 }