Technocrat

Using For Loop #include<stdio.h> int main(){ int x,y,m,i; do { printf("Enter two number: "); scanf("%d%d",&x,&y); if(x==0 || y==0) printf("Please check the input and try again...\n"); }while(x==0 || y==0); if(x>y) m=y; else m=x; for(i=m;i>=1;i--){ if(x%i==0&&y%i==0){ printf("\nGCD of %d and %d is %d",x,y,i) ; break; } } return 0; } Using Recursion #include <stdio.h> int gcd(int a, int b) { if (a == b) return a; if (a > b) return gcd(a-b, b); return gcd(a, b-a); } int main() { int x,y,m,i; do { printf("Enter two number: "); scanf("%d%d",&x,&y); if(x==0 || y==0) printf("Please check the input and try again...\n"); }while(x==0 || y==0); printf("GCD of %d and %d

Summary: Factorial is represented using '!', so five factorial will be written as (5!),n factorial as (n!). n! = n*(n-1)*(n-2)*(n-3)...3.2.1 and zero factorial is defined as one i.e. 0! = 1. Using While Loop #include<stdio.h> void main() { int a,f,i; printf("Enter a number: "); scanf("%d",&a); f=1; i=1; while(i<=a) { f = f * i; i++; } printf("\nFactorial of %d is: %d",a,f); } Using For Loop #include<stdio.h> void main() { int a,f,i; printf("Enter a number: "); scanf("%d",&a); f=1; for(i=1;i<=a;i++) f = f * i; printf("\nFactorial of %d is: %d",a,f); } Using Recursion #include<stdio.h> int fact(int); int main(){ int num,f; printf("\nEnter a number: "); scanf("%d",&num); f=fact(num); printf("\nFactorial of %d is: %d",num,f); return 0; } int fact(int n){ if(n==1)

#include<stdio.h> #include<conio.h> int main() { char str[20], ch; int count = 0, i,j=0 , max; int arr[10]; printf("\nEnter a string : "); scanf("%s", &str); printf("\nEnter the character to be searched : "); scanf("%c", &ch); for (i = 0; str[i] != '\0'; i++) { if (str[i] == ch) count++; else if(count != 0) { arr[j] = count; j++; count = 0; } } arr[j]=count; max = 0; for(i=0;i<=j;i++) if(max<arr[i]) max=arr[i]; if (max == 0) printf("\nCharacter '%c'is not present", ch); else { printf("\nMaximum occurrence of character '%c' : %d", ch, max); } return (0); } Output   Print   Output Enter a string : aabbbaaab Enter the character to be searched : Maximum occurrence of character 'a' : 3

#include<stdio.h> void main() { int arr[10], i, j, k, size; printf("\nEnter array size : "); scanf("%d", &size); printf("\nAccept Numbers : \n"); for (i = 0; i < size; i++) { printf("Data [%d]: ",i+1); scanf("%d", &arr[i]); } printf("\nThe Array is : "); for (i = 0; i < size; i++) printf("%d ", arr[i]); getch(); } Output   Print   Download Code Output Enter array size : 5 Accept Numbers : Data [1]: 2 Data [2]: 6 Data [3]: 7 Data [4]: 1 Data [5]: 2 The Array is : 2 6 7 1 2

#include <stdio.h> void main() { int i, j, k; for(i=5;i>=1;i--) { for(k=5;k>=i;k--) { printf(" "); } for(j=1;j<i;j++) { printf("*"); } printf("\n"); } getch(); } Output   Print   Download Code Output **** *** ** *

#include <stdio.h> void main() { int i, j, k; for(i=5;i>=1;i--) { for(j=1;j<=i;j++) printf("*"); printf("\n"); } getch(); } Output   Print   Download Code Output ***** **** *** ** *

#include <stdio.h> void main() { int i, j, k; for(i=5;i>=1;i--) { for(j=1;j<i;j++) { printf(" "); } for(k=5;k>=i;k--) { printf("*"); } printf("\n"); } getch(); } Output   Print   Download Code Output * ** *** **** *****

#include <stdio.h> void main() { int i,j; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("*"); } printf("\n"); } getch(); } Output   Print   Download Code Output * ** *** **** *****

#include<stdio.h> int main() { int num,r,c; printf("Enter number of rows/columns: "); scanf("%d",&num); for(r=1; r<=num; r++) { for(c=1; c<=num; c++) printf("* "); printf("\n"); } getch(); return 0; } Output   Print   Download Code Output Enter number of rows/columns: 5 * * * * * * * * * * * * * * * * * * * * * * * * *

#include<stdio.h> void main() { int n,i,j,flag; printf("\n\nEnter the limit\t:"); scanf("%d",&n); printf("\nThe prime numbers within the given limit:\n"); for(i=1;i<=n;i++) { flag=0; for(j=2;j<=i/2;j++) { if(i%j==0) { flag=1; break; } } if(flag==0) printf("%d\t",i); } } Output   Print   Download Code Output Enter the limit :60 The prime numbers within the given limit: 1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59

#include<stdio.h> void main() { int t,i,m=0,n=1,f=1; printf("\n\nEnter the number of terms:"); scanf("%d",&t); printf("\n The Fibonacci Series of %d terms:\n",t); for(i=1;i<=t;i++) { printf("%d\t",f); f=m+n; m=n; n=f; } } Output   Print   Download Code Output Enter the number of terms:10 The Fibonacci Series of 10 terms: 1 1 2 3 5 8 13 21 34 55

#include<stdio.h> void main() { char chl='a'; char chu='A'; int i; printf("\n==========================="); for(i=1;i<=26;i++,chu++,chl++) printf("\n|%c | %d \t|| %c| %d |",chl,chl, chu, chu); printf("\n==========================="); } Output   Print   Download Code Output =========================== |a | 97 || A| 65 | |b | 98 || B| 66 | |c | 99 || C| 67 | |d | 100 || D| 68 | |e | 101 || E| 69 | |f | 102 || F| 70 | |g | 103 || G| 71 | |h | 104 || H| 72 | |i | 105 || I| 73 | |j | 106 || J| 74 | |k | 107 || K| 75 | |l | 108 || L| 76 | |m | 109 || M| 77 | |n | 110 || N| 78 | |o | 111 || O| 79 | |p | 112 || P| 80 | |q | 113 || Q| 81 | |r | 114 || R| 82 | |s | 115 || S| 83 | |t | 116 || T| 84 | |u | 117 || U| 85 | |v | 118 || V| 86 | |w | 119

#include<stdio.h> int main() { int x=1; for(x=1; x<=10; x++) printf("\n%d",x); return 0; } Output   Print   Download Code Output 1 2 3 4 5 6 7 8 9 10