检查斐波那契素数的项数

Question

我基本上完成了这个，唯一的问题是当它循环检查素数时，它也会打印出不在斐波那契数列中的素数。这是我的代码:

int main()
{
  int no1,no2,newno,pno,i,terms,j;
  no1 = 0;
  no2 = 1;


  printf("**Fibonacci and Prime Numbers**\n\n");
  printf("Enter number of terms: \n");
  scanf("%d", &terms);

  printf("\nAmong the first %d terms of Fibonacci series that are also prime number: \n", terms);

  for(i=0; i<terms; i++){
    if(i<=no2){
        newno = i;
    }
    else{
        newno = no1+no2;
        no1 = no2;
        no2 = newno;
    }
  }

  for(pno=2;pno<=newno;pno++){
    for(j=2;j<=pno;j++){
        if(pno%j==0){
            break;
        }
    }
    if(pno==j){
        printf("%d \n", pno);
    }
  }


  getch();
  return 0;
}

我猜是因为 pno++ ，我对吗？

Answer 1

试试这个

for(i=0; i<terms; i++){

 newno = no1+no2;
 no1 = no2;
 no2 = newno;

 for(j=2;j<=newno;j++){
    if(newno%j==0){
        break;
    }
 }
 if(newno==j){
    printf("%d prime\n", newno);
 }
}