Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions exercises/calculator.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -10,3 +10,21 @@
Multiplication: 8
Division: 2
*/

int main() {

float a, b;

printf("inserisci due numeri e ottieni la loro somma, sottrazione, moltiplicazione e divisione\n");

printf("inserisci il primo numero\n");
scanf("%f", &a);
printf("inserisci il secondo numero\n");
scanf("%f", &b);

printf("la loro somma e' %f\n", a + b);
prinf("la loro differenza e' %f\n", a - b);
printf("il loro prodotto e' %f\n", a * b);
if (b == 0) printf("non e' possibile dividere per 0\n");
else printf("la loro divisione e' %f\n", a / b);
}
12 changes: 12 additions & 0 deletions exercises/sum.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -6,3 +6,15 @@
Insert the second number: 2
Sum: 3
*/

int main(){

float a, b;

printf("inserisci due numeri e vedine la somma\n");
scanf("%f", &a);
scanf("%f", &b);

printf("la somma e' %f\n", a+b);
return;
}
20 changes: 17 additions & 3 deletions exercises/verify.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -9,10 +9,24 @@ The number 3 is [not] present in the array.
#include <iostream>
using namespace std;

int main()
{
int main(){

int n, count=0;

// placeholder
int N[10] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
int N[10] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
printf("inserisci un numero intero\n");
scanf("%d", &n);
printf("il numero che hai scelto e' nell'array?\n");

for (int i = 0; i < 10; i++) {
if (N[i] == n) {
printf("il numero %d da te scelto e' nell'array\n", n);
count++;
break;
}
}
if (count == 0) printf("il numero %d da te scelto non e' presente nell'array\n", n);

return 0;
}