Thursday, 15 April 2010

c++ - Debugging program to list the user's choice amount of emirp numbers (prime numbers also prime in reverse) -



c++ - Debugging program to list the user's choice amount of emirp numbers (prime numbers also prime in reverse) -

this programme class. required utilize 2 functions. these 3 errors listed:

error c2601: 'isprime' : local function definitions illegal error c2601: 'reverse' : local function definitions illegal error c1075: end of file found before left brace '{' @ e.

any other help , tips appreciate. thanks!

/* * 2/07/2013 * computer science ii * homework #1 */ //purpose: display first 'n' (user chosen) number if emirps console, 5 per line. //note: "emirp" prime number prime when reversed. #include <iostream> using namespace std; int isprime(int value); //prototyle "prime number function" int reverse (int value2); //prototype "emirp function" int main() { //ask user positive number come in code here`enter code here`cout << "please come in positive number: "; int n; cin >> n; //reject negative value input if ( n < 1) { cout << "invalid number \n"; } else //calculate emirps 'n'. (int test = 0; test < n; test++) { int number = 2; if (isprime(number)) { cout << "\n" << reverse(number) << "\t\t\t"; } } homecoming 0; } int isprime(int value) { //if value prime, remainder (count) 0 twice--for 1 , itself. int divisor = 1; int count = 0; int prime = 0; if (value % divisor == 0) { count++; ++divisor; } if (count = 2) { int prime = value; //store prime value in new variable } homecoming prime; } int reverse(int value2) { //reverse number value2*=10; value2 = value2 %10; value2/=10; //same procedure prime function int divisor2 = 1; int count2 = 0; int emirp = 0; if (value2 % divisor2 == 0) { { count2++; ++divisor2; } if (count2 = 2) { int emirp = value2; } } homecoming emirp; }

problem syntax in reverse function :

//same procedure prime function int divisor2 = 1; int count2 = 0; int emirp = 0; if (value2 % divisor2 == 0) {//if {// ? why count2++; ++divisor2; }//if

c++ compiler-errors primes

No comments:

Post a Comment