From 8f32c6b118103bad5ada4d6f81c4ff7fd59bd69a Mon Sep 17 00:00:00 2001 From: Cloud User Date: Sun, 1 Sep 2024 14:22:47 +0000 Subject: [PATCH] new c-prject --- big3.c | 20 ++++++++++++++++++++ fact.c | 20 ++++++++++++++++++++ main.c | 5 +++++ makefile | 10 ++++++++++ pal.c | 22 ++++++++++++++++++++++ 5 files changed, 77 insertions(+) create mode 100644 big3.c create mode 100644 fact.c create mode 100644 main.c create mode 100644 makefile create mode 100644 pal.c diff --git a/big3.c b/big3.c new file mode 100644 index 0000000..48033cd --- /dev/null +++ b/big3.c @@ -0,0 +1,20 @@ +#include +void biggest3() +{ + int A, B, C; + + printf("\nEnter the numbers A, B and C: "); + scanf("%d %d %d", &A, &B, &C); + + // finding max using compound expressions + if (A >= B && A >= C) + printf("%d is the largest number.\n", A); + + else if (B >= A && B >= C) + printf("%d is the largest number.\n", B); + + else + printf("%d is the largest number.\n", C); + +} + diff --git a/fact.c b/fact.c new file mode 100644 index 0000000..a941953 --- /dev/null +++ b/fact.c @@ -0,0 +1,20 @@ +#include +void factorial() { + int n, i; + unsigned long long fact = 1; + printf("\n\nEnter an integer: "); + scanf("%d", &n); + + // shows error if the user enters a negative integer + if (n < 0) + printf("Error! Factorial of a negative number doesn't exist.\n"); + else { + for (i = 1; i <= n; ++i) { + fact *= i; + } + printf("Factorial of %d = %llu\n", n, fact); + } + + // return 0; +} + diff --git a/main.c b/main.c new file mode 100644 index 0000000..a20ae33 --- /dev/null +++ b/main.c @@ -0,0 +1,5 @@ +main() { + biggest3(); + factorial(); + pallydrome(); +} diff --git a/makefile b/makefile new file mode 100644 index 0000000..ba60e97 --- /dev/null +++ b/makefile @@ -0,0 +1,10 @@ +ABC.exe:main.o big3.o fact.o pal.o + gcc -o ABC.exe main.o big3.o fact.o pal.o +main.o:main.c + gcc -c main.c +big3.o:big3.c + gcc -c big3.c +fact.o:fact.c + gcc -c fact.c +pal.o:pal.c + gcc -c pal.c diff --git a/pal.c b/pal.c new file mode 100644 index 0000000..04b260b --- /dev/null +++ b/pal.c @@ -0,0 +1,22 @@ +#include +void pallydrome() { + int n, reversed = 0, remainder, original; + printf("\nEnter an integer: "); + scanf("%d", &n); + original = n; + + // reversed integer is stored in reversed variable + while (n != 0) { + remainder = n % 10; + reversed = reversed * 10 + remainder; + n /= 10; + } + + // palindrome if orignal and reversed are equal + if (original == reversed) + printf("%d is a palindrome.\n", original); + else + printf("%d is not a palindrome\n.", original); + + // return 0; +}