Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Vowel_check
//g++ 7.4.0 #include <iostream> #include<bits/stdc++.h> using namespace std; int main() { string a; int l,c=0; cin >> a ; l=a.length(); for(int i=0; i<l-1; i++) { if(a[i]=='A' || a[i]=='E' ||a[i]=='I' ||a[i]=='O' ||a[i]=='U' ||a[i]=='a' ||a[i]=='e' ||a[i]=='i' ||a[i]=='o' ||a[i]=='u' ) { if( a[i+1]!='A' || a[i+1]!='E' || a[i+1]!='I' ||a[i+1]!='O' ||a[i+1]!='U' ||a[i+1]!='a' ||a[i+1]!='e' ||a[i+1]!='i' ||a[i+1]!='o' ||a[i+1]!='u' ) { c++; } i++; } } cout << c << endl; return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
List add v2
CPP - Pointers - Ex.3
ADVENTURE CODE CSCI 40
Primality test Fermat primality test
Biggest even palindrom
semiprog.cpp
Привет Linux
Stock buy/sell
strcpy
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
Please log in to post a comment.