Scribd Logo
Upload

Welcome to Scribd!

  • Le PGCD

    Uploaded by

    YounesSherlock
    20 views1 page
    This C code defines a function called pgcd that calculates the greatest common divisor (GCD) of two long integers a and b using the Euclidean algorithm. It takes a and b as inputs, repeatedly divides the larger by the remainder of the larger divided by the smaller until the remainder is 0, then returns the last non-zero remainder as the GCD. The main function prompts the user to input two integers, calls the pgcd function on them and prints the result.

    Original Description:

    Original Title

    LE PGCD

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    RTF, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C code defines a function called pgcd that calculates the greatest common divisor (GCD) of two long integers a and b using the Euclidean algorithm. It takes a and b as inputs, repeatedly divides the larger by the remainder of the larger divided by the smaller until the remainder is 0, then returns the last non-zero remainder as the GCD. The main function prompts the user to input two integers, calls the pgcd function on them and prints the result.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as RTF, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    20 views1 page

    Le PGCD

    Uploaded by

    YounesSherlock
    This C code defines a function called pgcd that calculates the greatest common divisor (GCD) of two long integers a and b using the Euclidean algorithm. It takes a and b as inputs, repeatedly divides the larger by the remainder of the larger divided by the smaller until the remainder is 0, then returns the last non-zero remainder as the GCD. The main function prompts the user to input two integers, calls the pgcd function on them and prints the result.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as RTF, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Le PGCD

    #include <stdio.h> #include <stdlib.h> #include <string.h> long pgcd (long a, long b) { long r; while (b > 0) { r = a % b; a = b; b = r; } return a;

    } int main() { int a,b; printf("donnez deux nombres :"); scanf("%d %d",&a,&b); printf("le pgcd est : %d",pgcd(a,b)); return 0; }

    You might also like