Here is my code #include <iostream> #include <cmath> using namespace std;
int primejudge (int n);
int main(){ int n , c; while ((cin >> n >> c) && n >=1 && n <= 1000 && c >= 1 && c <= n){ int prime[n] , primeaddress; if (n == 1){ prime[0] = 1; primeaddress = 1; } else if (n == 2){ prime ...