C/C++ i need help in making a program

[simoncpu]

---

@Tin_Tin: You need not do a search from y to x in order to test for primality. y to x / 2 would be sufficient (if q is very large, you may need to google for more efficient deterministic or probabilistic algos). Also, there's a bug that limits the output to the first two factors of the first composite number. =)

[ simon.cpu ]

[ren]

Hoy simon, panudlo pud uyy....!

[Nymph]

@Tin_Tin: You need not do a search from y to x in order to test for primality. y to x / 2 would be sufficient (if q is very large, you may need to google for more efficient deterministic or probabilistic algos). Also, there's a bug that limits the output to the first two factors of the first composite number. =)

[ simon.cpu ]

@simoncpu... i completely agree with u. and i especially liked that "no pain, no glory" part and another thing... altho naa ang solution, but much better if it's fast and efficient

[krisnk]

bai bisayaa ang program!! kay libog ok ra?? and ok ra if algo ako ihatag?

[jerx d great]

#include<stdio.h>
void main(){

int num = 0;
int input[100];
int x;

printf("How many numbers do you want to input?");
scanf("%d",&num);

for(x =0; x<num; x++){

printf("Enter [%d] number:",x + 1);
scanf("%d",&input[x]);

}

printf("\nThe prime Number are:\n\n");
for(x=0; x<num; x++){
if(input[x]%2 != 0){
printf("%d\n",input[x]);
}
}
}

kana nga program kompleto na jud na!! hasta na pag input!! hehehehe

[spikes]

printf("\nThe prime Number are:\n\n");
for(x=0; x<num; x++){
if(input[x]%2 != 0){
printf("%d\n",input[x]);
}
}

bai mura di man na prime numbers imo pasabot, mura odd numbers man.

a prime number is a natural number that has exactly two (distinct) natural number divisors, which are 1 and the prime number itself.

[menatsu]

number is the range of numbers

example if you want to know the prime numbers from 1 to 100, number should be equal to 100

for(int x=1; x<number; x++)
{
for(int y=1; y < x; y++)
{
if(y%x)
break;
}

if(y == x)
printf("%d is a prime number", x);

}

try daw ni....

[spikes]

    for(int x=1; x<number; x++)
    {
        factor = 0;
        for(int y=1; y <=x/2; y++)
        {
           if((x%y)==0)
            factor++;
           
           if(factor>1)
            break;
         
        }
      
        if(factor==1)
            printf("%d is a prime number", x);
    }

try ni cya.

[mE_bytes]

ok na bro...

kanang sa conversion of dates into roman numerals..

kbaw mo?!?!?

[doomsweek]

ah grabeh. wa kay nakat.unan ni sir cayacap?? wahaha

OT: musta na kim? balik na diri cebu oi