Adding primes in a sequence in C++ -



Adding primes in a sequence in C++ -

possible duplicate: adding primes in sequence in c++

consider n sequence of positive integers n, calculate sum of numbers of sequences cousins.

how do that? tried next code failed:

#include <iostream> using namespace std; int main() { int n, i, j, numero = 0, primo = 0, soma = 0; cout << "digite um numero: "; cin >> n; (i = 0; < n; i++) { cin >> numero; (j = 1; j < n; j++) cout << " numero " << numero << endl; { if (numero %j == 0) primo ++; cout << "primo" << primo << endl; } if (primo == 2) { soma = soma + numero; cout << " numero " << numero << endl; cout << "soma" << soma << endl; } } cout << soma << endl; homecoming 0; }

#include <iostream> using namespace std; int is_prime(int number) { int i; (i=2; i<number; i++) { if (number % == 0 && != number) homecoming 0; } homecoming 1; } int main() { int n, i, j, numero = 0, primo = 0, soma = 0; cout << "digite um numero: "; cin >> n; (i = 0; < n; i++) { cin >> numero; if (is_prime(numero)) { soma = soma + numero; cout << " numero " << numero << endl; cout << "soma" << soma << endl; } } cout << soma << endl; homecoming 0; }

c++

Comments

Popular posts from this blog

delphi - blogger via idHTTP : error 400 bad request -

c++ - compiler errors when initializing EXPECT_CALL with function which has program_options::variables_map as parameter -

How do I check if an insert was successful with MySQLdb in Python? -