From c8ca25dd4b3a54dd05decf1b822fa94ef3c5de3d Mon Sep 17 00:00:00 2001
From: Biswajit Rout <b119018@iiit-bh.ac.in>
Date: Sun, 6 Sep 2020 14:09:18 +0530
Subject: [PATCH] Add files via upload

---
 110A - nearly_lucky_no.cpp        | 20 +++++++++++++
 112A - Petya_and_strings.cpp      | 30 ++++++++++++++++++++
 116A - tram.cpp                   | 15 ++++++++++
 133A - hq9+.cpp                   | 20 +++++++++++++
 141A - Amusing_joke.cpp           | 17 +++++++++++
 144A - arrival_of_the_general.cpp | 33 ++++++++++++++++++++++
 148A - insomnia_cure.cpp          | 27 ++++++++++++++++++
 151A - Soft_Drinking.cpp          | 20 +++++++++++++
 155A - I_love_username.cpp        | 22 +++++++++++++++
 200B - drinks.cpp                 | 14 +++++++++
 228A - horseshoe.cpp              | 19 +++++++++++++
 231A - team.cpp                   | 15 ++++++++++
 233A-perfect_permutation.cpp      | 14 +++++++++
 236A - boyorgirl.cpp              | 22 +++++++++++++++
 246a - cupboards.cpp              | 35 +++++++++++++++++++++++
 263A - beautiful_matrix.cpp       | 25 ++++++++++++++++
 266A - stones_on_table.cpp        | 21 ++++++++++++++
 266B - queue_at_school.cpp        | 18 ++++++++++++
 271A - beautiful_year.cpp         | 17 +++++++++++
 281A - word_capitalization.cpp    | 18 ++++++++++++
 282A - bit++.cpp                  | 18 ++++++++++++
 32B - borze.cpp                   | 25 ++++++++++++++++
 339A - helpful_maths.cpp          | 47 +++++++++++++++++++++++++++++++
 59A - word.cpp                    | 32 +++++++++++++++++++++
 61A - ultra_fast.cpp              | 15 ++++++++++
 69A - young_physicist.cpp         | 29 +++++++++++++++++++
 71A - way_too_long_words.cpp      | 29 +++++++++++++++++++
 80A-panoramix.cpp                 | 34 ++++++++++++++++++++++
 28 files changed, 651 insertions(+)
 create mode 100644 110A - nearly_lucky_no.cpp
 create mode 100644 112A - Petya_and_strings.cpp
 create mode 100644 116A - tram.cpp
 create mode 100644 133A - hq9+.cpp
 create mode 100644 141A - Amusing_joke.cpp
 create mode 100644 144A - arrival_of_the_general.cpp
 create mode 100644 148A - insomnia_cure.cpp
 create mode 100644 151A - Soft_Drinking.cpp
 create mode 100644 155A - I_love_username.cpp
 create mode 100644 200B - drinks.cpp
 create mode 100644 228A - horseshoe.cpp
 create mode 100644 231A - team.cpp
 create mode 100644 233A-perfect_permutation.cpp
 create mode 100644 236A - boyorgirl.cpp
 create mode 100644 246a - cupboards.cpp
 create mode 100644 263A - beautiful_matrix.cpp
 create mode 100644 266A - stones_on_table.cpp
 create mode 100644 266B - queue_at_school.cpp
 create mode 100644 271A - beautiful_year.cpp
 create mode 100644 281A - word_capitalization.cpp
 create mode 100644 282A - bit++.cpp
 create mode 100644 32B - borze.cpp
 create mode 100644 339A - helpful_maths.cpp
 create mode 100644 59A - word.cpp
 create mode 100644 61A - ultra_fast.cpp
 create mode 100644 69A - young_physicist.cpp
 create mode 100644 71A - way_too_long_words.cpp
 create mode 100644 80A-panoramix.cpp

diff --git a/110A - nearly_lucky_no.cpp b/110A - nearly_lucky_no.cpp
new file mode 100644
index 0000000..bd16007
--- /dev/null
+++ b/110A - nearly_lucky_no.cpp	
@@ -0,0 +1,20 @@
+#include <iostream>
+using namespace std;
+int main(){
+    long long y;
+    int a=0;
+    cin >> y;
+    while(y!=0){
+        if(y%10==4 || y%10==7){
+            a++;
+        }
+        y = y/10;
+    }
+    if(a==4 || a==7){
+        cout<<"YES"<<endl;
+    }
+    else {
+        cout<<"NO"<<endl;
+    }
+    
+}
diff --git a/112A - Petya_and_strings.cpp b/112A - Petya_and_strings.cpp
new file mode 100644
index 0000000..6bcb826
--- /dev/null
+++ b/112A - Petya_and_strings.cpp	
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+int main(){
+    int count = 0;
+    string s,s1;
+    cin>>s>>s1;
+    int l = s.length();
+    for(int i=0;i<l;i++){
+        s[i]=tolower(s[i]);
+        s1[i]=tolower(s1[i]);
+    }
+    if(s==s1){
+        cout<<"0";
+    }
+    else{
+        for(int i=0;i<l;i++){
+            if(s[i]<s1[i]){
+                cout<<"-1";
+                break;
+            }
+            else if(s1[i]<s[i]){
+                cout<<"1";
+                break;
+            }
+        }
+    }
+
+}
\ No newline at end of file
diff --git a/116A - tram.cpp b/116A - tram.cpp
new file mode 100644
index 0000000..9384e98
--- /dev/null
+++ b/116A - tram.cpp	
@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,a,b,c=0,max=0;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>a>>b;
+        c=c+(b-a);
+        if(c>max){
+            max=c;
+        }
+    }
+    cout<<max;
+
+}
\ No newline at end of file
diff --git a/133A - hq9+.cpp b/133A - hq9+.cpp
new file mode 100644
index 0000000..4030464
--- /dev/null
+++ b/133A - hq9+.cpp	
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    int count=0;
+    string s;
+    cin>>s;
+    int l = s.length();
+    for(int i=0;i<l;i++){
+        if(s[i]=='H' || s[i]=='Q' || s[i]=='9'){
+            count=1;
+        }
+    }
+    if(count){
+        cout<<"YES";
+    }
+    else {
+        cout<<"NO";
+    }
+}
\ No newline at end of file
diff --git a/141A - Amusing_joke.cpp b/141A - Amusing_joke.cpp
new file mode 100644
index 0000000..076ab58
--- /dev/null
+++ b/141A - Amusing_joke.cpp	
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+int main(){
+    string s1,s2,s3;
+    cin>>s1>>s2>>s3;
+    s1.append(s2);
+    sort(s1.begin(),s1.end());
+    sort(s3.begin(),s3.end());
+    if(s1==s3){
+        cout<<"YES";
+    }
+    else {
+        cout<<"NO";
+    }
+}
\ No newline at end of file
diff --git a/144A - arrival_of_the_general.cpp b/144A - arrival_of_the_general.cpp
new file mode 100644
index 0000000..bcd2100
--- /dev/null
+++ b/144A - arrival_of_the_general.cpp	
@@ -0,0 +1,33 @@
+#include <iostream>
+#include<cmath>
+using namespace std;
+
+int main() {
+int n;
+int maxvalue=0;
+int minvalue=1000;
+int maxindex=0;
+int minindex=0;
+cin>>n;
+for(int i=0;i<n;i++){
+	int x;
+	cin>>x;
+if(x>maxvalue){
+	maxindex=i;
+	maxvalue=x;
+}
+ if(x<=minvalue){
+	minindex=i;
+	minvalue=x;
+ }
+}
+if(maxindex>minindex){
+	cout<<(maxindex+(n-1)-minindex)-1;
+}
+else{
+	cout<<(maxindex+(n-1)-minindex);
+
+}
+
+	return 0;
+}
\ No newline at end of file
diff --git a/148A - insomnia_cure.cpp b/148A - insomnia_cure.cpp
new file mode 100644
index 0000000..59e996f
--- /dev/null
+++ b/148A - insomnia_cure.cpp	
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <cstdio>
+using namespace std;
+
+int main()
+{
+    int k, l, m, n, d;
+    int cont = 0;
+    
+    cin >> k >> l >> m >> n >> d;
+    cont = d;
+    
+    if(k == 1 || l == 1 || m == 1 || n == 1)
+    {
+        cout << d << endl;
+    }
+    else
+    {
+        for(int i = 1; i <= d; i++)
+        {
+            if((i%k != 0) && (i%l != 0) && (i%m != 0) && (i%n != 0))
+                cont--;
+        }
+        cout << cont << endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/151A - Soft_Drinking.cpp b/151A - Soft_Drinking.cpp
new file mode 100644
index 0000000..d7898b1
--- /dev/null
+++ b/151A - Soft_Drinking.cpp	
@@ -0,0 +1,20 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n, k, l, c, d, p, nl, np,min;
+    cin>> n>>k>>l>>c>>d>>p>>nl>>np;
+    int r = (k*l)/nl;
+    int b = c*d;
+    int q = p/np;
+    if(r<b && r<q){
+        min=r;
+    }
+    else if(b<q){
+        min=b;
+    }
+    else{
+        min=q;
+    }
+    int result =min/n;
+    cout<<result;
+}
\ No newline at end of file
diff --git a/155A - I_love_username.cpp b/155A - I_love_username.cpp
new file mode 100644
index 0000000..d1f87eb
--- /dev/null
+++ b/155A - I_love_username.cpp	
@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int A[1001],n,min,max,count=0;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>A[i];
+    }
+    min=A[0];
+    max=A[0];
+    for(int i=1;i<n;i++){
+        if(A[i]>max){
+            count++;
+            max=A[i];
+        }
+        else if(A[i]<min){
+            count++;
+            min=A[i];
+        }
+    }
+    cout<<count;
+}
\ No newline at end of file
diff --git a/200B - drinks.cpp b/200B - drinks.cpp
new file mode 100644
index 0000000..0d4f85c
--- /dev/null
+++ b/200B - drinks.cpp	
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n;
+    float volume=0.0;
+    cin >> n;
+    for(int i=0;i<n;i++){
+        int x;
+        cin >> x;
+        volume +=x;
+    }
+    float c= volume/n;
+    cout<<c;
+}
\ No newline at end of file
diff --git a/228A - horseshoe.cpp b/228A - horseshoe.cpp
new file mode 100644
index 0000000..cdc14eb
--- /dev/null
+++ b/228A - horseshoe.cpp	
@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int A[4],count=0,a=0;
+    for(int i=0;i<4;i++){
+        cin>>A[i];
+    }
+    for(int i=0;i<4;i++){
+        if(a!=A[i]){
+            for(int j=i+1;j<4;j++){
+            if(A[i]==A[j]){
+                count++;
+                a=A[i];
+            }
+        }
+        }
+    }
+    cout<<count;
+}
\ No newline at end of file
diff --git a/231A - team.cpp b/231A - team.cpp
new file mode 100644
index 0000000..c5c917f
--- /dev/null
+++ b/231A - team.cpp	
@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int a,b,c,sum=0,count=0,n;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>a>>b>>c;
+        sum=sum+a+b+c;
+        if(sum>=2){
+            count++;
+        }
+        sum=0;
+    }
+    cout<<count;
+}
\ No newline at end of file
diff --git a/233A-perfect_permutation.cpp b/233A-perfect_permutation.cpp
new file mode 100644
index 0000000..e3f9bbf
--- /dev/null
+++ b/233A-perfect_permutation.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n;
+    cin >> n;
+    if(n%2==1){
+        cout<<-1;
+    }
+    else {
+        for(int i=1;i<=n;i+=2){
+            cout<<i+1<<' '<<i<<' ';
+        }
+    }
+}
\ No newline at end of file
diff --git a/236A - boyorgirl.cpp b/236A - boyorgirl.cpp
new file mode 100644
index 0000000..4f21beb
--- /dev/null
+++ b/236A - boyorgirl.cpp	
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+int main(){
+    int count=0;
+    string s;
+    cin>>s;
+    int l=s.length();
+    sort(s.begin(),s.end());
+    for(int i=0;i<s.length();i++){
+        if(s[i]!=s[i+1]){
+            count++;
+        }
+    }
+    if(count%2!=0){
+        cout<<"IGNORE HIM!";
+    }
+    else{
+        cout<<"CHAT WITH HER!";
+    }
+}
\ No newline at end of file
diff --git a/246a - cupboards.cpp b/246a - cupboards.cpp
new file mode 100644
index 0000000..c24cdc9
--- /dev/null
+++ b/246a - cupboards.cpp	
@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+int main() {
+    int n,l,r;
+    int lopen=0,lclose=0,ropen=0,rclose=0;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>l>>r;
+        if(l==0){
+            lclose++;
+        }
+        else{
+            lopen++;
+        }
+        if(r==0){
+            rclose++;
+        }
+        else{
+            ropen++;
+        }
+    }
+    if(lclose<lopen){
+        l=lclose;
+    }
+    else{
+        l=lopen;
+    }
+    if(rclose<ropen){
+        r=rclose;
+    }
+    else{
+        r=ropen;
+    }
+    cout<<l+r; 
+}
\ No newline at end of file
diff --git a/263A - beautiful_matrix.cpp b/263A - beautiful_matrix.cpp
new file mode 100644
index 0000000..138a0cb
--- /dev/null
+++ b/263A - beautiful_matrix.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <math.h>
+
+using namespace std;
+
+int main()
+{
+    int x,y,i,j,a[6][6],ans;
+    for(i=0;i<5;i++){
+        for(j=0;j<5;j++){
+            scanf("%d",&a[i][j]);
+        }
+    }
+    for(i=0;i<5;i++){
+        for(j=0;j<5;j++){
+            if(a[i][j]==1){
+                x=i+1;
+                y=j+1;
+            }
+        }
+    }
+    ans=abs(x-3)+abs(y-3);
+    printf("%d\n",ans);
+    return 0;
+}
\ No newline at end of file
diff --git a/266A - stones_on_table.cpp b/266A - stones_on_table.cpp
new file mode 100644
index 0000000..481c861
--- /dev/null
+++ b/266A - stones_on_table.cpp	
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main() {
+    int l;
+    string s;
+    int count=0;
+    cin >> l >> s;
+    for(int i=0;i<l;i++){
+        if(s[i]=='R' && s[i+1] == 'R'){
+            count++;
+        }
+        else if(s[i]=='G' && s[i+1]=='G'){
+            count++;
+        }
+        else if(s[i]=='B' && s[i+1] == 'B'){
+            count++;
+        }
+    }
+    cout<<count<<endl;
+}
\ No newline at end of file
diff --git a/266B - queue_at_school.cpp b/266B - queue_at_school.cpp
new file mode 100644
index 0000000..668b485
--- /dev/null
+++ b/266B - queue_at_school.cpp	
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main() {
+    int n,t;
+    string s;
+    cin >> n >> t >>s;
+    while(t--) {
+        for(int i=0;i<n;i++){
+            if(s[i] == 'B' && s[i+1] == 'G') {
+                s[i+1] = 'B';
+                s[i] = 'G';
+                i++;
+            }        
+        }
+    }
+    cout << s << endl;
+}
\ No newline at end of file
diff --git a/271A - beautiful_year.cpp b/271A - beautiful_year.cpp
new file mode 100644
index 0000000..f8442ee
--- /dev/null
+++ b/271A - beautiful_year.cpp	
@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int y;
+    cin>>y;
+    while(true){
+        y += 1;
+        int a = y/1000;
+        int b = (y/100)%10;
+        int c = (y/10)%10;
+        int d = y%10;
+        if(a!=b && a!=c && a!=d && b!=c && b!=d && c!=d) {
+            break;
+        }
+    }
+    cout<<y<<endl;
+}
\ No newline at end of file
diff --git a/281A - word_capitalization.cpp b/281A - word_capitalization.cpp
new file mode 100644
index 0000000..9c4ae8b
--- /dev/null
+++ b/281A - word_capitalization.cpp	
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main() {
+    string s;
+    cin >> s;
+    int l= s.length();
+    for(int i=0;i<l;i++){
+        if(i==0){
+            char ch;
+            ch=toupper(s[0]);
+            cout<<ch;
+        }
+        else {
+            cout<<s[i];
+        }
+    }
+}
\ No newline at end of file
diff --git a/282A - bit++.cpp b/282A - bit++.cpp
new file mode 100644
index 0000000..9ea4074
--- /dev/null
+++ b/282A - bit++.cpp	
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    int n,x=0;
+    string s;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>s;
+        if(s=="++X" || s=="X++"){
+            x++;
+        }
+        else if(s=="--X" || s=="X--"){
+            x--;
+        }
+    }
+    cout<<x;
+}
\ No newline at end of file
diff --git a/32B - borze.cpp b/32B - borze.cpp
new file mode 100644
index 0000000..637c843
--- /dev/null
+++ b/32B - borze.cpp	
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+int main() {
+    string s;
+    cin >> s;
+    int l = s.length();
+    for(int i=0;i<l;i++){
+        if(s[i] == '-' && s[i+1] == '.'){
+            cout<<"1";
+            i++;
+        }
+        else {
+            if(s[i] == '-' && s[i+1] == '-'){
+                cout<<"2";
+                i++;
+            }
+            else {
+                cout<<"0";
+            }
+        }
+
+    }
+}
\ No newline at end of file
diff --git a/339A - helpful_maths.cpp b/339A - helpful_maths.cpp
new file mode 100644
index 0000000..63fba02
--- /dev/null
+++ b/339A - helpful_maths.cpp	
@@ -0,0 +1,47 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    string s;
+    int c1=0,c2=0,c3=0;
+    cin>>s;
+    for(int i=0;i<s.length();i++){
+        if(s[i]=='1'){
+            c1++;
+        }
+        else if(s[i]=='2'){
+            c2++;
+        }
+        else if(s[i]=='3'){
+            c3++;
+        }
+        
+    }
+    for(int i=0;i<c1;i++){
+        cout<<'1';
+        if(c2==0 && c3==0 && i==c1-1){
+            cout<<endl;
+        }
+        else{
+            cout<<'+';
+        }
+    }    
+    for(int i=0;i<c2;i++){
+        cout<<'2';
+        if(c3==0 && i==c2-1){
+            cout<<endl;
+        }
+        else{
+            cout<<'+';
+        }
+    }
+    for(int i=0;i<c3;i++){
+        cout<<'3';
+        if(i==c3-1){
+            cout<<endl;
+        }
+        else{
+            cout<<'+';
+        }
+    }
+}
\ No newline at end of file
diff --git a/59A - word.cpp b/59A - word.cpp
new file mode 100644
index 0000000..726c345
--- /dev/null
+++ b/59A - word.cpp	
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    string s;
+    int upper=0,lower=0;
+    cin >> s;
+    int l = s.length();
+    for(int i=0;i<l;i++){
+
+        if(isupper(s[i])){
+            upper++;
+        }
+        else{
+            lower++;
+        }
+    }
+    if(lower>=upper){
+        for(int i=0;i<l;i++){
+            char ch;
+            ch=tolower(s[i]);
+            cout<<ch;
+        }
+    }
+    else{
+         for(int i=0;i<l;i++){
+            char ch;
+            ch=toupper(s[i]);
+            cout<<ch;
+        }
+    }
+}
\ No newline at end of file
diff --git a/61A - ultra_fast.cpp b/61A - ultra_fast.cpp
new file mode 100644
index 0000000..3af6909
--- /dev/null
+++ b/61A - ultra_fast.cpp	
@@ -0,0 +1,15 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    string s1,s2;
+    cin>>s1>>s2;
+    for(int i=0;i<s1.length();i++){
+        if(s1[i]!=s2[i]){
+            cout<<'1';
+        }
+        else {
+            cout<<'0';
+        }
+    }
+}
\ No newline at end of file
diff --git a/69A - young_physicist.cpp b/69A - young_physicist.cpp
new file mode 100644
index 0000000..6049978
--- /dev/null
+++ b/69A - young_physicist.cpp	
@@ -0,0 +1,29 @@
+
+#include <iostream>
+
+using namespace std;
+
+int main()
+ {
+    int n, x, y, z, xsum=0, ysum=0, zsum=0;
+    cin >> n;
+
+    while (n--)
+    {
+        cin >> x >> y >> z;
+        xsum += x;
+        ysum += y;
+        zsum += z;
+    }
+
+    if (xsum == 0 && ysum == 0 && zsum == 0)
+    {
+        cout << "YES" << endl;
+    }
+    else
+    {
+        cout << "NO" << endl;
+    }
+
+    return 0;
+}
diff --git a/71A - way_too_long_words.cpp b/71A - way_too_long_words.cpp
new file mode 100644
index 0000000..d57a358
--- /dev/null
+++ b/71A - way_too_long_words.cpp	
@@ -0,0 +1,29 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    int n;
+    string s[100],s1[100];
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>s[i];
+    }
+    for(int i=0;i<n;i++){
+        string a = s[i];
+        int l=a.length();
+        if(l<=10){
+            s1[i]=a;
+        }
+        else{
+            int r= l-2;
+            string ns=" ";
+            string no=to_string(r);
+            ns=a[0]+no+a[l-1];
+            s1[i]=ns;
+        }
+    }
+    for(int i=0;i<n;i++){
+        cout<<s1[i]<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/80A-panoramix.cpp b/80A-panoramix.cpp
new file mode 100644
index 0000000..aa10b74
--- /dev/null
+++ b/80A-panoramix.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+int a, b, h = 0;
+int mas[16] = {
+        2,
+        3,
+        5,
+        7,
+        11,
+        13,
+        17,
+        19,
+        23,
+        29,
+        31,
+        37,
+        41,
+        43,
+        47
+};
+int main() {
+    cin >> a >> b;
+    for (int i = 0; i < 15; i++) {
+        if (a == mas[i] && b == mas[i + 1]) {
+            h++;
+            break;
+        }
+    }
+    if (h == 0) {
+        cout << "NO";
+    } else {
+        cout << "YES";
+    }
+}
\ No newline at end of file