Submission #2855779
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) // {{{ template<typename T> void printmatrix(vector<vector<T> > ar){ for (int i = 0; i < (int)ar.size(); i++) { for (int j = 0; j < (int)ar[0].size(); j++) { cout << ar[i][j]; } cout << endl; } } template<typename T> void printvector(vector<T> vec){ for (int i = 0; i < (int)vec.size(); i++) { cout << vec[i] << endl; } } template<typename T> void unique(vector<T>& vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end()); } template<typename T> vector<T> cumsum(vector<T> vec){ vector<T> newvec((T)vec.size()); int tmp = 0; for (int i = 0; i < (int)vec.size(); i++) { tmp += vec[i]; newvec[i] = tmp; } return newvec; } template<typename T> T digitsum(T x){ T y=0; while(x){ y += x % 10; x /= 10; } return y; } // }}} /* vim:set foldmethod=marker: */ int main(int argc, char const* argv[]) { string s; cin >> s; bool truth=true; for (char i = 'a'; i <= 'z'; i++) { // cout << i << endl; if (s.find(i) != string::npos) { continue; }else{ truth=false; cout << i << endl; break; } } if (truth) { cout << "None" << endl; } return 0; } // sortの仕方 // int a[N]; // array<int,N> ar; // vector<int> v; // // sort(a, a+N); // 配列 // sort(ar.begin(), ar.end()); // array // sort(v.begin(), v.end()); // vector 昇順 // sort(v.begin(), v.end(), greater<int>()); // 降順 // Template // template <class T> // T foomax(T x, T y){ // if (x > y){ // return x; // }else{ // return y; // } // } // string を int に変換 stoi("1010") // int を string に変換 to_string(1010)
Submission Info
Submission Time | |
---|---|
Task | B - Not Found |
User | goropikari |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 2080 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 512 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 | 256 KB |
2.txt | AC | 1 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
4.txt | AC | 4 ms | 512 KB |
5.txt | AC | 4 ms | 512 KB |
6.txt | AC | 4 ms | 512 KB |
7.txt | AC | 4 ms | 512 KB |
8.txt | AC | 4 ms | 512 KB |
9.txt | AC | 4 ms | 512 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |