Submission #1777038

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>

#define INF 1000000000
#define MOD 1000000007
#define ll long long
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define bitget(a, b) (((a) >> (b)) & 1)
#define vint vector<int>
#define vvint vector<vector<int>>
#define vsort(x) sort(x.begin(), x.end())

using int32 = int_fast32_t;
using int64 = int_fast64_t;
using uint32 = uint_fast32_t;
using uint64 = uint_fast64_t;

using namespace std;

int main() {
	string s;
	cin >> s;
	int c[26] = {};
	rep(i, 0, s.length()){
		c[s[i] - 'a']++;
	}
	char ans;
	int f = 0;
	rep(i, 0, 26){
		if (c[i] == 0){
			ans = 'a' + i;
			f = 1;
			break;
		}
	}
	if (f){
		cout << ans << endl;
	}
	else{
		cout << "None" << endl;
		}
	return 0;
}

Submission Info

Judge Result