Computer Assignment 2

Author: daniel-saeedi

.DS_Store

@@ -21,7 +21,7 @@ def read_input() :
 def find_gcd_max(n,k,bags,biggest_bag) :
     gcd_max = 1
     add_to_bags = [0]*n
-    for gcd in range(2,biggest_bag+1) :
+    for gcd in range(2,biggest_bag+k+1) :
         for idx,bag in enumerate(bags) :
             remainder = bag%gcd
             x = 0

CA1/.DS_Store

@@ -0,0 +1,21 @@
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "g++-10 - Build and debug active file",
+            "type": "cppdbg",
+            "request": "launch",
+            "program": "${fileDirname}/${fileBasenameNoExtension}",
+            "args": [],
+            "stopAtEntry": false,
+            "cwd": "${workspaceFolder}",
+            "environment": [],
+            "externalConsole": false,
+            "MIMode": "lldb",
+            "preLaunchTask": "C/C++: g++-10 build active file"
+        }
+    ]
+}

CA1/Archive.zip

@@ -0,0 +1,51 @@
+{
+    "files.associations": {
+        "initializer_list": "cpp",
+        "vector": "cpp",
+        "iostream": "cpp",
+        "cmath": "cpp",
+        "array": "cpp",
+        "atomic": "cpp",
+        "bit": "cpp",
+        "*.tcc": "cpp",
+        "cctype": "cpp",
+        "clocale": "cpp",
+        "compare": "cpp",
+        "complex": "cpp",
+        "concepts": "cpp",
+        "cstdarg": "cpp",
+        "cstddef": "cpp",
+        "cstdint": "cpp",
+        "cstdio": "cpp",
+        "cstdlib": "cpp",
+        "cwchar": "cpp",
+        "cwctype": "cpp",
+        "deque": "cpp",
+        "unordered_map": "cpp",
+        "exception": "cpp",
+        "algorithm": "cpp",
+        "functional": "cpp",
+        "iterator": "cpp",
+        "memory": "cpp",
+        "memory_resource": "cpp",
+        "numeric": "cpp",
+        "optional": "cpp",
+        "random": "cpp",
+        "string": "cpp",
+        "string_view": "cpp",
+        "system_error": "cpp",
+        "tuple": "cpp",
+        "type_traits": "cpp",
+        "utility": "cpp",
+        "iosfwd": "cpp",
+        "istream": "cpp",
+        "limits": "cpp",
+        "new": "cpp",
+        "ostream": "cpp",
+        "ranges": "cpp",
+        "sstream": "cpp",
+        "stdexcept": "cpp",
+        "streambuf": "cpp",
+        "typeinfo": "cpp"
+    }
+}

CA1/Question1.py

@@ -0,0 +1,27 @@
+{
+    "tasks": [
+        {
+            "type": "cppbuild",
+            "label": "C/C++: g++-10 build active file",
+            "command": "/usr/local/bin/g++-10",
+            "args": [
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}/${fileBasenameNoExtension}"
+            ],
+            "options": {
+                "cwd": "${workspaceFolder}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "detail": "Task generated by Debugger."
+        }
+    ],
+    "version": "2.0.0"
+}

CA2/.DS_Store

@@ -0,0 +1,115 @@
+#include<iostream>
+#include <utility>
+#include <vector>
+#include <cstdlib>
+using namespace std;
+
+struct MaxHeap
+{
+    vector<int> data;
+    MaxHeap()
+    {
+        data.push_back(0);
+    }
+    void insert(int value)
+    {
+        data.push_back(value);
+        int current = data.size()-1;
+        while(current != 1)
+        {
+            if(data[current] > data[current >> 1])
+            {
+                swap(data[current], data[current >> 1]);
+                current >>= 1;
+            }
+            else break;
+        }
+    }
+    void pop()
+    {
+        if(data.size() == 1) return;
+        swap(data[1], data[data.size()-1]);
+        data.pop_back();
+        int current = 1;
+        while(current < data.size())
+        {
+            int largest = current;
+            if((current << 1) < data.size() && data[current << 1] > data[largest])
+            {
+                largest = current << 1;
+            }
+            if((current << 1) + 1 < data.size() && data[(current << 1) + 1] > data[largest])
+            {
+                largest = (current << 1) + 1;
+            }
+            if(largest != current)
+            {
+                swap(data[current], data[largest]);
+                current = largest;
+            }
+            else break;
+        }
+    }
+    int top()
+    {
+        return data[1];
+    }
+    bool empty()
+    {
+        return data.size() <= 1;
+    }
+};
+
+class War
+{
+public:
+	War()
+	{
+		MaxHeap attack_priorities = MaxHeap();
+		min_moves = 0;
+
+	}
+
+	void read_input()
+	{
+		cin >> n;
+		cin >> z;
+		cin >> k;
+		for(int i = 0;i < n;i++)
+		{
+			int power;
+			cin >> power;
+			attack_priorities.insert(power);
+		}
+	}
+
+	void start()
+	{
+		while(z > 0 && min_moves < k)
+		{
+			int biggest_power = attack_priorities.top();
+			attack_priorities.pop();
+			z -= biggest_power;
+			attack_priorities.insert(biggest_power/2);
+			min_moves++;
+		}
+
+		if(z <= 0 && min_moves <= k)
+			cout << min_moves << endl;
+		else
+			cout << -1 << endl;
+	}
+private:
+	MaxHeap attack_priorities;
+	long int n;
+	long int z;
+	long int k;
+	long int min_moves;
+};
+int main()
+{
+	War war = War();
+	war.read_input();
+	war.start();
+	return 0;
+}

CA2/.vscode/launch.json

@@ -0,0 +1,56 @@
+class Link:
+    def __init__( self, start, end ):
+        self.start = start
+        self.end = end
+
+
+def count_subarrys(arr,l) :
+    count = {}
+    links = [None] * l
+
+    for i in sorted(range(0,l),key = lambda i: int(arr[i])):
+        link_previous = links[i - 1] if i > 0 else None
+        link_next = links[i + 1] if i < (l - 1) else None
+
+        start = link_previous.start if link_previous else i
+        end = link_next.end if link_next else i
+
+        links[i] = Link( start, end )
+
+        if link_previous:
+            links[link_previous.start].end = end
+
+        if link_next:
+            links[link_next.end].start = start
+        number = int(arr[i])
+        if not number in count.keys() : 
+            count[number] = (1 + i - start) * (1 + end - i)
+        else :
+            count[number] += (1 + i - start) * (1 + end - i)
+    
+    return count
+    
+
+def cin() :
+    string = input().strip()
+    while string == "" :
+        string = input().strip()
+    return string
+
+def main() :
+    n,q = input().split()
+    n = int(n)
+    q = int(q)
+    numbers = input().split()
+    req = []
+    while q > 0 :
+        q -= 1
+        req.append(int(input()))
+    # count = count_subarrys(numbers,n)
+    # for i in req :
+    #     if not i in count.keys() : 
+    #         print(0)
+    #     else :
+    #         print(count[i])
+
+main()