From 41217389dd6603b85ff5f9647eeb9308dc1be254 Mon Sep 17 00:00:00 2001 From: Ramesh2248 <76659766+Ramesh2248@users.noreply.github.com> Date: Tue, 5 Jan 2021 12:17:39 +0530 Subject: [PATCH 1/2] Create testfile --- testfile | 1 + 1 file changed, 1 insertion(+) create mode 100644 testfile diff --git a/testfile b/testfile new file mode 100644 index 0000000..45b983b --- /dev/null +++ b/testfile @@ -0,0 +1 @@ +hi From 185d950c01d3d301252cd8863380f98d715328a0 Mon Sep 17 00:00:00 2001 From: Ramesh2248 <76659766+Ramesh2248@users.noreply.github.com> Date: Tue, 5 Jan 2021 12:25:36 +0530 Subject: [PATCH 2/2] Add files via upload --- big2.c | 22 ++++++++++++++++++++++ big3.c | 21 +++++++++++++++++++++ factorial.c | 20 ++++++++++++++++++++ main.c | 11 +++++++++++ makefile | 18 ++++++++++++++++++ pali.c | 23 +++++++++++++++++++++++ prime.c | 28 ++++++++++++++++++++++++++++ reverse.c | 21 +++++++++++++++++++++ 8 files changed, 164 insertions(+) create mode 100644 big2.c create mode 100644 big3.c create mode 100644 factorial.c create mode 100644 main.c create mode 100644 makefile create mode 100644 pali.c create mode 100644 prime.c create mode 100644 reverse.c diff --git a/big2.c b/big2.c new file mode 100644 index 0000000..e173b60 --- /dev/null +++ b/big2.c @@ -0,0 +1,22 @@ +#include + +// int main() +void big2() +{ + int num1, num2; + + printf("\n Enter two integers :\n"); + scanf("%d%d", &num1, &num2); + + if (num1 > num2) + { + printf("Largest number is %d.", num1); + } + else + { + printf("Largest number is %d.", num2); + } + + // return 0; +} + diff --git a/big3.c b/big3.c new file mode 100644 index 0000000..836406f --- /dev/null +++ b/big3.c @@ -0,0 +1,21 @@ +#include +// int main() { +void big3() { + double n1, n2, n3; + printf("\n Enter three different numbers\n: "); + scanf("%lf %lf %lf", &n1, &n2, &n3); + + // if n1 is greater than both n2 and n3, n1 is the largest + if (n1 >= n2 && n1 >= n3) + printf("%.2f is the largest number.", n1); + + // if n2 is greater than both n1 and n3, n2 is the largest + if (n2 >= n1 && n2 >= n3) + printf("%.2f is the largest number.", n2); + + // if n3 is greater than both n1 and n2, n3 is the largest + if (n3 >= n1 && n3 >= n2) + printf("%.2f is the largest number.", n3); + + // return 0; +} diff --git a/factorial.c b/factorial.c new file mode 100644 index 0000000..1ff63bb --- /dev/null +++ b/factorial.c @@ -0,0 +1,20 @@ +#include +// int main() { +void fact() { + int n, i; + unsigned long long fact = 1; + printf("\n Enter an integer:\n"); + 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."); + else { + for (i = 1; i <= n; ++i) { + fact *= i; + } + printf("Factorial of %d = %llu", n, fact); + } + + // return 0; +} diff --git a/main.c b/main.c new file mode 100644 index 0000000..4a5398d --- /dev/null +++ b/main.c @@ -0,0 +1,11 @@ +#include +#include +main(){ +big2(); +big3(); +fact(); +pali(); +prime(); +rev(); +} + diff --git a/makefile b/makefile new file mode 100644 index 0000000..8995960 --- /dev/null +++ b/makefile @@ -0,0 +1,18 @@ +XYZ.exe:main.o big2.o big3.o factorial.o pali.o prime.o reverse.o + gcc -o XYZ.exe main.o big2.o big3.o factorial.o pali.o prime.o reverse.o +main.o:main.c + gcc -c main.c +big2.o:big2.c + gcc -c big2.c +big3.o:big3.c + gcc -c big3.c +factorial.o:factorial.c + gcc -c factorial.c +pali.o:pali.c + gcc -c pali.c +prime.o:prime.c + gcc -c prime.c +reverse.o:reverse.c + gcc -c reverse.c + + diff --git a/pali.c b/pali.c new file mode 100644 index 0000000..19f87b3 --- /dev/null +++ b/pali.c @@ -0,0 +1,23 @@ +#include +// int main() { +void pali() { + int n, reversedN = 0, remainder, originalN; + printf("\n Enter an integer: \n"); + scanf("%d", &n); + originalN = n; + + // reversed integer is stored in reversedN + while (n != 0) { + remainder = n % 10; + reversedN = reversedN * 10 + remainder; + n /= 10; + } + + // palindrome if orignalN and reversedN are equal + if (originalN == reversedN) + printf("%d is a palindrome.", originalN); + else + printf("%d is not a palindrome.", originalN); + + // return 0; +} diff --git a/prime.c b/prime.c new file mode 100644 index 0000000..c088957 --- /dev/null +++ b/prime.c @@ -0,0 +1,28 @@ +#include +// int main() { +void prime() { + int n, i, flag = 0; + printf("\n Enter a positive integer: \n"); + scanf("%d", &n); + + for (i = 2; i <= n / 2; ++i) { + + // condition for non-prime + if (n % i == 0) { + flag = 1; + break; + } + } + + if (n == 1) { + printf("1 is neither prime nor composite."); + } + else { + if (flag == 0) + printf("%d is a prime number.", n); + else + printf("%d is not a prime number.", n); + } + + // return 0; +} diff --git a/reverse.c b/reverse.c new file mode 100644 index 0000000..7ebd414 --- /dev/null +++ b/reverse.c @@ -0,0 +1,21 @@ +#include +void rev() +{ + int i, j, k; + char str[100]; + char rev[100]; + printf("\n Enter a string:\t"); + scanf("%s", str); + printf("The original string is %s\n", str); + for(i = 0; str[i] != '\0'; i++); + { + k = i-1; + } + for(j = 0; j <= i-1; j++) + { + rev[j] = str[k]; + k--; + } + printf("The reverse string is %s\n", rev); +// getch(); +}