Initial commit

Author: phoenixx1

Logical-Questions/CheatingExam.cpp

@@ -0,0 +1,89 @@
+//author @Nishant
+/*
+IAMSMARTERTHANYOU
+IE U
+ATRO
+MRTY
+SAHN
+M A
+*/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin >> n;  
+    string encoded;
+    cin >> encoded;
+  	if(encoded.length() <= 0 || n<=0){
+    	return 0;
+  	}
+    if(n==1){
+        cout << encoded;
+        return 0;
+    }
+    int len = (encoded.length()-1)/(n-1);
+    if(len%2 != 0){
+    	len += 1;
+    }
+    char code[n][len];
+    int k = 0;
+    for(int i=0; i<n; i++){
+        for(int j=0; j<len; j++){
+            if(i==0 && j==0){
+                code[i][i] = encoded.at(k++);
+            }
+            if(i==0 && j>0){
+                if(j%2!=0){
+                    code[i][j] = encoded.at(k++);
+                }
+            }
+            if(i>0 && i<n-1){
+                code[i][j] = encoded.at(k++);
+            }
+            if(i==n-1){
+                if(j%2 == 0){
+                    code[i][j] = encoded.at(k++);
+                }
+            }
+        }
+    }
+    // for(int i=0;i<n;i++){
+    //      cout << endl;
+    //      for(int j=0;j<len;j++)
+    //          cout << code[i][j] << "\t";
+    // }
+    vector<char> ans;
+    for(int j=0; j<len; j++){           
+        if(j%2==0){
+            if(j==0){
+                for(int i=0; i<n; i++){
+                    //if(code[i][j]!='X' && (code[i+1][j]!='X' || code[i][j+1]!='X')){
+                    //if(code[i][j]!='X'){
+                        ans.push_back(code[i][j]);
+                    //}
+                }
+            }else{
+                for(int i=1; i<n; i++){
+                    //if(code[i][j]!='X'){
+                        ans.push_back(code[i][j]);
+                    //}
+                }
+            }
+        }else{
+            for(int i=n-2; i>=0; i--){
+                //if(code[i][j]!='X'){
+                    ans.push_back(code[i][j]);
+                //}
+            }
+        }
+    }
+    int temp = ans.size()-1;
+    while(ans.at(temp) == 'X'){
+        temp--;
+    }
+    for(int i=0; i<=temp; i++){
+        cout << ans.at(i);
+    }
+}

Logical-Questions/ConcatenatingPrimes.cpp

@@ -0,0 +1,54 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+void printPrime(int n);
+bool isPrime(int n);
+unsigned int combination(unsigned int a, unsigned int b);
+
+int main(){
+    int n;
+    cin >> n;
+    printPrime(n);
+    return 0;
+}
+
+bool isPrime(int n){
+    if (n <= 1) 
+        return false; 
+    for (int i = 2; i < n; i++) 
+        if (n % i == 0) 
+            return false; 
+    return true; 
+} 
+
+unsigned int combination(unsigned int a, unsigned int b){
+    unsigned int x = 10;
+    while(b >= x)
+        x *= 10;
+    return a * x + b;
+}
+
+void printPrime(int n){ 
+    vector<int> primes;
+    for (int i = 2; i <= n; i++){ 
+        if (isPrime(i)) 
+            primes.push_back(i); 
+    }
+    int totalN = primes.size();
+    set<int> combo;
+    for(int i=0; i<totalN; i++){
+        int x = primes.at(i);
+        for(int j=i+1; j<totalN; j++){
+            int y = primes.at(j);
+            int xy = combination(x, y);
+            int yx = combination(y, x);
+            if(isPrime(xy)){
+                combo.insert(xy);
+            }
+            if(isPrime(yx)){
+                combo.insert(yx);
+            }
+        }
+    }
+    cout << combo.size();
+} 

Logical-Questions/PalindromeNum.cpp

@@ -0,0 +1,20 @@
+//author @Nishant 
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int countPalindrome(int n){
+    int x = pow(10, (n-1)/2); 
+    return (9 * x); 
+}
+
+int main(){
+    int n;
+    cin >> n;
+    int sum = 0;
+    for(int i=1; i<=n; i++){
+        sum += countPalindrome(i);
+    }
+    cout << sum;
+    return 0;
+}