Submission #1778782
Source Code Expand
#include <bits/stdc++.h> #define FOR(k,m,n) for(int(k)=(m);(k)<(n);(k)++) #define REP(k,n) FOR((k),0,(n)) using namespace std; typedef long long ll; typedef vector<ll> VLL; const int MOD=1000000007; int main(){ cin.tie(0); ios::sync_with_stdio(false); string s(100000, '\0'); cin >> s; FOR(i, 0, 26){ if (s.find('a'+i) != -1){ continue; } char res = 'a' + i; cout << res << endl; return 0; } cout << "None" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Not Found |
User | mira_fn |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 541 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 1 ms | 384 KB |
2.txt | AC | 1 ms | 384 KB |
3.txt | AC | 1 ms | 384 KB |
4.txt | AC | 1 ms | 384 KB |
5.txt | AC | 1 ms | 384 KB |
6.txt | AC | 1 ms | 384 KB |
7.txt | AC | 1 ms | 384 KB |
8.txt | AC | 1 ms | 384 KB |
9.txt | AC | 1 ms | 384 KB |
sample1.txt | AC | 1 ms | 384 KB |
sample2.txt | AC | 1 ms | 384 KB |
sample3.txt | AC | 1 ms | 384 KB |