Borderou de evaluare (job #2871467)

Utilizator ssenseEsanu Mihai ssense Data 14 martie 2022 19:54:58
Problema Factorial Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 30

Raport evaluator

Compilare: main.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)': main.cpp:21:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//ssense | ~~^~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbCorect!5
22ms184kbCorect!5
32ms184kbRaspuns incorect0
42ms184kbCorect!5
5150ms200kbTime limit exceeded0
6151ms200kbTime limit exceeded0
720ms278kbCorect!5
845ms200kbCorect!5
9151ms200kbTime limit exceeded0
10151ms200kbTime limit exceeded0
11141ms249kbCorect!5
12151ms200kbTime limit exceeded0
13151ms200kbTime limit exceeded0
14151ms200kbTime limit exceeded0
1574ms200kbRaspuns incorect0
16151ms249kbTime limit exceeded0
17151ms200kbTime limit exceeded0
18151ms200kbTime limit exceeded0
19151ms200kbTime limit exceeded0
20151ms200kbTime limit exceeded0
Punctaj total30

Ceva nu functioneaza?