Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    lamba
    12 views2 pages
    The document defines functions to check if a number is prime, print prime numbers, and print non-prime numbers. It uses these functions in a program that takes numbers as input, checks each one for primality, counts and prints the prime and non-prime numbers, then prints the totals when a -1 is entered.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines functions to check if a number is prime, print prime numbers, and print non-prime numbers. It uses these functions in a program that takes numbers as input, checks each one for primality, counts and prints the prime and non-prime numbers, then prints the totals when a -1 is entered.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views2 pages

    Untitled

    Uploaded by

    lamba
    The document defines functions to check if a number is prime, print prime numbers, and print non-prime numbers. It uses these functions in a program that takes numbers as input, checks each one for primality, counts and prints the prime and non-prime numbers, then prints the totals when a -1 is entered.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    #include<stdio.

    h>

    int is_prime(int sayi2);


    void print_prime(int sayi3);
    void print_not_prime(int sayi4);

    int main(){

    int sayi;
    int primeCount, notPrimeCount = 0;

    do
    {

    scanf("%d", &sayi);

    if(sayi != -1){

    if(is_prime(sayi) == 1){
    print_prime(sayi);
    primeCount++;
    }else{
    print_not_prime(sayi);
    notPrimeCount++;
    }
    }

    } while (sayi != -1);

    printf("Toplam %d sayi asal, %d sayi asal degildir", primeCount,


    notPrimeCount);

    return 0;
    }

    int is_prime(int sayi2){

    for (int i = 2; i < sayi2; i++)


    {
    if(sayi2 % i == 0){

    return 0;

    }else{

    return 1;
    }
    }

    }
    void print_prime(int sayi3){

    printf("%d sayisi asaldir\n", sayi3);

    void print_not_prime(int sayi4){

    printf("%d sayisi asal degildir\n", sayi4);


    }

    You might also like