Sowmiya081103

GCD

Environmental-mapper

Factorial

#include <stdio.h> int main() { int n, i; unsigned long long fact = 1; printf("Enter 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."); else { for (i = 1; i <= n; ++i) { fact *= i; } printf("Factorial of %d = %llu", n, fact); } return 0; }

LCM

Strong-number-in-java

Fibonacci-series

Palindrome-in-java

Sowmiya081103

Config files for my GitHub profile.

3i7rjrurh

Array-in-c

Sowmiya081103/Array-in-c

Sowmiya081103/Dynamic-html-in-java-script

Sowmiya081103/String-in-java

Sowmiya081103/Strong-number-in-java

Sowmiya081103/3i7rjrurh

Sowmiya081103/Palindrome-in-java

Sowmiya081103/Sowmiya081103

Config files for my GitHub profile.

Sowmiya081103/Fibonacci-series

Sowmiya081103/LCM

Sowmiya081103/Factorial

#include <stdio.h> int main() { int n, i; unsigned long long fact = 1; printf("Enter 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."); else { for (i = 1; i <= n; ++i) { fact *= i; } printf("Factorial of %d = %llu", n, fact); } return 0; }

Sowmiya081103/GCD

Sowmiya081103/Environmental-mapper