0_0_20613424_16919.cpp:5:5: error: expected unqualified-id before '>=' token
>= 1, tmp = (LL)tmp * tmp % MOD) if (d&1) ans = (LL)ans * tmp % MOD; return ans;}int cal(int l){ int ans = powmod(tot[1], l); for (int i = 2; i <= maxm; i++) { if (flag[i] == 0) continue; if (flag[i] & 1) ans = (ans - powmod(tot[i], l)) % MOD; else ans = (ans + powmod(tot[i], l)) % MOD; } return (ans % MOD + MOD) % MOD;}void solve(){ int ans = 0; for(int i = 1; i * i <= n; i ++) if(n % i == 0) { ans = (ans + (LL)cal(i) * phi[n / i]) % MOD; if(i * i != n) ans = (ans + (LL)cal(n / i) * phi[i]) % MOD; } printf("%d\n", (ans + MOD) % MOD / n);}int main(){ init(); scanf("%d", &cas); while (cas--) { scanf("%d%d", &m, &n); MOD = 10007 * n; memset(tot, 0, sizeof tot); maxm = 0; for (int i = 1; i <= m; i++) { scanf("%d", &tx); maxm = max(tx, maxm); for (int j = 0; j < facs[tx]; j++) tot[fac[tx][j]]++; } solve(); } return 0;}
^
0_0_20613424_16919.cpp:5:84: error: expected unqualified-id before 'return'
>= 1, tmp = (LL)tmp * tmp % MOD) if (d&1) ans = (LL)ans * tmp % MOD; return ans;}int cal(int l){ int ans = powmod(tot[1], l); for (int i = 2; i <= maxm; i++) { if (flag[i] == 0) continue; if (flag[i] & 1) ans = (ans - powmod(tot[i], l)) % MOD; else ans = (ans + powmod(tot[i], l)) % MOD; } return (ans % MOD + MOD) % MOD;}void solve(){ int ans = 0; for(int i = 1; i * i <= n; i ++) if(n % i == 0) { ans = (ans + (LL)cal(i) * phi[n / i]) % MOD; if(i * i != n) ans = (ans + (LL)cal(n / i) * phi[i]) % MOD; } printf("%d\n", (ans + MOD) % MOD / n);}int main(){ init(); scanf("%d", &cas); while (cas--) { scanf("%d%d", &m, &n); MOD = 10007 * n; memset(tot, 0, sizeof tot); maxm = 0; for (int i = 1; i <= m; i++) { scanf("%d", &tx); maxm = max(tx, maxm); for (int j = 0; j < facs[tx]; j++) tot[fac[tx][j]]++; } solve(); } return 0;}
^
0_0_20613424_16919.cpp:5:95: error: expected declaration before '}' token
>= 1, tmp = (LL)tmp * tmp % MOD) if (d&1) ans = (LL)ans * tmp % MOD; return ans;}int cal(int l){ int ans = powmod(tot[1], l); for (int i = 2; i <= maxm; i++) { if (flag[i] == 0) continue; if (flag[i] & 1) ans = (ans - powmod(tot[i], l)) % MOD; else ans = (ans + powmod(tot[i], l)) % MOD; } return (ans % MOD + MOD) % MOD;}void solve(){ int ans = 0; for(int i = 1; i * i <= n; i ++) if(n % i == 0) { ans = (ans + (LL)cal(i) * phi[n / i]) % MOD; if(i * i != n) ans = (ans + (LL)cal(n / i) * phi[i]) % MOD; } printf("%d\n", (ans + MOD) % MOD / n);}int main(){ init(); scanf("%d", &cas); while (cas--) { scanf("%d%d", &m, &n); MOD = 10007 * n; memset(tot, 0, sizeof tot); maxm = 0; for (int i = 1; i <= m; i++) { scanf("%d", &tx); maxm = max(tx, maxm); for (int j = 0; j < facs[tx]; j++) tot[fac[tx][j]]++; } solve(); } return 0;}
^
|
