🚀 19-Nov-2020

Author: sureshmangs

competitive programming/codeforces/122A - Lucky Division.cpp

@@ -0,0 +1,80 @@
+/*
+Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
+
+Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number n is almost lucky.
+
+Input
+The single line contains an integer n (1 ≤ n ≤ 1000) — the number that needs to be checked.
+
+Output
+In the only line print "YES" (without the quotes), if number n is almost lucky. Otherwise, print "NO" (without the quotes).
+
+Examples
+inputCopy
+47
+outputCopy
+YES
+inputCopy
+16
+outputCopy
+YES
+inputCopy
+78
+outputCopy
+NO
+Note
+Note that all lucky numbers are almost lucky as any number is evenly divisible by itself.
+
+In the first sample 47 is a lucky number. In the second sample 16 is divisible by 4.
+*/
+
+
+
+
+
+
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+
+bool isLucky(int tmp){
+    while(tmp){
+        if(!(tmp%10==4 || tmp%10==7)){
+            return false;
+        }
+        tmp/=10;
+    }
+    return true;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int n;
+    cin>>n;
+
+    bool lucky=true;
+
+    lucky=isLucky(n);
+
+
+    if(lucky) cout<<"YES";
+    else {
+        for(int i=1;i<n;i++){
+            if(n%i==0 && isLucky(i)){
+                lucky=true;
+                break;
+            }
+        }
+        if(lucky) cout<<"YES";
+        else cout<<"NO";
+    }
+
+return 0;
+}

competitive programming/codeforces/131A - cAPS lOCK.cpp

@@ -0,0 +1,66 @@
+/*
+wHAT DO WE NEED cAPS LOCK FOR?
+
+Caps lock is a computer keyboard key. Pressing it sets an input mode in which typed letters are capital by default. If it is pressed by accident, it leads to accidents like the one we had in the first passage.
+
+Let's consider that a word has been typed with the Caps lock key accidentally switched on, if:
+
+either it only contains uppercase letters;
+or all letters except for the first one are uppercase.
+In this case we should automatically change the case of all letters. For example, the case of the letters that form words "hELLO", "HTTP", "z" should be changed.
+
+Write a program that applies the rule mentioned above. If the rule cannot be applied, the program should leave the word unchanged.
+
+Input
+The first line of the input data contains a word consisting of uppercase and lowercase Latin letters. The word's length is from 1 to 100 characters, inclusive.
+
+Output
+Print the result of the given word's processing.
+
+Examples
+inputCopy
+cAPS
+outputCopy
+Caps
+inputCopy
+Lock
+outputCopy
+Lock
+
+*/
+
+
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    string s;
+    cin>>s;
+
+    int cnt=0;
+
+    int n=s.length();
+
+    for(auto &ch: s){
+        if(ch>='A' && ch<='Z') cnt++;
+    }
+
+    if(cnt==n){
+        for(int i=0;i<n;i++) s[i]=tolower(s[i]);
+    } else if(s[0]>='a' && s[0]<='z' && cnt==n-1){
+        s[0]=toupper(s[0]);
+        for(int i=1;i<n;i++) s[i]=tolower(s[i]);
+    }
+
+    cout<<s;
+
+return 0;
+}

competitive programming/codeforces/133A - HQ9+.cpp

@@ -0,0 +1,65 @@
+/*
+HQ9+ is a joke programming language which has only four one-character instructions:
+
+"H" prints "Hello, World!",
+"Q" prints the source code of the program itself,
+"9" prints the lyrics of "99 Bottles of Beer" song,
+"+" increments the value stored in the internal accumulator.
+Instructions "H" and "Q" are case-sensitive and must be uppercase. The characters of the program which are not instructions are ignored.
+
+You are given a program written in HQ9+. You have to figure out whether executing this program will produce any output.
+
+Input
+The input will consist of a single line p which will give a program in HQ9+. String p will contain between 1 and 100 characters, inclusive. ASCII-code of each character of p will be between 33 (exclamation mark) and 126 (tilde), inclusive.
+
+Output
+Output "YES", if executing the program will produce any output, and "NO" otherwise.
+
+Examples
+inputCopy
+Hi!
+outputCopy
+YES
+inputCopy
+Codeforces
+outputCopy
+NO
+Note
+In the first case the program contains only one instruction — "H", which prints "Hello, World!".
+
+In the second case none of the program characters are language instructions.
+
+
+*/
+
+
+
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    string s;
+    cin>>s;
+
+    bool print=false;
+
+    for(auto &ch: s){
+        if(ch=='H' || ch=='Q' || ch=='9'){
+            print=true;
+            break;
+        }
+    }
+
+    if(print) cout<<"YES";
+    else cout<<"NO";
+
+return 0;
+}

competitive programming/codeforces/1452A - Robot Program.cpp

@@ -0,0 +1,126 @@
+/*
+There is an infinite 2-dimensional grid. The robot stands in cell (0,0) and wants to reach cell (x,y). Here is a list of possible commands the robot can execute:
+
+move north from cell (i,j) to (i,j+1);
+move east from cell (i,j) to (i+1,j);
+move south from cell (i,j) to (i,j−1);
+move west from cell (i,j) to (i−1,j);
+stay in cell (i,j).
+The robot wants to reach cell (x,y) in as few commands as possible. However, he can't execute the same command two or more times in a row.
+
+What is the minimum number of commands required to reach (x,y) from (0,0)?
+
+Input
+The first line contains a single integer t (1≤t≤100) — the number of testcases.
+
+Each of the next t lines contains two integers x and y (0≤x,y≤104) — the destination coordinates of the robot.
+
+Output
+For each testcase print a single integer — the minimum number of commands required for the robot to reach (x,y) from (0,0) if no command is allowed to be executed two or more times in a row.
+
+Example
+inputCopy
+5
+5 5
+3 4
+7 1
+0 0
+2 0
+outputCopy
+10
+7
+13
+0
+3
+Note
+The explanations for the example test:
+
+We use characters N, E, S, W and 0 to denote going north, going east, going south, going west and staying in the current cell, respectively.
+
+In the first test case, the robot can use the following sequence: NENENENENE.
+
+In the second test case, the robot can use the following sequence: NENENEN.
+
+In the third test case, the robot can use the following sequence: ESENENE0ENESE.
+
+In the fourth test case, the robot doesn't need to go anywhere at all.
+
+In the fifth test case, the robot can use the following sequence: E0E.
+
+
+*/
+
+
+
+
+
+
+
+
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin>>t;
+    while(t--){
+        int x, y;
+        cin>>x>>y;
+
+        if(x==y) cout<<x+y<<"\n";
+        else {
+            int a=0, b=0;
+            char dir, prev;
+            if(x>y){
+                dir='E';
+                prev='O';
+            } else {
+                dir='N';
+                prev='O';
+            }
+            int step=0;
+
+            while(a<x || b<y){
+                if(dir=='E' && a<x && (prev=='N' || prev=='O')){
+                    a++;
+                    dir='N';
+                    prev='E';
+                    step++;
+                }
+                else if(dir=='N' && b<y && (prev=='E' || prev=='O')){
+                    b++;
+                    dir='E';
+                    prev='N';
+                    step++;
+                } else if(b==y && dir=='N' ){
+                    step++;
+                    prev='O';
+                    dir='E';
+                } else if(a==x && dir=='E'){
+                    step++;
+                    dir='N';
+                    prev='O';
+                }
+
+            }
+
+            cout<<step<<"\n";
+        }
+
+
+    }
+
+
+    return 0;
+}
+
+
+
+