local

Author: mostafa-saad

18-Programming-4kids/10_homework_05_answer.cpp

@@ -1,4 +1,4 @@
-// By Basel Bairkdar https://www.facebook.com/baselbairkdar
+// By Basel Bairkdar https://www.facebook.com/baselbairkdar - modified
 #include<iostream>
 using namespace std;
 
@@ -7,9 +7,6 @@ int main() {
 
 	int n, a[N];
 
-	// let's use some big value and later minimize
-	int mn = 10000000;
-
 	cin >> n;
 	for (int i = 0; i < n; i++)
 		cin >> a[i];
@@ -19,11 +16,16 @@ int main() {
 	 such that i < j
 	 this can be done using nested for loops.
 	 **/
+	// let's use some big value and later minimize
+	int mn;
+	bool first_time = true;
+
 	for (int i = 0; i < n; i++) {
 		for (int j = i + 1; j < n; j++) {
 			int tmp = a[i] + a[j] + j - i;
-			if (tmp < mn) {
+			if (first_time || tmp < mn) {
 				mn = tmp;
+				first_time = false;
 			}
 		}
 	}

18-Programming-4kids/10_homework_07_answer_TODO.cpp

@@ -1,48 +1,24 @@
-// By Amr Fahim https://www.facebook.com/amrfahim2020
-// Homework 7 solution 
 #include <iostream>
-using namespace std ;
+using namespace std;
 
-// We use 2 frequency arrays one for the positive numbers and the other for the negative 
+int main() {
+	int n;
+	cin >> n;
+	const int MAX = 270 + 500 + 1;
+	int frequency[MAX] = { 0 };	// initialize with zeros. You can't do for other values (e.g. 1) this way.
 
-int n , neg_num[500 +10] , pos_num[270 + 10 ]  , max_num , max_freq ;
+	for (int i = 0; i < n; i++) {
+		int value;
+		cin >> value;
 
-int main()
- {
-    cin >> n ;
-    int arr[n] ;
-    
-    for (int i = 0 ; i < n ;i++ )
-    {
-         cin >> arr[i] ; 
-         // Check the sign of the input value 
-         //to know which array we should add the deal with
-         if (arr[i] >= 0 ) 
-         {
-             pos_num[arr[i]]++ ;
+		value += 500;	// shift all values to be positive
+		frequency[value]++;
+	}
 
-         // Comparing the value we have now with the max value  
-            if (pos_num[arr[i]] > max_freq ) 
-            {
-                max_freq = pos_num[arr[i]] ;
-                max_num = arr[i] ;
-                
-            }  
-
-         }
-         else if (arr[i] < 0 ) 
-         {
-             neg_num[arr[i]]++ ;
-
-              // Comparing the value we have now with the max value  
-            if (neg_num[arr[i]] > max_freq )
-            {
-                max_freq = neg_num[arr[i]] ;
-                max_num = arr[i] ;
-            }
-    }
-
-    
-}
-    cout << max_num <<" has repeated " << max_freq <<" times " ;
+	int mx_pos = 0;
+	for (int i = 0; i < MAX; i++) {
+		if (frequency[mx_pos] < frequency[i])
+			mx_pos = i;
+	}
+	cout << mx_pos - 500 << " has repeated " << frequency[mx_pos] << " times ";
 }