From 90bb5335d2545a376efe6fab1055d4db76b0c236 Mon Sep 17 00:00:00 2001
From: Biagiocu99 <uni396500@studium.unict.it>
Date: Thu, 19 Oct 2023 15:17:12 +0200
Subject: [PATCH 1/2] feat:Implementazione Risiko

---
 exercises/risk-risiko.cpp | 83 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 83 insertions(+)

diff --git a/exercises/risk-risiko.cpp b/exercises/risk-risiko.cpp
index 3166f05..b608fe1 100644
--- a/exercises/risk-risiko.cpp
+++ b/exercises/risk-risiko.cpp
@@ -27,3 +27,86 @@
   M 3 vs 3 => blue win
   O 2 vs 1 => red win
 */
+#include <iotream>
+#include <algorithm>
+#include <cstdlib>d
+#include <ctime>
+
+using namespace std;
+
+
+
+void compare()
+{
+    int dim=3;
+    int attack_dice[dim];
+    int defend_dice[dim];
+    srand(static_cast<unsigned int>(time(nullptr)));
+
+    cout<<"Dadi di attacco:"<<endl;
+
+    for(int i=0;i<dim;i++)
+   {
+        attack_dice[i] = rand() % 6+1; // Genera numeri casuali tra 1 e 6.
+        cout <<attack_dice[i]<< endl;
+        
+   }
+
+    cout<<"Dadi di difesa:"<<endl;
+
+    for(int i=0;i<dim;i++)
+    {
+        defend_dice[i]=rand()%6+1;
+        cout<< defend_dice[i]<<endl;
+    }
+
+    sort(attack_dice, attack_dice + dim, greater<int>());
+    sort(defend_dice, defend_dice + dim, greater<int>());
+    cout<<endl;
+    for(int i=0;i<dim;i++){
+           if(attack_dice[i]<=defend_dice[i])
+           {
+            cout<<attack_dice[i]<<"vs"<<defend_dice[i]<<"   Win Blue   
+            cout<<endl;
+           }
+           else
+           {
+            cout<<attack_dice[i]<<"vs"<<defend_dice[i]<<"   Win Red
+            cout<<endl;
+
+           }
+
+    }
+
+}
+
+void gioca_ancora()
+{
+    bool gioca_ancora=true;
+    int x;
+
+    while(gioca_ancora==true)
+    {
+    cout<<"Vuoi giocare ancora? (se si premi 1 se no premi 0)"<<endl;
+    cin>>x;
+     if(x==1)
+     {
+        compare();
+     }
+     else if(x==0)
+     {
+        gioca_ancora=false;
+        cout<<"Esci!"<<endl;
+
+     }
+    }
+    
+}
+
+int main() 
+{
+ compare();
+ gioca_ancora();
+
+    return 0;
+}

From 77955b68a19814a42b3b6fef0bb2076fe5d9e5aa Mon Sep 17 00:00:00 2001
From: Biagiocu99 <uni396500@studium.unict.it>
Date: Thu, 19 Oct 2023 17:01:33 +0200
Subject: [PATCH 2/2] feat:Implementazione verify

---
 exercises/verify2.cpp | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 exercises/verify2.cpp

diff --git a/exercises/verify2.cpp b/exercises/verify2.cpp
new file mode 100644
index 0000000..61a1293
--- /dev/null
+++ b/exercises/verify2.cpp
@@ -0,0 +1,42 @@
+#include <iostream>
+using namespace std;
+
+
+void verify()
+{
+  int x;
+ 
+  int count=0;
+  int N[10] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
+
+  cout<<"Inserisci il numero da verificare all'interno dell'array:  ";
+  cin>>x;
+  cout<<endl;
+
+  for(int i=0;i<10;i++)
+  {
+    if(x==N[i])
+    {
+      
+      count++;
+
+    }
+    
+     
+  }
+
+  cout<<"Il valore  "<<x<<" è presente "<<count<<"  volte nell'array "<<endl;
+
+}
+
+int main()
+{
+  // placeholder
+  //int N[10] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
+
+  verify();
+
+
+
+  return 0;
+}