2 raspunsuri

1. 

   Best Answer

   Menim Suport

   2020-12-19T14:08:54+02:00Pe 19 decembrie 2020

   Raspuns editat.

   Am incarcat codul aici.

   #include <iostream> using namespace std; bool isPrime(int n) { if (n == 0 || n == 1) return false; if (n == 2) return true; for (int i = 3; i < n / 2 + 1; i++) if (n % i == 0) return false; return true; } int main() { int n; cin >> n; int v[n]; for (int i = 0; i < n; i++) cin >> v[i]; for (int i = 0; i < n; i++) { if (isPrime(v[i])) { n--; for (int j = i; j < n; j++) v[j] = v[j + 1]; } } for (int i = 0; i < n; i++) cout << v[i] << " "; }

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

   #include <iostream> using namespace std;   bool isPrime(int n) {     if (n == 0 || n == 1)         return false;     if (n == 2)         return true;     for (int i = 3; i < n / 2 + 1; i++)         if (n % i == 0)             return false;     return true; }   int main() {     int n;     cin >> n;     int v[n];     for (int i = 0; i < n; i++)         cin >> v[i];       for (int i = 0; i < n; i++)     {         if (isPrime(v[i]))         {             n--;             for (int j = i; j < n; j++)                 v[j] = v[j + 1];         }     }       for (int i = 0; i < n; i++)         cout << v[i] << " "; }

   • 1

   • Raspunde
2. 

   nn7160082 user (0)

   2020-12-19T17:03:28+02:00Pe 19 decembrie 2020

   Mulțumesc!

   • 0

   • Raspunde