void nummaker(int now,int n) { if(flag) return; if(((n & 1) == 1) && (now == n / 2 + 2)) { int ans = combine(n); if(ifprime(ans) && ifin(ans)) fprintf(out,"%d\n",ans); return; } if(((n & 1) == 0) && (now == n / 2 + 1)) { int ans = combine(n); if(ifprime(ans) && ifin(ans)) fprintf(out,"%d\n",ans); return; } int i; for(i = 0;i <= 9;i++) { if(now == 1) if(i == 0 || ((i & 1) == 0)) continue; num[now] = i; num[n - now + 1] = i; nummaker(now + 1,n); } }
int main() { int rank,i=2,j,count=0,temproot,flag; // printf("Enter the rank: "); // scanf("%d",&rank); rank=10001; while(1) { if(ifprime(i)) { count++; if(count==rank) { printf("%d\n",i); break; } } if(i==2) i++; else i+=2; } }
int main() { int n,result=1,i,count; printf("Enter the number\n"); scanf("%d",&n); for(i=2;i<=n;i++) { if(!ifprime(i)) continue; count=1; while( (test=(int)pow(i,count)) <=n ) count++; result*=(int)pow(i,count-1); } printf("%d\n",result); return 0; }