# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
706888 | 2023-03-08T04:30:51 Z | YugiHacker | Sifra (COCI21_sifra) | C++14 | 1 ms | 324 KB |
#include<bits/stdc++.h> #define el cout<<"\n" #define f0(i,n) for(int i=0;i<n;++i) #define f1(i,n) for(int i=1;i<=n;++i) #define maxn using namespace std; string s; map<int, int> m; int ans; main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> s; f0 (i, s.size()) { if (!isdigit(s[i])) continue; int n = 0; while (isdigit(s[i])) n = n * 10 + s[i] - '0', i++; i--; if (m[n] == 0) ans++; m[n] = 1; } cout << ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 320 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 324 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |