#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 3e5+100, M = 1e5+10, F = 2147483646, K = 20;
string s;
set<string> se;
map<char, bool> c;
int main(){
cin.tie(0); ios::sync_with_stdio(0);
cin >> s;
for(char cc='0'; cc <= '9'; cc++) c[cc] = 1;
s += "??";
for(int i = 0; i < int(s.length()) - 2; i++){
if(c[s[i]] && c[s[i + 1]] && c[s[i + 2]]){
string t = "";
t += s[i];
t += s[i+1];
t += s[i+2];
se.insert(t);
i += 2;
}else if(c[s[i]] && c[s[i + 1]]){
string t = "";
t += s[i];
t += s[i+1];
se.insert(t);
++i;
}else if(c[s[i]]){
string t = "";
t += s[i];
se.insert(t);
}
}
cout << se.size();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |