Submission #65424652
Source Code Expand
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<char> vcr;
typedef vector<long long> vll;
typedef vector<long double> vld;
typedef vector<string> vst;
const ll INF = 0x1fffffffffffffff;
const ll MOD = 998244353;
const ll ZERO = 0;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
int main(){
string s;
in(s);
map<char, ll> mp; //<キー、値>
vll t(26);
rep(i,s.size()){
t[s[i] - 'a'] = 1;
}
rep(i,26){
if(t[i] == 0){
cout << (char)('a' + i);
return 0;
}
}
}
Submission Info
Submission Time |
|
Task |
A - Not Found |
User |
narikiti |
Language |
C++ 20 (gcc 12.2) |
Score |
100 |
Code Size |
1858 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
3700 KiB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
3520 KiB |
sample_02.txt |
AC |
1 ms |
3556 KiB |
sample_03.txt |
AC |
1 ms |
3564 KiB |
test_01.txt |
AC |
1 ms |
3568 KiB |
test_02.txt |
AC |
1 ms |
3508 KiB |
test_03.txt |
AC |
1 ms |
3584 KiB |
test_04.txt |
AC |
1 ms |
3564 KiB |
test_05.txt |
AC |
1 ms |
3636 KiB |
test_06.txt |
AC |
1 ms |
3440 KiB |
test_07.txt |
AC |
1 ms |
3560 KiB |
test_08.txt |
AC |
1 ms |
3508 KiB |
test_09.txt |
AC |
1 ms |
3632 KiB |
test_10.txt |
AC |
1 ms |
3500 KiB |
test_11.txt |
AC |
1 ms |
3560 KiB |
test_12.txt |
AC |
1 ms |
3496 KiB |
test_13.txt |
AC |
1 ms |
3476 KiB |
test_14.txt |
AC |
1 ms |
3700 KiB |
test_15.txt |
AC |
1 ms |
3508 KiB |
test_16.txt |
AC |
1 ms |
3560 KiB |
test_17.txt |
AC |
1 ms |
3636 KiB |
test_18.txt |
AC |
1 ms |
3560 KiB |
test_19.txt |
AC |
1 ms |
3512 KiB |
test_20.txt |
AC |
1 ms |
3588 KiB |