File tree Expand file tree Collapse file tree 2 files changed +32
-0
lines changed Expand file tree Collapse file tree 2 files changed +32
-0
lines changed Original file line number Diff line number Diff line change
1
+ #include < bits/stdc++.h>
2
+ using namespace std ;
3
+ int main (){
4
+
5
+ string s;
6
+ getline (cin,s);
7
+
8
+ int l=s.length ();
9
+ int f=0 ;
10
+ for (int i=l;i=0 ;i--){
11
+ if (s[i]!=' ' || s[i]!=' ?' ){
12
+ if (s[i]==' A' || s[i]==' E' || s[i]==' I' || s[i]==' O' || s[i]==' U' || s[i]==' Y' || s[i]==' a' || s[i]==' e' || s[i]==' i' || s[i]==' o' || s[i]==' u' || s[i]==' y' ){
13
+ f=1 ;
14
+ break ;
15
+
16
+ }
17
+ else
18
+ f=0 ;}}
19
+
20
+ if (f==1 ){
21
+ cout<<" YES" <<endl;
22
+ }
23
+ else
24
+ cout<<" NO" <<endl;
25
+
26
+
27
+ return 0 ;
28
+ }
Original file line number Diff line number Diff line change
1
+
2
+ #include <bits/stdc++.h>
3
+ =======
1
4
// C++ program for implementation of Heap Sort
2
5
3
6
#include <iostream>
7
+
4
8
using namespace std;
5
9
6
10
// To heapify a subtree rooted with node i
You can’t perform that action at this time.
0 commit comments