Nested calls, 0-200-40 square root of a prime, I was a little white, hope you help me to answer it

CodePudding user response:

Should count, a cycle can be

CodePudding user response:

Nested calls shrimp

CodePudding user response:

int num=0;//the number of primes
for(int i=0; I<200; I++)
{
If (//is a prime number)
{
num++;
}
If (num==40)
{
The square root of//output I
}
}
Like this?