practice 20-Jan-2020

Author: sureshmangs

competitive programming/codeforces/1146A - Love A.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    string s;
+    cin>>s;
+    int n=s.length();
+    int ca=0;
+    for(int i=0;i<n;i++){
+        if(s[i]=='a') ca++;
+    }
+    int other=n-ca;
+    if(n==0) cout<<n;
+    else if(ca>other) cout<<n;
+    else if(ca<=other)
+        cout<<ca+ca-1;
+
+return 0;
+}

competitive programming/codeforces/1281A - Suffix Three.cpp

@@ -0,0 +1,24 @@
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t;
+    cin>>t;
+    while(t--){
+        string s;
+        cin>>s;
+        char ch=s[s.length()-1];
+        switch(ch){
+        case 'o': cout<<"FILIPINO\n"; break;
+        case 'u': cout<<"JAPANESE\n"; break;
+        case 'a': cout<<"KOREAN\n"; break;}
+    }
+
+
+return 0;
+}

competitive programming/codeforces/867A - Between the Offices.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int n;
+    cin>>n;
+    string s;
+    cin>>s;
+    int cf=0,cs=0;
+    for(int i=0;i<n-1;i++){
+        if(s[i]!=s[i+1]){
+            if(s[i]=='F') cf++;
+            else cs++;
+        }
+    }
+    if(cs>cf) cout<<"YES";
+    else cout<<"NO";
+
+return 0;
+}