Submission #1776996


Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<utility>
#include<array>
#include<cassert>
#include<list>

using namespace std;

#define SPEEDY cin.tie(0);ios::sync_with_stdio(false);

#define REP(i,n) for(int i=0;i<(n);i++)
#define ARREP(i,n,X) for(int i=0;i<(n);i++)cin>>X[i]
#define FOR(i,X,n) for(int i=(X);i<(n);i++)
#define EREP(i,n) for(int i=1;i<=n;i++)

#define DEB(X) if(mode==1)cout<< #X <<": "<<X<<" ";
#define DEB2(X) if(mode==1)cout<<X<<" ";
#define ARDEB(i,X) if(mode==1)cout<< #X <<"["<<i<<"]: "<<X[i]<<" ";
#define FORDEB(n,X) if(mode==1)for(int i=0;i<(n);i++)ARDEB(i,X)
#define END if(mode==1)cout<<endl;

typedef long long int ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define ALL(X) X.begin(),X.end()
struct edge{int to,cost;};
struct P2{int x,y;};
//struct edge{int from,cost,to;};

const int MOD7=1000000007;
const int INF=100000000;
int mode=0;

int main(){
	string s;
	int count=0;
	char a='a',b;
	cin>>s;
	for(int i=0;i<26;i++){
		for(int j=0;j<s.size();j++){
			if(s[j]==a){
				count=1;
			}
		}
		if(count==0){
			cout<<a<<endl;
			return 0;
		}
		count=0;
		DEB(a);
		a++;
	}
	cout<<"None"<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - Not Found
User mamime19
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1353 Byte
Status AC
Exec Time 6 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
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 256 KB
2.txt AC 1 ms 256 KB
3.txt AC 2 ms 256 KB
4.txt AC 4 ms 512 KB
5.txt AC 4 ms 512 KB
6.txt AC 6 ms 512 KB
7.txt AC 4 ms 512 KB
8.txt AC 6 ms 512 KB
9.txt AC 5 ms 512 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB