Submission #3084416
Source Code Expand
/// Containers Start #include <iostream> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <vector> #include <utility> #include <iomanip> #include <sstream> #include <bitset> #include <cstdlib> #include <iterator> #include <algorithm> #include<random> /// C Header Files #include <cstdio> #include <cctype> #include <cmath> #include <math.h> #include <cmath> #include <ctime> #include <cstring> /// Containers End using namespace std; /// Math Start #define PI acos(-1.0) #define Pi 3.141592653589793 #define EPS (1e-7) #define INF (0x3f3f3f3f) /// Math End /// Extra Start #define nn '\n' #define pb push_back #define SS stringstream #define ull unsigned long long #define mod 1000000007 #define SIZE 2000001 #define _cin ios_base::sync_with_stdio(0); cin.tie(0); #define sz(a) int((a).size()) #define space " " #define All(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define Ignore cin.ignore() #define StringToInt if ( ! (istringstream(s) >> n) ) n = 0; #define SORT(c) sort(All((c))) #define RSORT(c) sort(rall((c))) /// Extra End /// Functions Start template<class T> T gcd(T a, T b) { if (b == 0)return a; return gcd(b, a % b); } long int gcd(long int a, long int b) { if (b == 0)return a; return gcd(b, a % b); } template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; } template<class T> string converter(T n) { SS x; x << n; return x.str(); } #define rep(i, n) for(int i = 0;i < n;i++) #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define FORD(i, a, b) for(int i=(a);i>=(b);i--) #define FORA(arr) for(auto &i:arr) #define Cin(a) cin >>a; #define Cin2(a, b) cin>>a>>b; #define Cin3(a, b, c) cin>>a>>b>>c; #define Cin4(a, b, c, d) cin>>a>>b>>c>>d; #define Cini(a) int a; cin>>a; #define Cinii(a, b) int a,b; cin>>a>>b; #define Cins(s) string s; cin >> s; #define Cinc(c) char c; cin >> c; /// Functions End /// Array Start #define SET(a) memset( a, -1, sizeof a ) #define CLR(a) memset( a, 0, sizeof a ) #define MEM(a, val) memset( a, val, sizeof a ) /// Array End /// Debug Start #define deb(x) cout << #x << ": " << x << endl #define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl #define deb3(x, y, z) cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z << end /// Debug End /// TypeDef Start typedef long long int ll; typedef map<string, int> msi; typedef map<int, int> mii; typedef map<ll, ll> mll; typedef map<char, int> mci; typedef map<int, string> mis; typedef pair<int, int> pii; typedef pair<string, int> psi; typedef pair<string, string> pss; typedef vector<int> vi; typedef vector<string> vs; typedef vector<char> vc; typedef vector<bool> vb; typedef vector<pii> vii; /// TypeDef End int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; /**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/ ///topcoder template int main(void) { Cins(s); int len = 0; while (s[len]) len++; rep(i, len) { char p = s[i]; if (p == 'a' || p == 'i' || p == 'u' || p == 'e' || p == 'o') continue; else cout << s[i]; } cout << nn; return 0; } // //int main(void) { // Cinii(a, b); // int out = (a > b) ? a : b; // cout << out << nn; // return 0; //}
Submission Info
Submission Time | |
---|---|
Task | B - 罠 |
User | gasugesu |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 3802 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_aaaaaaaaaaaaaaaaaaaaaaaaaapaaa.txt, test_abcdefghijklmnopqrstuvwxyz.txt, test_aeuuoeuuooaoikuaouoo.txt, test_aieeuoaoaeioeierrtwmmdkjylcbbj.txt, test_aioeunu.txt, test_aqahahuqugironiyog.txt, test_ay.txt, test_c.txt, test_cizuci.txt, test_clrhrnbnxmhvvrykgpvsjpylvns.txt, test_clwxebedrzlfbey.txt, test_dfiousakzbw.txt, test_di.txt, test_eeeeeleeeeeeeeeeeeeeeeeeeeeeee.txt, test_eugfblf.txt, test_faumfxzsfpgz.txt, test_glpfsryzkcgbkmytzz.txt, test_hzkx.txt, test_iiiiiiiiiiiiiiiiiiiitiiiiiiiii.txt, test_iyenewigoronadomeni.txt, test_joda.txt, test_k.txt, test_kjjxmvpdpcbthjhqqqnsvmvxbtz.txt, test_klaimqrlgrxzgsqkenng.txt, test_mgjpfrkthffctppiueeeouiioeieoa.txt, test_mhfrnzpxkmxjzvmqhwxg.txt, test_mm.txt, test_mvgvrpyghdszgfvznv.txt, test_nu.txt, test_oaiiioieoeiieiuooiueaouuuiw.txt, test_oaqii.txt, test_oit.txt, test_omimujomevadimadom.txt, test_oooooooooolooooooooooooooooooo.txt, test_ooqo.txt, test_ouioiaeiuaoaeiieuuiooeeqo.txt, test_ow.txt, test_pifofawezojisasotuj.txt, test_pn.txt, test_qgqsghgjczftdmvdtrztjdwhcds.txt, test_rxifvbybdsqasoyjdskqwhlstx.txt, test_s.txt, test_taroakpyzmgkbhtklwfbk.txt, test_tkttwgnpjlrkcmwkkcfkjtyb.txt, test_uauoyouaaeoaoeooa.txt, test_uphtuhurtdkmcidxfjtgqtdujblvht.txt, test_uqzghmkf.txt, test_usetumukiwukugekidefupalumimec.txt, test_uueeuoeuviuiieuioeeauuuieeuiee.txt, test_uuueueouaouuiuniaoaaeuaoaa.txt, test_uuuuuuuujuuuuuuuuuuuuuuuuuuuuu.txt, test_vokicozoyatekebagajiceb.txt, test_xlsphqfmqrtrtvmpvbgnkr.txt, test_yepelilemapakonarugupabepisoha.txt, test_zkkyzwjgzmddvqtvvrcqhsrqlmqmkr.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
test_aaaaaaaaaaaaaaaaaaaaaaaaaapaaa.txt | AC | 1 ms | 256 KB |
test_abcdefghijklmnopqrstuvwxyz.txt | AC | 1 ms | 256 KB |
test_aeuuoeuuooaoikuaouoo.txt | AC | 1 ms | 256 KB |
test_aieeuoaoaeioeierrtwmmdkjylcbbj.txt | AC | 1 ms | 256 KB |
test_aioeunu.txt | AC | 1 ms | 256 KB |
test_aqahahuqugironiyog.txt | AC | 1 ms | 256 KB |
test_ay.txt | AC | 1 ms | 256 KB |
test_c.txt | AC | 1 ms | 256 KB |
test_cizuci.txt | AC | 1 ms | 256 KB |
test_clrhrnbnxmhvvrykgpvsjpylvns.txt | AC | 1 ms | 256 KB |
test_clwxebedrzlfbey.txt | AC | 1 ms | 256 KB |
test_dfiousakzbw.txt | AC | 1 ms | 256 KB |
test_di.txt | AC | 1 ms | 256 KB |
test_eeeeeleeeeeeeeeeeeeeeeeeeeeeee.txt | AC | 1 ms | 256 KB |
test_eugfblf.txt | AC | 1 ms | 256 KB |
test_faumfxzsfpgz.txt | AC | 1 ms | 256 KB |
test_glpfsryzkcgbkmytzz.txt | AC | 1 ms | 256 KB |
test_hzkx.txt | AC | 1 ms | 256 KB |
test_iiiiiiiiiiiiiiiiiiiitiiiiiiiii.txt | AC | 1 ms | 256 KB |
test_iyenewigoronadomeni.txt | AC | 1 ms | 256 KB |
test_joda.txt | AC | 1 ms | 256 KB |
test_k.txt | AC | 1 ms | 256 KB |
test_kjjxmvpdpcbthjhqqqnsvmvxbtz.txt | AC | 1 ms | 256 KB |
test_klaimqrlgrxzgsqkenng.txt | AC | 1 ms | 256 KB |
test_mgjpfrkthffctppiueeeouiioeieoa.txt | AC | 1 ms | 256 KB |
test_mhfrnzpxkmxjzvmqhwxg.txt | AC | 1 ms | 256 KB |
test_mm.txt | AC | 1 ms | 256 KB |
test_mvgvrpyghdszgfvznv.txt | AC | 1 ms | 256 KB |
test_nu.txt | AC | 1 ms | 256 KB |
test_oaiiioieoeiieiuooiueaouuuiw.txt | AC | 1 ms | 256 KB |
test_oaqii.txt | AC | 1 ms | 256 KB |
test_oit.txt | AC | 1 ms | 256 KB |
test_omimujomevadimadom.txt | AC | 1 ms | 256 KB |
test_oooooooooolooooooooooooooooooo.txt | AC | 1 ms | 256 KB |
test_ooqo.txt | AC | 1 ms | 256 KB |
test_ouioiaeiuaoaeiieuuiooeeqo.txt | AC | 1 ms | 256 KB |
test_ow.txt | AC | 1 ms | 256 KB |
test_pifofawezojisasotuj.txt | AC | 1 ms | 256 KB |
test_pn.txt | AC | 1 ms | 256 KB |
test_qgqsghgjczftdmvdtrztjdwhcds.txt | AC | 1 ms | 256 KB |
test_rxifvbybdsqasoyjdskqwhlstx.txt | AC | 1 ms | 256 KB |
test_s.txt | AC | 1 ms | 256 KB |
test_taroakpyzmgkbhtklwfbk.txt | AC | 1 ms | 256 KB |
test_tkttwgnpjlrkcmwkkcfkjtyb.txt | AC | 1 ms | 256 KB |
test_uauoyouaaeoaoeooa.txt | AC | 1 ms | 256 KB |
test_uphtuhurtdkmcidxfjtgqtdujblvht.txt | AC | 1 ms | 256 KB |
test_uqzghmkf.txt | AC | 1 ms | 256 KB |
test_usetumukiwukugekidefupalumimec.txt | AC | 1 ms | 256 KB |
test_uueeuoeuviuiieuioeeauuuieeuiee.txt | AC | 1 ms | 256 KB |
test_uuueueouaouuiuniaoaaeuaoaa.txt | AC | 1 ms | 256 KB |
test_uuuuuuuujuuuuuuuuuuuuuuuuuuuuu.txt | AC | 1 ms | 256 KB |
test_vokicozoyatekebagajiceb.txt | AC | 1 ms | 256 KB |
test_xlsphqfmqrtrtvmpvbgnkr.txt | AC | 1 ms | 256 KB |
test_yepelilemapakonarugupabepisoha.txt | AC | 1 ms | 256 KB |
test_zkkyzwjgzmddvqtvvrcqhsrqlmqmkr.txt | AC | 1 ms | 256 KB |