CSES - Datatähti 2019 loppu - Results
Submission details
Task:Bittijono
Sender:Dan Näsman
Submission time:2019-01-17 13:45:04 +0200
Language:C++
Status:READY
Result:48
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED27
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.02 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.03 s1details
#7ACCEPTED0.02 s1details
#8ACCEPTED0.05 s2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.09 s2details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.01 s2details
#15--3details
#16--3details
#17--3details
#18--3details
#19--3details
#20ACCEPTED0.01 s3details
#21ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:19:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.length(); i++) {
                 ~~^~~~~~~~~~~~
input/code.cpp:22:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j < s.length()) {
         ~~^~~~~~~~~~~~

Code

//============================================================================
// Name        : Tehtava1.cpp
// Author      : Dan
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;

int c = 0;
string s;

int main() {
	cin >> s;
	for(int i = 0; i < s.length(); i++)	{
		int k = 0;
		int j = i;
		while(j < s.length())	{
			string y = "1";
			if(s[j] == y[0])	{
				k++;
			}
			if(k % 2 == 0)	{
				c++;
			}
			j++;
		}
	}
	cout << c;

	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
111111111111111111111111111111...

correct output
2500

user output
2500

Test 2

Group: 1

Verdict: ACCEPTED

input
111101111111101111111011011110...

correct output
2502

user output
2502

Test 3

Group: 1

Verdict: ACCEPTED

input
000110011101101000000000101010...

correct output
2590

user output
2590

Test 4

Group: 1

Verdict: ACCEPTED

input
110101000010001000101100011000...

correct output
2502

user output
2502

Test 5

Group: 1

Verdict: ACCEPTED

input
000000000000000000000000000000...

correct output
5050

user output
5050

Test 6

Group: 1

Verdict: ACCEPTED

input
0

correct output
1

user output
1

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: ACCEPTED

input
111111111110101111111010111011...

correct output
6250342

user output
6250342

Test 10

Group: 2

Verdict: ACCEPTED

input
110110111000000001011100000011...

correct output
6252352

user output
6252352

Test 11

Group: 2

Verdict: ACCEPTED

input
000000001000101001001110100011...

correct output
6253422

user output
6253422

Test 12

Group: 2

Verdict: ACCEPTED

input
000000000000000000000000000000...

correct output
12502500

user output
12502500

Test 13

Group: 2

Verdict: ACCEPTED

input
0

correct output
1

user output
1

Test 14

Group: 2

Verdict: ACCEPTED

input
1

correct output
0

user output
0

Test 15

Group: 3

Verdict:

input
111111111111111111111111111111...

correct output
62500000000

user output
(empty)

Test 16

Group: 3

Verdict:

input
101101100110111101111011111101...

correct output
62500057360

user output
(empty)

Test 17

Group: 3

Verdict:

input
011100000010000011110101010001...

correct output
62500117306

user output
(empty)

Test 18

Group: 3

Verdict:

input
001010011010000001100011001101...

correct output
62500144780

user output
(empty)

Test 19

Group: 3

Verdict:

input
000000000000000000000000000000...

correct output
125000250000

user output
(empty)

Test 20

Group: 3

Verdict: ACCEPTED

input
0

correct output
1

user output
1

Test 21

Group: 3

Verdict: ACCEPTED

input
1

correct output
0

user output
0