Add files via upload

Author: AdityaSeth777

26 - Nested Logic/Solution.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+int main() {
+
+    int Aday, Amonth, Ayear, Eday,Emonth, Eyear;
+    int fine = 0;
+    scanf("%d %d %d %d %d %d", &Aday, &Amonth, &Ayear, &Eday, &Emonth, &Eyear);
+    if (Ayear == Eyear){
+        if (Amonth == Emonth){
+            fine = 15 * (Aday - Eday);
+        }
+        else {
+            fine = 500 * (Amonth - Emonth);
+        }
+    }
+    else if (Ayear > Eyear){
+        fine = 10000;
+    }
+    //Aditya Seth
+    
+    if (fine < 0){
+        fine = 0;
+    }
+    
+    printf("%d", fine);
+    return 0;
+}
+

26 - Nested Logic/Solution.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int da, ma, ya;
+    cin >> da;
+    cin >> ma;
+    cin >> ya;
+
+    int de, me, ye;
+    cin >> de;
+    cin >> me;
+    cin >> ye;
+
+    int fine = 0;
+
+    if (ya > ye) fine = 10000;
+    else if (ya == ye) {
+        if (ma > me) fine = (ma - me) * 500;
+        else if (ma == me && da > de) fine = (da - de) * 15;
+    }
+    //Aditya Seth
+
+    cout << fine;
+}

26 - Nested Logic/Solution.kt

@@ -0,0 +1,29 @@
+package com.example.retrofitdemo
+
+import java.util.Scanner
+
+object Solution {
+    fun main(args: Array<String>) {
+        val `in` = Scanner(System.`in`)
+
+        val da = `in`.nextInt()
+        val ma = `in`.nextInt()
+        val ya = `in`.nextInt()
+
+        val de = `in`.nextInt()
+        val me = `in`.nextInt()
+        val ye = `in`.nextInt()
+
+        var fine = 0
+
+        if (ya > ye)
+            fine = 10000
+        else if (ya == ye) {
+            if (ma > me)
+                fine = (ma - me) * 500
+            else if (ma == me && da > de) fine = (da - de) * 15
+        }
+
+        println(fine)
+    }
+}

26 - Nested Logic/Solution.py

@@ -0,0 +1,18 @@
+actually = list(map(int, input().split()))
+da, ma, ya = actually
+
+expected = list(map(int, input().split()))
+de, me, ye = expected
+
+fine = 0
+
+if ya > ye:
+    fine = 10000
+elif ya == ye:
+    if ma > me:
+        fine = (ma - me) * 500
+    elif ma == me and da > de:
+        fine = (da - de) * 15
+
+#Aditya Seth
+print(fine)

27- Testing/Solution.cpp

@@ -0,0 +1,55 @@
+#include <stdexcept>
+#include <cassert>
+#include <set>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int minimum_index(vector<int> seq) {
+	if (seq.empty()) {
+		throw invalid_argument("Cannot get the minimum value index from an empty sequence");
+	}
+	int min_idx = 0;
+	for (int i = 1; i < seq.size(); ++i) {
+		if (seq[i] < seq[min_idx]) {
+			min_idx = i;
+		}
+	}
+	return min_idx;
+}
+//Aditya Seth
+class TestDataEmptyArray {
+public:
+	static vector<int> get_array() {
+		vector<int> vect{};
+		return vect;
+	}
+
+};
+
+class TestDataUniqueValues {
+public:
+	static vector<int> get_array() {
+		vector<int> vect{ 23,5,8,12,7 };
+		return vect;
+	}
+
+	static int get_expected_result() {
+		return 1;
+	}
+
+};
+
+class TestDataExactlyTwoDifferentMinimums {
+public:
+	static vector<int> get_array() {
+		vector<int> vect{ 9,23,3,8,12,3,7 };
+		return vect;
+	}
+
+	static int get_expected_result() {
+		return 2;
+	}
+
+};

27- Testing/Solution.kt

@@ -0,0 +1,16 @@
+class Solution {
+    fun main(srgs: Array<String>) {
+        println(5)
+        println("4 3")
+        println("0 -3 4 2")
+        println("5 2")
+        println("0 -3 4 2 2")
+        println("3 3")
+        println("0 -3 4")
+        println("7 2")
+        println("0 -3 1 1 1 1 1")
+        println("6 3")
+        println("0 -3 4 2 1 1")
+    }
+   
+}

27- Testing/Solution.py

@@ -0,0 +1,60 @@
+def minimum_index(seq):
+    if len(seq) == 0:
+        raise ValueError("Cannot get the minimum value index from an empty sequence")
+    min_idx = 0
+    for i in range(1, len(seq)):
+        if seq[i] < seq[min_idx]:
+            min_idx = i
+    return min_idx
+
+class TestDataEmptyArray:
+    def get_array():
+        return []
+    
+class TestDataUniqueValues:
+    def get_array():
+        return [1,2,3]
+    def get_expected_result():
+        return 0
+class TestDataExactlyTwoDifferentMinimums:
+    def get_array():
+        return [1,1,3]
+    def get_expected_result():
+        return 0
+ 
+def TestWithEmptyArray():
+    try:
+        seq = TestDataEmptyArray.get_array()
+        result = minimum_index(seq)
+    except ValueError as e:
+        pass
+    else:
+        assert False
+
+
+def TestWithUniqueValues():
+    seq = TestDataUniqueValues.get_array()
+    assert len(seq) >= 2
+
+    assert len(list(set(seq))) == len(seq)
+
+    expected_result = TestDataUniqueValues.get_expected_result()
+    result = minimum_index(seq)
+    assert result == expected_result
+
+
+def TestiWithExactyTwoDifferentMinimums():
+    seq = TestDataExactlyTwoDifferentMinimums.get_array()
+    assert len(seq) >= 2
+    tmp = sorted(seq)
+    assert tmp[0] == tmp[1] and (len(tmp) == 2 or tmp[1] < tmp[2])
+
+    expected_result = TestDataExactlyTwoDifferentMinimums.get_expected_result()
+    result = minimum_index(seq)
+    assert result == expected_result
+
+TestWithEmptyArray()
+TestWithUniqueValues()
+TestiWithExactyTwoDifferentMinimums()
+print("OK")
+#Aditya Seth