Submission #1995486

---

Source Code Expand

#include "bits/stdc++.h"

#define rep(a,b) for(int a = 0;a < b;a++)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define P(a) cout << a << endl
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ssort(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define vP(v) for(int i = 0;i < v.size();i++){cout << v[i];if(i != v.size()-1)cout << endl;}
#define vcin(v,n) rep(i,n){int a;cin >> a;v.pb(a);}

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 1, -1 , 0 , 0 };
int dy[] = { 0,  0,  1, -1 };
ll MOD = 1000000007;

void solve(){
	string s;
	cin  >> s;
	map<char,int> m;
	rep(i,s.length()){
		m[s[i]]++;
	}
	int count = 0;
	rep(i,26){
		if(m[(char)('a'+i)] == 0){
			P((char)('a'+i));
			return;
		}
	}
	P("None");
}

int main() {
	solve();
	return 0;
}

Submission Info

Judge Result