Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Example 1: Program To Print Half Pyramid Using

    Uploaded by

    subasree
    The document provides 10 examples of C programs that print various patterns using characters, numbers, and asterisks. It also includes examples to find the greatest common divisor of two numbers using recursion and to count the digits in an integer. The programs demonstrate the use of for loops and while loops to iterate through patterns and solve problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Example 1: Program To Print Half Pyramid Using

    Uploaded by

    subasree
    20 views10 pages
    The document provides 10 examples of C programs that print various patterns using characters, numbers, and asterisks. It also includes examples to find the greatest common divisor of two numbers using recursion and to count the digits in an integer. The programs demonstrate the use of for loops and while loops to iterate through patterns and solve problems.

    Original Description:

    it is c programs

    Original Title

    c Program

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides 10 examples of C programs that print various patterns using characters, numbers, and asterisks. It also includes examples to find the greatest common divisor of two numbers using recursion and to count the digits in an integer. The programs demonstrate the use of for loops and while loops to iterate through patterns and solve problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    20 views10 pages

    Example 1: Program To Print Half Pyramid Using

    Uploaded by

    subasree
    The document provides 10 examples of C programs that print various patterns using characters, numbers, and asterisks. It also includes examples to find the greatest common divisor of two numbers using recursion and to count the digits in an integer. The programs demonstrate the use of for loops and while loops to iterate through patterns and solve problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 10

    Example 1: Program to print half pyramid using *

    *
    * *
    * * *
    * * * *
    * * * * *

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, j, rows;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=1; i<=rows; ++i)


    {
    for(j=1; j<=i; ++j)
    {
    printf("* ");
    }
    printf("\n");
    }
    return 0;
    }

    Example 2: Program to print half pyramid a using numbers

    1
    1 2
    1 2 3
    1 2 3 4
    1 2 3 4 5

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, j, rows;

    printf("Enter number of rows: ");


    scanf("%d",&rows);
    for(i=1; i<=rows; ++i)
    {
    for(j=1; j<=i; ++j)
    {
    printf("%d ",j);
    }
    printf("\n");
    }
    return 0;
    }

    Example 3: Program to print half pyramid using alphabets

    A
    B B
    C C C
    D D D D
    E E E E E

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, j;
    char input, alphabet = 'A';

    printf("Enter the uppercase character you want to print in


    last row: ");
    scanf("%c",&input);

    for(i=1; i <= (input-'A'+1); ++i)


    {
    for(j=1;j<=i;++j)
    {
    printf("%c", alphabet);
    }
    ++alphabet;

    printf("\n");
    }
    return 0;
    }

    Programs to print inverted half pyramid using * and numbers


    Example 4: Inverted half pyramid using *

    * * * * *
    * * * *
    * * *
    * *
    *

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, j, rows;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=rows; i>=1; --i)


    {
    for(j=1; j<=i; ++j)
    {
    printf("* ");
    }
    printf("\n");
    }

    return 0;
    }

    Example 5: Inverted half pyramid using numbers

    1 2 3 4 5
    1 2 3 4
    1 2 3
    1 2
    1

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, j, rows;
    printf("Enter number of rows: ");
    scanf("%d",&rows);

    for(i=rows; i>=1; --i)


    {
    for(j=1; j<=i; ++j)
    {
    printf("%d ",j);
    }
    printf("\n");
    }

    return 0;
    }

    Programs to display pyramid and inverted pyramid using * and digits

    Example 6: Program to print full pyramid using *

    *
    * * *
    * * * * *
    * * * * * * *
    * * * * * * * * *

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, space, rows, k=0;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=1; i<=rows; ++i, k=0)


    {
    for(space=1; space<=rows-i; ++space)
    {
    printf(" ");
    }

    while(k != 2*i-1)
    {
    printf("* ");
    ++k;
    }

    printf("\n");
    }

    return 0;
    }

    Example 7: Program to print pyramid using numbers

    1
    2 3 2
    3 4 5 4 3
    4 5 6 7 6 5 4
    5 6 7 8 9 8 7 6 5

    Source Code

    #include <stdio.h>
    int main()
    {
    int i, space, rows, k=0, count = 0, count1 = 0;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=1; i<=rows; ++i)


    {
    for(space=1; space <= rows-i; ++space)
    {
    printf(" ");
    ++count;
    }

    while(k != 2*i-1)
    {
    if (count <= rows-1)
    {
    printf("%d ", i+k);
    ++count;
    }
    else
    {
    ++count1;
    printf("%d ", (i+k-2*count1));
    }
    ++k;
    }
    count1 = count = k = 0;

    printf("\n");
    }
    return 0;
    }

    Example 8: Inverted full pyramid using *

    * * * * * * * * *
    * * * * * * *
    * * * * *
    * * *
    *

    Source Code

    #include<stdio.h>
    int main()
    {
    int rows, i, j, space;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=rows; i>=1; --i)


    {
    for(space=0; space < rows-i; ++space)
    printf(" ");

    for(j=i; j <= 2*i-1; ++j)


    printf("* ");

    for(j=0; j < i-1; ++j)


    printf("* ");

    printf("\n");
    }

    return 0;
    }

    Example 9: Print Pascal's triangle

    1
    1 1
    1 2 1
    1 3 3 1
    1 4 6 4 1
    1 5 10 10 5 1

    Source Code

    #include <stdio.h>
    int main()
    {
    int rows, coef = 1, space, i, j;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=0; i<rows; i++)


    {
    for(space=1; space <= rows-i; space++)
    printf(" ");

    for(j=0; j <= i; j++)


    {
    if (j==0 || i==0)
    coef = 1;
    else
    coef = coef*(i-j+1)/j;

    printf("%4d", coef);
    }
    printf("\n");
    }

    return 0;
    }

    Example 10: Print Floyd's Triangle.

    1
    2 3
    4 5 6
    7 8 9 10

    Source Code

    #include <stdio.h>
    int main()
    {
    int rows, i, j, number= 1;

    printf("Enter number of rows: ");


    scanf("%d",&rows);

    for(i=1; i <= rows; i++)


    {
    for(j=1; j <= i; ++j)
    {
    printf("%d ", number);
    ++number;
    }

    printf("\n");
    }

    return 0;
    }

    Example: GCD of Two Numbers using Recursion

    #include <stdio.h>
    int hcf(int n1, int n2);
    int main()
    {
    int n1, n2;
    printf("Enter two positive integers: ");
    scanf("%d %d", &n1, &n2);

    printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1,n2));


    return 0;
    }

    int hcf(int n1, int n2)


    {
    if (n2 != 0)
    return hcf(n2, n1%n2);
    else
    return n1;
    }

    Output

    Enter two positive integers: 366


    60
    G.C.D of 366 and 60 is 6.

    Example #1: Program to Count Number of Digits in an


    Integer
    #include <stdio.h>
    int main()
    {
    long long n;
    int count = 0;

    printf("Enter an integer: ");


    scanf("%lld", &n);

    while(n != 0)
    {
    // n = n/10
    n /= 10;
    ++count;
    }

    printf("Number of digits: %d", count);


    }
    Output

    Enter an integer: 3452

    Number of digits: 4

    You might also like