-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathBeach Length.cpp
More file actions
59 lines (59 loc) · 1.18 KB
/
Beach Length.cpp
File metadata and controls
59 lines (59 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <string>
#include <sstream>
#include <stdio.h>
using namespace std;
#define MAXIMUM 100
int main() {
string kingdom[MAXIMUM];
int x = 0;
int sum = 0;
bool isFirstLine = true;
while (getline(cin, kingdom[x])) {
int length;
if (kingdom[x].length() != 0) {
length = kingdom[x].length();
for (int i = 0; i < length - 1; i++) {
if (kingdom[x][i] != kingdom[x][i + 1]) {
sum++;
}
}
if (!isFirstLine) {
if (x & 1) {//odd
for (int i = 0; i < length - 1; i++) {
if (kingdom[x][i] != kingdom[x - 1][i])
sum++;
if (kingdom[x][i] != kingdom[x - 1][i + 1])
sum++;
}
if (kingdom[x][length - 1] != kingdom[x - 1][length - 1])
sum++;
}
else {//even
if (kingdom[x][0] != kingdom[x - 1][0])
sum++;
for (int i = 1; i < length; i++) {
if (kingdom[x][i] != kingdom[x - 1][i])
sum++;
if (kingdom[x][i] != kingdom[x - 1][i - 1])
sum++;
}
}
}
else {
isFirstLine = false;
}
x++;
}
else {
for (int i = 0; i < x; i++) {
kingdom[i].clear();
}
cout << sum << endl;
sum = 0;
x = 0;
isFirstLine = true;
}
}
return 0;
}