#include #include #include #include #include #include #include #define inf 999999999 #define mo 1000000007 #define LL long long using namespace std; LL num[100],judge[100]; int t,n; LL GCD(LL a, LL b) //递归 { if(a < b) swap(a, b); LL r = a % b; if(r == 0) return b; return GCD(b, r); } void EXT_GCD(LL a, LL b, LL &d, LL &x, LL &y) //a , b 任意 { if(!b) {d = a, x = 1, y = 0;} else {EXT_GCD(b, a % b, d, y, x), y -= x * (a / b);} } LL mega_mod() { LL a1, a2, r1, r2, d, c, x, y, x0,s; bool flag = true; a1=n;r1=num[1]%a1; for(int i = 1; i < n; i++) { a2=n-i;r2=num[i+1]%a2; // cout<0) printf("%I64d\n",ans); else printf("Creation August is a SB!\n"); } } /* 1 7 */