Submission #6933599
Source Code Expand
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef std::pair<ll,ll> pl;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
const ll MOD = 1e9 + 7;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
ll gcd(ll m, ll n){
ll a = max(m, n);
ll b = min(m, n);
while(b != 1 && b != 0){ a %= b; swap(a, b);}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n){ return m / gcd(m, n) * n;}
ll power_mod(ll a, ll power, ll mod){
ll value = 1;
while(power != 0){
if(power & 1) value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod){
return power_mod(a, mod - 2, mod);
}
ll power_normal(ll a, ll power){
ll value = 1;
while(power != 0){
if(power & 1) value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll combination(ll n, ll r){
ll numerator = 1;
ll denomenator = 1;
for(ll i = 0; i < r ; i++){
(numerator *= ll(n - i)) %= MOD;
(denomenator *= modinv(i + 1, MOD)) %= MOD;
}
return (numerator * denomenator) % MOD;
}
ll bin_search_range(ll key, ll S[], ll left, ll right) {
while (right >= left) {
ll mid = left + (right - left) / 2;
if (S[mid] >= key && S[mid - 1] < key) return mid;
else if (S[mid - 1] >= key) right = mid - 1;
else if (S[mid] < key) left = mid + 1;
}
return right + 1;
}
ll bin_search(ll key, ll A[], ll left, ll right){
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end.
while(right >= left){
ll mid = left + (right - left) / 2;
if (A[mid] == key) return mid;
else if (A[mid] > key) right = mid - 1;
else if (A[mid] < key) left = mid + 1;
}
return -1;
}
#define rep(i, n) for(ll (i) = 0; (i) < (n) ; (i)++ )
#define For(i, a, b) for(ll (i) = (a); (i) < (b) ; (i)++ )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define tol(c) char((c)+0x20)
#define tou(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a,b) cout << (a) << " " << (b) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) if ((condition)) prl("Yes"); else prl("No");
#define YN(condition) if ((condition)) prl("YES"); else prl("NO");
#define rpr(i,n,ans) rep((i),(n)) prs((ans[(i)]))
#define cpr(i,n,ans) rep((i),(n)) prl((ans[(i)]))
#define in1(a) cin >> (a)
#define in2(a,b) cin >> (a) >> (b)
#define in3(a,b,c) cin >> (a) >> (b) >> (c)
#define in4(a,b,c,d) cin >> (a) >> (b) >> (c) >> (d)
#define rin1(i,n,a) rep((i),(n)) cin >> (a[(i)])
#define rin2(i,n,a,b) rep((i),(n)) cin >> (a[(i)]) >> (b[(i)])
#define rin3(i,n,a,b,c) rep((i),(n)) cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])
#define matin(i,h,j,w,a) rep((i),(h)) rep((j),(w)) cin >> a[i][j]
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for(auto &(kv): (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define beto(a,b,c) (a) < (b) && (b) < (c)
#define betc(a,b,c) (a) <= (b) && (b) <= (c)
#define rsort(a,n) sort(a,a+n,greater<>())
#define Forchar(c,a,z) for(char (c) = (a); (c) <= (z); (c)++)
#define cntchar(s,c) count(all((s)), c)
#define vo(c) (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o')
const ll MAX_N = 100000;
int main(void){
str s;
in1(s);
rep(i,s.length()) if (!vo(s[i])) pr(s[i]);
prl("");
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 罠 |
User |
nabenabe0928 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4148 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 |