Task: | Bit string |
Sender: | toonewbie |
Submission time: | 2019-01-18 09:13:04 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | WRONG ANSWER | 0.02 s | 1 | details |
#3 | WRONG ANSWER | 0.01 s | 1 | details |
#4 | WRONG ANSWER | 0.02 s | 1 | details |
#5 | WRONG ANSWER | 0.02 s | 1 | details |
#6 | WRONG ANSWER | 0.02 s | 1 | details |
#7 | ACCEPTED | 0.03 s | 1 | details |
#8 | ACCEPTED | 0.02 s | 2 | details |
#9 | WRONG ANSWER | 0.01 s | 2 | details |
#10 | WRONG ANSWER | 0.02 s | 2 | details |
#11 | WRONG ANSWER | 0.02 s | 2 | details |
#12 | WRONG ANSWER | 0.01 s | 2 | details |
#13 | WRONG ANSWER | 0.03 s | 2 | details |
#14 | ACCEPTED | 0.01 s | 2 | details |
#15 | ACCEPTED | 0.02 s | 3 | details |
#16 | WRONG ANSWER | 0.03 s | 3 | details |
#17 | WRONG ANSWER | 0.02 s | 3 | details |
#18 | WRONG ANSWER | 0.03 s | 3 | details |
#19 | WRONG ANSWER | 0.02 s | 3 | details |
#20 | WRONG ANSWER | 0.02 s | 3 | details |
#21 | ACCEPTED | 0.02 s | 3 | details |
Compiler report
input/code.cpp: In function 'int is_prime(int)': input/code.cpp:50:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses] if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0)) ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Code
/****Author: Barish Namazov****/ #include <bits/stdc++.h> using namespace std; /***TEMPLATE***/ #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define F first #define S second #define pb push_back #define endl '\n' const int max4 = 10004; const int maxx = 100005; const int max6 = 1000006; const int lg5 = 17; const int INF = 2 * 1000000007; const long long INFLL = 4LL * 1000000000 * 1000000000; /***************/ int powmod (int a, int b, int mod) { int res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) { res = 1LL * res * a % mod; } a = 1LL * a * a % mod; } return res; } int gcd (int a, int b) { while (b > 0) { int t = a % b; a = b, b = t; } return a; } int lcm (int a, int b) { return (a / gcd (a, b)) * b; } int is_prime (int n) { if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0)) return 0; for (int i = 5, t = 2; i * i <= n; i += t, t = 6 - t) if (n % i == 0) return 0; return 1; } /******Don't forget to use long long when needed!!******/ int pref[5 * maxx]; int main() { //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); ios_base :: sync_with_stdio(0); cin.tie(0), cout.tie(0); string s; cin >> s; int n = s.size(); for (int i = 0; i < n; i++) { pref[i] = pref[i - 1] + 1; } int odd = 0, even = 1; long long res = 0; for (int i = 0; i < n; i++) { if (pref[i] & 1) { res += odd; odd++; } else { res += even; even++; } } cout << res << endl; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
111111111111111111111111111111... |
correct output |
---|
2500 |
user output |
---|
2500 |
Test 2
Group: 1
Verdict: WRONG ANSWER
input |
---|
111101111111101111111011011110... |
correct output |
---|
2502 |
user output |
---|
2500 |
Test 3
Group: 1
Verdict: WRONG ANSWER
input |
---|
000110011101101000000000101010... |
correct output |
---|
2590 |
user output |
---|
2500 |
Test 4
Group: 1
Verdict: WRONG ANSWER
input |
---|
110101000010001000101100011000... |
correct output |
---|
2502 |
user output |
---|
2500 |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
000000000000000000000000000000... |
correct output |
---|
5050 |
user output |
---|
2500 |
Test 6
Group: 1
Verdict: WRONG ANSWER
input |
---|
0 |
correct output |
---|
1 |
user output |
---|
0 |
Test 7
Group: 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
111111111111111111111111111111... |
correct output |
---|
6250000 |
user output |
---|
6250000 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
111111111110101111111010111011... |
correct output |
---|
6250342 |
user output |
---|
6250000 |
Test 10
Group: 2
Verdict: WRONG ANSWER
input |
---|
110110111000000001011100000011... |
correct output |
---|
6252352 |
user output |
---|
6250000 |
Test 11
Group: 2
Verdict: WRONG ANSWER
input |
---|
000000001000101001001110100011... |
correct output |
---|
6253422 |
user output |
---|
6250000 |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
000000000000000000000000000000... |
correct output |
---|
12502500 |
user output |
---|
6250000 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
0 |
correct output |
---|
1 |
user output |
---|
0 |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
111111111111111111111111111111... |
correct output |
---|
62500000000 |
user output |
---|
62500000000 |
Test 16
Group: 3
Verdict: WRONG ANSWER
input |
---|
101101100110111101111011111101... |
correct output |
---|
62500057360 |
user output |
---|
62500000000 |
Test 17
Group: 3
Verdict: WRONG ANSWER
input |
---|
011100000010000011110101010001... |
correct output |
---|
62500117306 |
user output |
---|
62500000000 |
Test 18
Group: 3
Verdict: WRONG ANSWER
input |
---|
001010011010000001100011001101... |
correct output |
---|
62500144780 |
user output |
---|
62500000000 |
Test 19
Group: 3
Verdict: WRONG ANSWER
input |
---|
000000000000000000000000000000... |
correct output |
---|
125000250000 |
user output |
---|
62500000000 |
Test 20
Group: 3
Verdict: WRONG ANSWER
input |
---|
0 |
correct output |
---|
1 |
user output |
---|
0 |
Test 21
Group: 3
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
0 |
user output |
---|
0 |