forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path42.cpp
More file actions
78 lines (70 loc) · 1.19 KB
/
42.cpp
File metadata and controls
78 lines (70 loc) · 1.19 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
typedef long long LL;
vector<string> split( const string& s, const string& delim =" " ) {
vector<string> res;
string t;
for ( int i = 0 ; i != s.size() ; i++ ) {
if ( delim.find( s[i] ) != string::npos ) {
if ( !t.empty() ) {
res.push_back( t );
t = "";
}
} else {
t += s[i];
}
}
if ( !t.empty() ) {
res.push_back(t);
}
return res;
}
int s2i(string s) {
stringstream ss;
ss << s;
int res;
ss >> res;
return res;
}
string i2s(int n) {
stringstream ss;
ss << n;
string res;
ss >> res;
return res;
}
int vv[200];
void init() {
memset(vv, 0, sizeof(vv));
int i = 1;
while (true) {
int n = i * (i + 1) / 2;
if (n > 200) break;
vv[n] = 1;
++i;
}
}
void run() {
init();
int res = 0;
string str;
cin >> str;
vector<string> dd = split(str, "\",");
REP(k,dd.size()) {
int t = 0;
REP(i,dd[k].length()) {
t += dd[k][i] - 'A' + 1;
}
if (vv[t]) ++res;
}
cout << res << endl;
}
int main() {
run();
}