Merge pull request #14 from mairohanhoon/main

ADDED WEEKEND CONTEST 94

Author: mairohanhoon

Weekend_Contest/Contest_94/Good_Partation.cpp

@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int goodPartition(int n, vector<int> v) {
+    // Write your code here.
+    sort(v.begin(), v.end());
+    if(n == 2){
+        if(v[0] != v[1]){
+            return 1;
+        }
+        else{
+            return 0;
+        }
+    }
+    else{
+        if(v[v.size()/2] != v[(v.size()/2)-1]){
+            return 1;
+        }
+        else{
+            return 0;
+        }
+    }
+}
+
+int main(){
+
+    vector<int> v = {1, 3, 2, 2};
+    int n = 4;
+
+    cout << goodPartition(n, v);
+
+    return 0;
+}

Weekend_Contest/Contest_94/Joe_and_Cheese_Cake.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int joeAndCheeseCake(int n, int m) {
+	// Write your code here.
+	if(n%m == 0){
+		return n/m;
+	}
+	else{
+		return (n/m)+1;
+	}
+}
+int main(){
+
+    int n = 5;
+    int m = 3;
+
+    cout << joeAndCheeseCake(n, m);
+
+    return 0;
+}

Weekend_Contest/Contest_94/Prime_Reverse_Prime.cpp

@@ -0,0 +1,44 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int primeReversePrime(int l, int r) {
+    // Write your code here.
+    int x = l;
+    int count = 0;
+    while(x<=r){
+        int rev = 0;
+        int temp = x;
+        while(temp!=0){
+            rev = (rev*10)+temp%10;
+            temp/=10;
+        }
+        temp = x;
+        int check1 = 0;
+        for(int i=1; i<=temp; i++){
+            if(temp%i == 0){
+                check1++;
+            }
+        }
+        int check2 = 0;
+        for(int i=1; i<=rev; i++){
+            if(rev%i == 0){
+                check2++;
+            }
+        }
+        if(check1 == 2 && check2 == 2){
+            count++;
+        }
+        x++;
+    }
+    return count;
+}
+
+int main(){
+
+    int l = 4;
+    int r = 10;
+
+    cout << primeReversePrime(l, r);
+
+    return 0;
+}