C Programming Codes

Open in Telegram

C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii

India32 075 Technologies & Applications9 534...

📈 Analytical overview of Telegram channel C Programming Codes

Channel C Programming Codes (@c_programming_codes) in the English language segment is an active participant. Currently, the community unites 13 430 subscribers, ranking 9 534 in the Technologies & Applications category and 32 075 in the India region.

📊 Audience metrics and dynamics

Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 13 430 subscribers.

According to the latest data from 11 June, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -239 over the last 30 days and by -9 over the last 24 hours, overall reach remains high.

Verification status: Not verified
Engagement rate (ER): The average audience engagement rate is 9.78%. Within the first 24 hours after publication, content typically collects N/A% reactions from the total number of subscribers.
Post reach: On average, each post receives 0 views. Within the first day, a publication typically gains 0 views.
Reactions and interaction: The audience actively supports content: the average number of reactions per post is 0.
Thematic interests: Content is focused on key topics such as input, string, scanf("%d, array, element.

📝 Description and content policy

The author describes the resource as a platform for expressing subjective opinions:
“C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii”

Thanks to the high frequency of updates (latest data received on 12 June, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Technologies & Applications category.

13 430

Subscribers

-924 hours

-577 days

-23930 days

1 313

Post views

No data24 hours

No data48 hours

9.78%

Engagement rate

No data

Posts per day

Ads index

beta

Posts Archive

13 430

💻 Calculate Power of Number (Without pow function)

#include <stdio.h>

int main() {
    int base, exponent;
    long long result = 1;

    printf("Enter the base: ");
    scanf("%d", &base);

    printf("Enter the exponent: ");
    scanf("%d", &exponent);

    for (int i = 0; i < exponent; i++) {
        result *= base;
    }

    printf("Result = %lldn", result);

    return 0;
}

📤 Output:

Input: 2
Input: 3
Output: Result = 8

Input: 5
Input: 0
Output: Result = 1

Input: 3
Input: 4
Output: Result = 81

Input: 2
Input: 10
Output: Result = 1024

13 430

💻 Find LCM of Two Numbers

#include <stdio.h>

int main() {
    int num1, num2, max;

    scanf("%d %d", &num1, &num2);

    max = (num1 > num2) ? num1 : num2;

    for (;;) {
        if (max % num1 == 0 && max % num2 == 0) {
            printf("%d", max);
            break;
        }
        max++;
    }

    return 0;
}

📤 Output:

Input: 12 18
Output: 36
Input: 5 7
Output: 35
Input: 2 4
Output: 4
Input: 15 25
Output: 75
Input: 1 10
Output: 10

13 430

💻 Print Pattern - Diamond

#include <stdio.h>

int main() {
    int rows, i, j, space;

    scanf("%d", &rows);

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

    for (i = rows - 1; i >= 1; i--) {
        for (space = i; space < rows; space++) {
            printf(" ");
        }
        for (j = 1; j <= (2 * i - 1); j++) {
            printf("*");
        }
        printf("n");
    }

    return 0;
}

📤 Output:

Input: 5
Output:
    *
   ***
  *****
 *******
*********
 *******
  *****
   ***
    *

13 430

💻 Print Pattern - Pyramid

#include <stdio.h>

int main() {
  int rows, i, j, space;

  printf("Enter the number of rows: ");
  scanf("%d", &rows);

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

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

  return 0;
}

📤 Output:

// Code not available

13 430

💻 Print Pattern - Inverted Right Triangle

#include <stdio.h>

int main() {
  int rows, i, j;

  printf("Enter the number of rows: ");
  scanf("%d", &rows);

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

  return 0;
}

📤 Output:

Input: 5
Output:
Enter the number of rows: *****
****
***
**
*

13 430

https://t.me/+utZsK17rSXRmZWQ1

13 430

💻 Print Pattern - Right Triangle

#include <stdio.h>

int main() {
  int rows;

  printf("Enter the number of rows: ");
  scanf("%d", &rows);

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

  return 0;
}

📤 Output:

Input: 5
Output: *
**
***
****
*****

13 430

💻 Find Factors of a Number

#include <stdio.h>

int main() {
    int num, i;

    printf("Enter an integer: ");
    scanf("%d", &num);

    printf("Factors of %d are: ", num);

    for (i = 1; i <= num; ++i) {
        if (num % i == 0) {
            printf("%d ", i);
        }
    }

    printf("n");

    return 0;
}

📤 Output:

Input: 12
Output: Factors of 12 are: 1 2 3 4 6 12

Input: 7
Output: Factors of 7 are: 1 7

Input: 25
Output: Factors of 25 are: 1 5 25

Input: 1
Output: Factors of 1 are: 1

13 430

💻 Prime Number Checker

#include <stdio.h>

int main() {
    int num, i, flag = 0;

    printf("Enter a positive integer: ");
    scanf("%d", &num);

    if (num <= 1) {
        printf("%d is not a prime number.n", num);
        return 0;
    }

    for (i = 2; i <= num / 2; ++i) {
        if (num % i == 0) {
            flag = 1;
            break;
        }
    }

    if (flag == 0)
        printf("%d is a prime number.n", num);
    else
        printf("%d is not a prime number.n", num);

    return 0;
}

📤 Output:

Input: 7
Output: 7 is a prime number.

Input: 12
Output: 12 is not a prime number.

Input: 1
Output: 1 is not a prime number.

Input: 2
Output: 2 is a prime number.

Input: 0
Output: 0 is not a prime number.

Input: -5
Output: -5 is not a prime number.

13 430

💻 Find Prime Numbers in a Range

#include <stdio.h>
#include <stdbool.h>

int main() {
    int start, end, i, j;
    bool isPrime;

    printf("Enter the starting number: ");
    scanf("%d", &start);

    printf("Enter the ending number: ");
    scanf("%d", &end);

    printf("Prime numbers between %d and %d are:n", start, end);

    for (i = start; i <= end; i++) {
        if (i <= 1)
            continue;

        isPrime = true;
        for (j = 2; j * j <= i; j++) {
            if (i % j == 0) {
                isPrime = false;
                break;
            }
        }

        if (isPrime) {
            printf("%d ", i);
        }
    }
    printf("n");
    return 0;
}

📤 Output:

Input: 10
Input: 20
Output: Prime numbers between 10 and 20 are:
11 13 17 19
Input: 1
Input: 10
Output: Prime numbers between 1 and 10 are:
2 3 5 7
Input: 20
Input: 30
Output: Prime numbers between 20 and 30 are:
23 29
Input: 1
Input: 1
Output: Prime numbers between 1 and 1 are:

13 430

💻 Find Fibonacci Series up to N Terms

#include <stdio.h>

int main() {
  int n, i;
  int first = 0, second = 1;
  int next;

  printf("Enter the number of terms: ");
  scanf("%d", &n);

  printf("Fibonacci Series: ");

  for (i = 0; i < n; i++) {
    printf("%d ", first);
    next = first + second;
    first = second;
    second = next;
  }

  printf("n");
  return 0;
}

📤 Output:

Input: 10
Output: Fibonacci Series: 0 1 1 2 3 5 8 13 21 34

13 430

💻 Find All Strong Numbers in a Range

#include <stdio.h>

int factorial(int n) {
    int fact = 1;
    for (int i = 1; i <= n; i++) {
        fact *= i;
    }
    return fact;
}

int isStrong(int num) {
    int sum = 0;
    int temp = num;
    while (temp != 0) {
        int digit = temp % 10;
        sum += factorial(digit);
        temp /= 10;
    }
    return (sum == num);
}

int main() {
    int start, end;

    printf("Enter the starting number: ");
    scanf("%d", &start);

    printf("Enter the ending number: ");
    scanf("%d", &end);

    printf("Strong numbers between %d and %d are: ", start, end);
    for (int i = start; i <= end; i++) {
        if (isStrong(i)) {
            printf("%d ", i);
        }
    }
    printf("n");

    return 0;
}

📤 Output:

Input: 1
Input: 150
Output: Strong numbers between 1 and 150 are: 1 2 145

13 430

💻 Find All Perfect Numbers in a Range

#include <stdio.h>

int main() {
    int start, end, i, j, sum;

    printf("Enter the starting number: ");
    scanf("%d", &start);

    printf("Enter the ending number: ");
    scanf("%d", &end);

    printf("Perfect numbers between %d and %d are: ", start, end);

    for (i = start; i <= end; i++) {
        sum = 0;
        for (j = 1; j < i; j++) {
            if (i % j == 0) {
                sum += j;
            }
        }

        if (sum == i) {
            printf("%d ", i);
        }
    }
    printf("n");

    return 0;
}

📤 Output:

Input: 1
Input: 10
Output: Perfect numbers between 1 and 10 are: 6
Input: 20
Input: 30
Output: Perfect numbers between 20 and 30 are: 28
Input: 1
Input: 500
Output: Perfect numbers between 1 and 500 are: 6 28 496
Input: 490
Input: 500
Output: Perfect numbers between 490 and 500 are: 496

13 430

💻 Find All Armstrong Numbers in a Range

#include <stdio.h>
#include <math.h>

int main() {
    int start, end, i, num, originalNum, remainder, n = 0;
    float result = 0.0;

    printf("Enter the start of the range: ");
    scanf("%d", &start);
    printf("Enter the end of the range: ");
    scanf("%d", &end);

    printf("Armstrong numbers between %d and %d are: ", start, end);

    for (i = start; i <= end; ++i) {
        originalNum = i;
        num = i;
        n = 0;
        result = 0.0;

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

        originalNum = num;

        while (originalNum != 0) {
            remainder = originalNum % 10;
            result += pow(remainder, n);
            originalNum /= 10;
        }

        if ((int)result == num) {
            printf("%d ", num);
        }
    }

    printf("n");

    return 0;
}

📤 Output:

Input: 100
Input: 500
Output: Armstrong numbers between 100 and 500 are: 153 370 371 407
Input: 1
Input: 10
Output: Armstrong numbers between 1 and 10 are: 1 2 3 4 5 6 7 8 9
Input: 0
Input: 0
Output: Armstrong numbers between 0 and 0 are: 0

13 430

💻 Check if Number is Armstrong

#include <stdio.h>
#include <math.h>

int main() {
    int number, originalNumber, remainder, n = 0;
    float result = 0.0;

    printf("Enter an integer: ");
    scanf("%d", &number);

    originalNumber = number;

    // Count number of digits
    while (originalNumber != 0) {
        originalNumber /= 10;
        ++n;
    }

    originalNumber = number;

    // Calculate result
    while (originalNumber != 0) {
        remainder = originalNumber % 10;
        result += pow(remainder, n);
        originalNumber /= 10;
    }

    // Check if number is Armstrong
    if ((int)result == number)
        printf("%d is an Armstrong number.", number);
    else
        printf("%d is not an Armstrong number.", number);

    return 0;
}

📤 Output:

Input: 153
Output: 153 is an Armstrong number.

Input: 120
Output: 120 is not an Armstrong number.

Input: 1634
Output: 1634 is an Armstrong number.

Input: 1234
Output: 1234 is not an Armstrong number.

13 430

💻 Check if Number is Palindrome

#include <stdio.h>

int main() {
    int num, reversed_num = 0, remainder, original_num;

    printf("Enter an integer: ");
    scanf("%d", &num);

    original_num = num;

    for (; num != 0; num /= 10) {
        remainder = num % 10;
        reversed_num = reversed_num * 10 + remainder;
    }

    if (original_num == reversed_num)
        printf("%d is a palindrome.n", original_num);
    else
        printf("%d is not a palindrome.n", original_num);

    return 0;
}

📤 Output:

Input: 121
Output: 121 is a palindrome.

Input: 123
Output: 123 is not a palindrome.

Input: 12321
Output: 12321 is a palindrome.

Input: 12345
Output: 12345 is not a palindrome.

Input: 1
Output: 1 is a palindrome.

Input: 0
Output: 0 is a palindrome.

13 430

💻 Sum of Digits of a Number

#include <stdio.h>

int main() {
  int num, sum = 0, digit;

  printf("Enter a positive integer: ");
  scanf("%d", &num);

  if (num < 0) {
    printf("Please enter a positive integer.n");
    return 1;
  }

  for (; num != 0; num /= 10) {
    digit = num % 10;
    sum += digit;
  }

  printf("Sum of digits = %dn", sum);

  return 0;
}

📤 Output:

Input: 12345
Output: Enter a positive integer: Sum of digits = 15

Input: 9876
Output: Enter a positive integer: Sum of digits = 30

Input: 0
Output: Enter a positive integer: Sum of digits = 0

Input: -123
Output: Enter a positive integer: Please enter a positive integer.

13 430

💻 Print Multiplication Table

#include <stdio.h>

int main() {
    int num, i;

    printf("Enter an integer: ");
    scanf("%d", &num);

    for (i = 1; i <= 10; i++) {
        printf("%d * %d = %dn", num, i, num * i);
    }

    return 0;
}

📤 Output:

Input: 5
Output: Enter an integer: 5 * 1 = 5
5 * 2 = 10
5 * 3 = 15
5 * 4 = 20
5 * 5 = 25
5 * 6 = 30
5 * 7 = 35
5 * 8 = 40
5 * 9 = 45
5 * 10 = 50

13 430

🔧 Loops - For

13 430

💻 Find GCD/HCF of Two Numbers

#include <stdio.h>

int main() {
    int num1, num2, gcd;

    printf("Enter two integers: ");
    scanf("%d %d", &num1, &num2);

    while (num1 != num2) {
        if (num1 > num2) {
            num1 -= num2;
        } else {
            num2 -= num1;
        }
    }

    gcd = num1;

    printf("GCD = %d", gcd);

    return 0;
}

📤 Output:

Input: 12 18
Output: Enter two integers: GCD = 6
Input: 25 15
Output: Enter two integers: GCD = 5
Input: 10 10
Output: Enter two integers: GCD = 10
Input: 48 18
Output: Enter two integers: GCD = 6