1 raspuns

1. 

   Menim Suport

   2021-02-16T22:00:35+02:00Pe 16 februarie 2021

   #include #include using namespace std; bool prime(int number, int primes[]) { if (primes[number] == 1) return true; if (number % 2 == 0) return false; for (int i = 3; i > m >> n; int a[m][n], p = max(m, n), primes[p]; primes[0] = 0; primes[1] = 0; primes[2] = 1; for (int i = 0; i < m; i++) for (int j = 0; j > a[i][j]; int s1 = 0, s2 = 0; for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { if ((i + 1) % a[i][j] == 0) s1 += a[i][j]; if (prime(i + 1, primes) && prime(j + 1, primes)) s2 += a[i][j]; } cout << s1 << " " << s2; }

   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

   #include #include using namespace std;   bool prime(int number, int primes[]) {     if (primes[number] == 1)         return true;     if (number % 2 == 0)         return false;     for (int i = 3; i > m >> n;     int a[m][n], p = max(m, n), primes[p];     primes[0] = 0;     primes[1] = 0;     primes[2] = 1;     for (int i = 0; i < m; i++)         for (int j = 0; j > a[i][j];       int s1 = 0, s2 = 0;     for (int i = 0; i < m; i++)         for (int j = 0; j < n; j++)         {             if ((i + 1) % a[i][j] == 0)                 s1 += a[i][j];             if (prime(i + 1, primes) && prime(j + 1, primes))                 s2 += a[i][j];         }       cout << s1 << " " << s2; }

   • 0

   • Raspunde