uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

Code With SaiPradeep

Code With SaiPradeep

Kanalga Telegram’da o‘tish

A space for curious minds to explore software engineering, computer science, programming and technology. Learn. Explore. Understand.

Ko'proq ko'rsatish

📈 Telegram kanali Code With SaiPradeep analitikasi

Code With SaiPradeep (@codewithsaipradeep) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 12 327 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 10 232-o'rinni va Hindiston mintaqasida 31 271-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 12 327 obunachiga ega bo‘ldi.

12 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -238 ga, so‘nggi 24 soatda esa -8 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 10.45% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 1 288 marta ko‘riladi; birinchi sutkada odatda 0 ta ko‘rish yig‘iladi.
  • Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 11 ta reaksiya keladi.
  • Tematik yo‘nalishlar: Kontent input, string, scanf("%d, array, element kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“A space for curious minds to explore software engineering, computer science, programming and technology. Learn. Explore. Understand.”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 13 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

12 327
Obunachilar
-824 soatlar
-827 kun
-23830 kun
Postlar arxiv
💻 Continue until User Says 'No'
#include <stdio.h>

int main() {
    char answer;

    do {
        printf("Do you want to continue? (y/n): ");
        scanf(" %c", &answer);

        if (answer == 'y') {
            printf("Continuing...n");
        } else if (answer == 'n') {
            printf("Exiting...n");
        } else {
            printf("Invalid input. Please enter 'y' or 'n'.n");
        }

    } while (answer != 'n');

    return 0;
}
📤 Output:
Input: y
Output: Do you want to continue? (y/n): Continuing...
Input: z
Output: Do you want to continue? (y/n): Invalid input. Please enter 'y' or 'n'.
Input: Y
Output: Do you want to continue? (y/n): Invalid input. Please enter 'y' or 'n'.
Input: n
Output: Do you want to continue? (y/n): Exiting...

💻 Input Validation for Range
#include <stdio.h>

int main() {
  int number;
  int lower_bound = 10;
  int upper_bound = 20;

  do {
    printf("Enter a number between %d and %d: ", lower_bound, upper_bound);
    scanf("%d", &number);

    if (number < lower_bound || number > upper_bound) {
      printf("Invalid input. Please enter a number within the specified range.n");
    }
  } while (number < lower_bound || number > upper_bound);

  printf("You entered: %dn", number);

  return 0;
}
📤 Output:
Input: 5
Output: Enter a number between 10 and 20: 5
Invalid input. Please enter a number within the specified range.
Input: 25
Output: Enter a number between 10 and 20: 25
Invalid input. Please enter a number within the specified range.
Input: 15
Output: Enter a number between 10 and 20: 15
You entered: 15

💻 Input Validation for Positive Number
#include <stdio.h>

int main() {
  int number;

  do {
    printf("Enter a positive number: ");
    scanf("%d", &number);

    if (number <= 0) {
      printf("Invalid input. Please enter a positive number.n");
    }
  } while (number <= 0);

  printf("You entered: %dn", number);

  return 0;
}
📤 Output:
Input: -5
Output: Enter a positive number: Invalid input. Please enter a positive number.
Input: 0
Output: Enter a positive number: Invalid input. Please enter a positive number.
Input: 10
Output: Enter a positive number: You entered: 10

💻 Number Guessing Game
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main() {
    int secretNumber, guess;
    int attempts = 0;

    srand(time(0));
    secretNumber = rand() % 100 + 1;

    do {
        printf("Guess a number between 1 and 100: ");
        scanf("%d", &guess);
        attempts++;

        if (guess > secretNumber) {
            printf("Too high!n");
        } else if (guess < secretNumber) {
            printf("Too low!n");
        } else {
            printf("Congratulations! You guessed the number in %d attempts.n", attempts);
        }
    } while (guess != secretNumber);

    return 0;
}
📤 Output:
Guess a number between 1 and 100: Input: 50
Output: Too high!
Guess a number between 1 and 100: Input: 25
Output: Too low!
Guess a number between 1 and 100: Input: 37
Output: Too high!
Guess a number between 1 and 100: Input: 31
Output: Too low!
Guess a number between 1 and 100: Input: 34
Output: Too low!
Guess a number between 1 and 100: Input: 35
Output: Congratulations! You guessed the number in 6 attempts.

💻 Menu-Driven Calculator
#include <stdio.h>
#include <stdlib.h>

int main() {
    int choice;
    float num1, num2, result;

    do {
        printf("Menu:n");
        printf("1. Additionn");
        printf("2. Subtractionn");
        printf("3. Multiplicationn");
        printf("4. Divisionn");
        printf("0. Exitn");
        printf("Enter your choice: ");
        scanf("%d", &choice);

        if (choice >= 1 && choice <= 4) {
            printf("Enter two numbers: ");
            scanf("%f %f", &num1, &num2);
        }

        switch (choice) {
            case 1:
                result = num1 + num2;
                printf("Result: %fn", result);
                break;
            case 2:
                result = num1 - num2;
                printf("Result: %fn", result);
                break;
            case 3:
                result = num1 * num2;
                printf("Result: %fn", result);
                break;
            case 4:
                if (num2 != 0) {
                    result = num1 / num2;
                    printf("Result: %fn", result);
                } else {
                    printf("Cannot divide by zero.n");
                }
                break;
            case 0:
                printf("Exiting...n");
                break;
            default:
                printf("Invalid choice.n");
        }
    } while (choice != 0);

    return 0;
}
📤 Output:
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 1
Input: 1
Enter two numbers:
Input: 5.0 3.0
Output: Result: 8.000000
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 2
Input: 2
Enter two numbers:
Input: 10.0 4.0
Output: Result: 6.000000
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 3
Input: 3
Enter two numbers:
Input: 2.5 4.0
Output: Result: 10.000000
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 4
Input: 4
Enter two numbers:
Input: 10.0 2.0
Output: Result: 5.000000
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 4
Input: 4
Enter two numbers:
Input: 5.0 0.0
Output: Cannot divide by zero.
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 5
Input: 5
Output: Invalid choice.
Menu:
1. Addition
2. Subtraction
3. Multiplication
4. Division
0. Exit
Enter your choice: 0
Input: 0
Output: Exiting...

🔧 Loops - Do-While

💻 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

💻 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

💻 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:
    *
   ***
  *****
 *******
*********
 *******
  *****
   ***
    *

💻 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

💻 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: *****
****
***
**
*

💻 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: *
**
***
****
*****

💻 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

💻 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.

💻 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:

💻 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

💻 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

💻 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

💻 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