# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1055388 |
2024-08-12T18:36:39 Z |
fryingduc |
Sifra (COCI21_sifra) |
C++17 |
|
0 ms |
604 KB |
/**
* author: fryingduc
* created:28.04.2022 14:36:18
**/
/* #pragma GCC optimize("Ofast,unroll-loops") */
#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
/* #define int long long */
string s;
void solve(){
cin >> s;
map<string, bool> mp;
int ans = 0;
for(int i = 0; i < (int)s.size(); ++i){
string a;
int cnt = 0;
while(i < (int)s.size() and isdigit(s[i])){
a += s[i];
++i;
cnt = 1;
}
if(!mp.count(a)){
ans++;
mp[a] = 1;
}
i -= cnt;
}
cout << ans - 1; // a could be ""
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int test = 1;
/* cin >> test; */
for(int i = 1; i <= test; i++){
/* cout << "Case " << "#" << i << ": "; */
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
604 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |