Borderou de evaluare (job #1987478)

Utilizator giotoPopescu Ioan gioto Data 30 mai 2017 20:51:10
Problema Ackermann Status done
Runda Arhiva ICPC Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int rec(int, int)’: user.cpp:2:112: warning: unused variable ‘d’ [-Wunused-variable] using namespace std;int t, a, b, p;inline int rec(int b,int p){if(p <= 1) return 0;if(b == 1) return a % p;int d = 3, phi = p, aux = p;for(int i = 2;i * i <= p ;++i) if(p % i == 0){while(p % i == 0) p = p / i; phi = phi / i * (i - 1);}if(p != 1) phi = phi / p * (p - 1);int exp = rec(b - 1, phi);int put = 1; p = aux; aux = a % p;for(int i = 0; (1 << i) <= exp ; ++i){if((1 << i) & exp) put = (1LL * put * aux) % p;aux = (1LL * aux * aux) % p;}return put;}int main(){freopen("ackermann.in", "r", stdin);freopen("ackermann.out", "w", stdout);scanf("%d", &t);while(t--)scanf("%d%d%d", &a, &b, &p),printf("%d\n", rec(b, p));return 0;} ^ user.cpp: In function ‘int main()’: user.cpp:2:503: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int t, a, b, p;inline int rec(int b,int p){if(p <= 1) return 0;if(b == 1) return a % p;int d = 3, phi = p, aux = p;for(int i = 2;i * i <= p ;++i) if(p % i == 0){while(p % i == 0) p = p / i; phi = phi / i * (i - 1);}if(p != 1) phi = phi / p * (p - 1);int exp = rec(b - 1, phi);int put = 1; p = aux; aux = a % p;for(int i = 0; (1 << i) <= exp ; ++i){if((1 << i) & exp) put = (1LL * put * aux) % p;aux = (1LL * aux * aux) % p;}return put;}int main(){freopen("ackermann.in", "r", stdin);freopen("ackermann.out", "w", stdout);scanf("%d", &t);while(t--)scanf("%d%d%d", &a, &b, &p),printf("%d\n", rec(b, p));return 0;} ^ user.cpp:2:541: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int t, a, b, p;inline int rec(int b,int p){if(p <= 1) return 0;if(b == 1) return a % p;int d = 3, phi = p, aux = p;for(int i = 2;i * i <= p ;++i) if(p % i == 0){while(p % i == 0) p = p / i; phi = phi / i * (i - 1);}if(p != 1) phi = phi / p * (p - 1);int exp = rec(b - 1, phi);int put = 1; p = aux; aux = a % p;for(int i = 0; (1 << i) <= exp ; ++i){if((1 << i) & exp) put = (1LL * put * aux) % p;aux = (1LL * aux * aux) % p;}return put;}int main(){freopen("ackermann.in", "r", stdin);freopen("ackermann.out", "w", stdout);scanf("%d", &t);while(t--)scanf("%d%d%d", &a, &b, &p),printf("%d\n", rec(b, p));return 0;} ^ user.cpp:2:557: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int t, a, b, p;inline int rec(int b,int p){if(p <= 1) return 0;if(b == 1) return a % p;int d = 3, phi = p, aux = p;for(int i = 2;i * i <= p ;++i) if(p % i == 0){while(p % i == 0) p = p / i; phi = phi / i * (i - 1);}if(p != 1) phi = phi / p * (p - 1);int exp = rec(b - 1, phi);int put = 1; p = aux; aux = a % p;for(int i = 0; (1 << i) <= exp ; ++i){if((1 << i) & exp) put = (1LL * put * aux) % p;aux = (1LL * aux * aux) % p;}return put;}int main(){freopen("ackermann.in", "r", stdin);freopen("ackermann.out", "w", stdout);scanf("%d", &t);while(t--)scanf("%d%d%d", &a, &b, &p),printf("%d\n", rec(b, p));return 0;} ^ user.cpp:2:621: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int t, a, b, p;inline int rec(int b,int p){if(p <= 1) return 0;if(b == 1) return a % p;int d = 3, phi = p, aux = p;for(int i = 2;i * i <= p ;++i) if(p % i == 0){while(p % i == 0) p = p / i; phi = phi / i * (i - 1);}if(p != 1) phi = phi / p * (p - 1);int exp = rec(b - 1, phi);int put = 1; p = aux; aux = a % p;for(int i = 0; (1 << i) <= exp ; ++i){if((1 << i) & exp) put = (1LL * put * aux) % p;aux = (1LL * aux * aux) % p;}return put;}int main(){freopen("ackermann.in", "r", stdin);freopen("ackermann.out", "w", stdout);scanf("%d", &t);while(t--)scanf("%d%d%d", &a, &b, &p),printf("%d\n", rec(b, p));return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
120ms268kbOK100
Punctaj total100

Ceva nu functioneaza?