Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int isPrimeNumber(int number) {
- if(number < 2)
- return 0;
- if(number % 2 == 0 && number > 2)
- return 0;
- int i, j;
- for(i = 3; i < number / 2; i += 2) {
- if(number % i == 0) {
- return 0;
- }
- }
- return 1;
- }
- int main() {
- int K[10];
- int i;
- for(i = 0; i < 10; i++) {
- printf("Insira o valor de K[%d]: ", i);
- scanf("%d", &K[i]);
- }
- printf("\n");
- int P[10], tamanhoP = 0;
- for(i = 0; i < 10; i++) {
- printf("K[%d] = %d\n", i, K[i]);
- if(isPrimeNumber(K[i])) {
- P[tamanhoP++] = K[i];
- }
- }
- printf("\n");
- for(i = 0; i < tamanhoP; i++) {
- printf("P[%d] = %d\n", i, P[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement