El martes, 16 de abril de 2019, 2:54:26 (UTC+2), [email protected]  escribió:
> Hello,
> I wrote a code that. When i tested it it did not work because of a runtime 
> error. But by removing a modulo M the code works well. I don't really 
> understand why. Does someone have an idea ?
> 
> ============================================================================
> #include <iostream>
> #include <vector>
> 
> using namespace std;
> 
> // compute GCD of a and b and Bézout coefficient are stored in u and v
> long long gcd(long long a, long long b, long long &u, long long &v) {
>       long long q = a / b;
>       long long r = a % b;
>       if (r == 0) {
>               u = 0;
>               v = 1;
>               return b;
>       }
>       long long s, t;
>       long long d = gcd(b, r, s, t);
>       u = t;
>       v = s - q * t;
>       return d;
> }
> 
> int main() {
>       int T, N, M;
>       cin >> T >> N >> M;
>       vector<int> primes = {3, 4, 5, 7, 11, 13, 17};
>       vector<long long> es;
>       long long n = 1;
>       for(int p : primes) n *= p;
>       for(int p : primes) {
>               long long u, v;
>               long long np = n / p;
>               gcd(np, p, u, v); // np*u + p*v = 1
>               // e = 1 [p]       e = 0 [q] (q another prime different from p)
>               long long e = np*u % n;
>               if(e < 0) e += n;
>               es.push_back(e);
>       }
> 
>       for(int t = 1; t <= T; t++) {
>               long long res = 0;
>               for(int k = 0; k < 7; k++) {
>                       int p = primes[k];
>                       long long  e = es[k];
>                       for(int i = 0; i < 18; i++)
>                               cout << p << " ";
>                       cout << "\n" << flush;
>                       long long mod = 0, j;
>                       for(int i = 0; i < 18; i++) {
>                               cin >> j;
>                               mod += j;
>                       }
>                       mod = mod % p;
>                       res = (res + mod*e) % n;
>               }
>               /********* ERROR HERE *********/
>               // This works
>               cout << res << "\n" << flush;
>               // This doesn't work ===> Runtime Error
>               //cout << res % M << "\n" << flush;
>               /*****************************/
>               int ans;
>               cin >> ans;
>               if(ans == -1) {
>                       cerr << "Bad answer !" << endl;
>                       return 1;
>               }
>       }
> 
>       return 0;
> }
> =============================================================================

If there ara exactly M gophers, after applying the modulo the answer will be 0, 
which is incorrect. We could expect the verdict to be "Wrong answer" but maybe 
it's RE because 0 is out of range.

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit 
https://groups.google.com/d/msgid/google-code/fd039382-a755-4e92-b511-2b9896a19f72%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Reply via email to