Pagini recente » Borderou de evaluare (job #2968249) | Borderou de evaluare (job #335794) | Borderou de evaluare (job #250974) | Borderou de evaluare (job #1353349) | Borderou de evaluare (job #2890519)
Borderou de evaluare (job #2890519)
Raport evaluator
Compilare:
main.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
main.cpp:20: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]
20 | 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];}};//mesanu
| ~~^~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 19ms | 7585kb | Okay! | 5 |
2 | 13ms | 8040kb | Okay! | 5 |
3 | 13ms | 7897kb | Okay! | 5 |
4 | 13ms | 7974kb | Okay! | 5 |
5 | 10ms | 6922kb | Okay! | 5 |
6 | 10ms | 6823kb | Okay! | 5 |
7 | 9ms | 7188kb | Okay! | 5 |
8 | 9ms | 8171kb | Okay! | 5 |
9 | 9ms | 7122kb | Okay! | 5 |
10 | 9ms | 6926kb | Okay! | 5 |
11 | 10ms | 7913kb | Okay! | 5 |
12 | 19ms | 8302kb | Okay! | 5 |
13 | 14ms | 8245kb | Okay! | 5 |
14 | 7ms | 7966kb | Okay! | 5 |
15 | 17ms | 8253kb | Okay! | 5 |
16 | 10ms | 7843kb | Okay! | 5 |
17 | 10ms | 7737kb | Okay! | 5 |
18 | 10ms | 7266kb | Okay! | 5 |
19 | 8ms | 6991kb | Okay! | 5 |
20 | 19ms | 7647kb | Okay! | 5 |
Punctaj total | 100 |