#include<stdio.h> int main(){ int i,j,m; int N; scanf("%d",&N); for(i=2;i<N;i++){ for(j=2;j<=i;j++){ m=i%j; if(j==i)printf("%d\n",i); else if(m==0) break; } }}
#include <stdio.h> int main() { int n,x=0,a=0,maxsize=100; int s[maxsize]; scanf("%d",&n); for(int p=2;p<=n;p++){ for (int i=2;i<=p;i++){ if (p%i==0) a++; } if (a==1){ s[x]=p; x++; } a=0; } for (int k=0;k<x;k++){ printf("%d\n",s[k]); } return 0; }
#include<stdio.h> int main() { int n=2,n1=2,n2=0,s; scanf("%d", &s); while (n <= s) { while (n1>=2&&n1<=n) { if (n % n1 == 0 && n != n1) { n2++; } if (n% n1 == 0 && n == n1&&n2<1) { printf("%d\n", n); n1 = 1; } else n1++; } n2 = 0; n1 = 2; n++; } return 0; } 暴力破解