C Programming Codes

前往频道在 Telegram

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

显示更多

📈 Telegram 频道 C Programming Codes 的分析概览

频道 C Programming Codes (@c_programming_codes) 英语语言赛道中的是活跃参与者。目前社区聚集了 13 430 名订阅者，在 技术与应用 类别中位列第 9 534，并在印度地区排名第 32 075 位。

📊 受众指标与增长动态

自 невідомо 创建以来，项目保持高速增长，吸引了 13 430 名订阅者。

根据 11 六月, 2026 的最新数据，频道保持稳定运转。过去 30 天订阅人数变化为 -239，过去 24 小时变化为 -9，整体触达仍然可观。

认证状态： 未认证
互动率 (ER)： 平均受众互动率为 9.78%。内容发布后 24 小时内通常能获得 N/A% 的反应，占订阅者总量。
帖子覆盖： 每篇帖子平均可获得 0 次浏览，首日通常累积 0 次浏览。
互动与反馈： 受众积极参与，单帖平均反应数为 0。
主题关注点： 内容集中在 input, string, scanf("%d, array, element 等核心主题上。

📝 描述与内容策略

作者将该频道定位为表达主观观点的平台：
“C Programming Codes || Quizzes || DSA Learn along with the community Any queries admin - @Pradeep_saii”

凭借高频更新（最新数据采集于 12 六月, 2026），频道始终保持新鲜度与高覆盖。分析显示受众积极互动，使其成为 技术与应用 类别中的关键影响点。

13 430

订阅者

-924 小时

-577 天

-23930 天

1 313

帖子浏览量

无数据24 小时

无数据48 小时

9.78%

参与率

无数据

每日帖子数

Ads index

beta

帖子存档

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