Skip to content

Commit 7206937

Browse files
authored
Add files via upload
1 parent 422f372 commit 7206937

21 files changed

+409
-0
lines changed

Fibonacci using recursion.c

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
#include<stdio.h>
2+
void printFibonacci(int n){
3+
static int n1=0,n2=1,n3;
4+
if(n>0){
5+
n3 = n1 + n2;
6+
n1 = n2;
7+
n2 = n3;
8+
printf("%d ",n3);
9+
printFibonacci(n-1);
10+
}
11+
}
12+
int main(){
13+
int n;
14+
printf("Enter the number of elements: ");
15+
scanf("%d",&n);
16+
printf("Fibonacci Series: ");
17+
printf("%d %d ",0,1);
18+
printFibonacci(n-2);//n-2 because 2 numbers are already printed
19+
return 0;
20+
}

Fibonacci.c

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
#include<stdio.h>
2+
void printFibonacci(int n){
3+
static int n1=0,n2=1,n3;
4+
if(n>0){
5+
n3 = n1 + n2;
6+
n1 = n2;
7+
n2 = n3;
8+
printf("%d ",n3);
9+
printFibonacci(n-1);
10+
}
11+
}
12+
int main(){
13+
int n;
14+
printf("Enter the number of elements: ");
15+
scanf("%d",&n);
16+
printf("Fibonacci Series: ");
17+
printf("%d %d ",0,1);
18+
printFibonacci(n-2);//n-2 because 2 numbers are already printed
19+
return 0;
20+
}

alphabet triangle.c

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
#include<stdio.h>
2+
#include<stdlib.h>
3+
int main(){
4+
int ch=65;
5+
int i,j,k,m;
6+
system("cls");
7+
for(i=1;i<=5;i++)
8+
{
9+
for(j=5;j>=i;j--)
10+
printf(" ");
11+
for(k=1;k<=i;k++)
12+
printf("%c",ch++);
13+
ch--;
14+
for(m=1;m<i;m++)
15+
printf("%c",--ch);
16+
printf("\n");
17+
ch=65;
18+
}
19+
return 0;
20+
}

armstrong number.c

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
int n,r,sum=0,temp;
5+
printf("enter the number=");
6+
scanf("%d",&n);
7+
temp=n;
8+
while(n>0)
9+
{
10+
r=n%10;
11+
sum=sum+(r*r*r);
12+
n=n/10;
13+
}
14+
if(temp==sum)
15+
printf("armstrong number ");
16+
else
17+
printf("not armstrong number");
18+
return 0;
19+
}

assembly.c

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
#include<stdio.h>
2+
//executed on turbo c. used to add two numbers in C.
3+
void main() {
4+
int a = 10, b = 20, c;
5+
6+
asm {
7+
mov ax,a
8+
mov bx,b
9+
add ax,bx
10+
mov c,ax
11+
}
12+
13+
printf("c= %d",c);
14+
}

decimal to binary.c

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
#include<stdio.h>
2+
#include<stdlib.h>
3+
int main(){
4+
int a[10],n,i;
5+
system ("cls");
6+
printf("Enter the number to convert: ");
7+
scanf("%d",&n);
8+
for(i=0;n>0;i++)
9+
{
10+
a[i]=n%2;
11+
n=n/2;
12+
}
13+
printf("\nBinary of Given Number is=");
14+
for(i=i-1;i>=0;i--)
15+
{
16+
printf("%d",a[i]);
17+
}
18+
return 0;
19+
}

factorial using recursion.c

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
#include<stdio.h>
2+
3+
long factorial(int n)
4+
{
5+
if (n == 0)
6+
return 1;
7+
else
8+
return(n * factorial(n-1));
9+
}
10+
11+
void main()
12+
{
13+
int number;
14+
long fact;
15+
printf("Enter a number: ");
16+
scanf("%d", &number);
17+
18+
fact = factorial(number);
19+
printf("Factorial of %d is %ld\n", number, fact);
20+
return 0;
21+
}

factorial.c

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
int i,fact=1,number;
5+
printf("Enter a number: ");
6+
scanf("%d",&number);
7+
for(i=1;i<=number;i++){
8+
fact=fact*i;
9+
}
10+
printf("Factorial of %d is: %d",number,fact);
11+
return 0;
12+
}
13+

fibonacci triangle.c

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
#include<stdio.h>
2+
#include<stdlib.h>
3+
int main(){
4+
int a=0,b=1,i,c,n,j;
5+
system("cls");
6+
printf("Enter the limit:");
7+
scanf("%d",&n);
8+
for(i=1;i<=n;i++)
9+
{
10+
a=0;
11+
b=1;
12+
printf("%d\t",b);
13+
for(j=1;j<i;j++)
14+
{
15+
c=a+b;
16+
printf("%d\t",c);
17+
a=b;
18+
b=c;
19+
20+
}
21+
printf("\n");
22+
}
23+
return 0;
24+
}

hello if !;.c

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
if(printf("hello world")){}
5+
return 0;
6+
}

hello switch !;.c

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
switch(printf("hello world")){}
5+
return 0;
6+
}

hello while !;.c

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
while(!printf("hello world")){}
5+
return 0;
6+
}

matrix multiplication.c

Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
#include<stdio.h>
2+
//#include<stdlib.h>
3+
int main(){
4+
int a[10][10],b[10][10],mul[10][10],r,c,i,j,k;
5+
//system("cls");
6+
printf("enter the number of row=");
7+
scanf("%d",&r);
8+
printf("enter the number of column=");
9+
scanf("%d",&c);
10+
printf("enter the first matrix elements=\n");
11+
for(i=0;i<r;i++)
12+
{
13+
for(j=0;j<c;j++)
14+
{
15+
scanf("%d",&a[i][j]);
16+
}
17+
}
18+
printf("enter the second matrix elements=\n");
19+
for(i=0;i<r;i++)
20+
{
21+
for(j=0;j<c;j++)
22+
{
23+
scanf("%d",&b[i][j]);
24+
}
25+
}
26+
27+
printf("multiplied matrix is as follows : \n");
28+
for(i=0;i<r;i++)
29+
{
30+
for(j=0;j<c;j++)
31+
{
32+
mul[i][j]=0;
33+
for(k=0;k<c;k++)
34+
{
35+
mul[i][j]+=a[i][k]*b[k][j];
36+
}
37+
}
38+
}
39+
//printing multiplied matrix
40+
for(i=0;i<r;i++)
41+
{
42+
for(j=0;j<c;j++)
43+
{
44+
printf("%d\t",mul[i][j]);
45+
}
46+
printf("\n");
47+
}
48+
return 0;
49+
}

number in characters.c

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
#include<stdio.h>
2+
#include<stdlib.h>
3+
int main(){
4+
long int n,sum=0,r;
5+
system("cls");
6+
printf("enter the number=");
7+
scanf("%ld",&n);
8+
while(n>0)
9+
{
10+
r=n%10;
11+
sum=sum*10+r;
12+
n=n/10;
13+
}
14+
n=sum;
15+
while(n>0)
16+
{
17+
r=n%10;
18+
switch(r)
19+
{
20+
case 1:
21+
printf("one ");
22+
break;
23+
case 2:
24+
printf("two ");
25+
break;
26+
case 3:
27+
printf("three ");
28+
break;
29+
case 4:
30+
printf("four ");
31+
break;
32+
case 5:
33+
printf("five ");
34+
break;
35+
case 6:
36+
printf("six ");
37+
break;
38+
case 7:
39+
printf("seven ");
40+
break;
41+
case 8:
42+
printf("eight ");
43+
break;
44+
case 9:
45+
printf("nine ");
46+
break;
47+
case 0:
48+
printf("zero ");
49+
break;
50+
default:
51+
printf("tttt");
52+
break;
53+
}
54+
n=n/10;
55+
}
56+
return 0;
57+
}

palindrome.c

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
int n,r,sum=0,temp;
5+
printf("enter the number=");
6+
scanf("%d",&n);
7+
temp=n;
8+
while(n>0)
9+
{
10+
r=n%10;
11+
sum=(sum*10)+r;
12+
n=n/10;
13+
}
14+
if(temp==sum)
15+
printf("palindrome number ");
16+
else
17+
printf("not palindrome");
18+
return 0;
19+
}

prime with repetition.c

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
#include<stdio.h>
2+
int main(){
3+
int n,i,m=0,flag=0,x=1;
4+
do{printf("Enter the number to check prime:");
5+
scanf("%d",&n);
6+
m=n/2;
7+
8+
for(i=2;i<=m;i++)
9+
{
10+
if(n%i==0)
11+
{
12+
printf("Number is not prime\n");
13+
flag=1;
14+
break;
15+
}
16+
}
17+
if(flag==0)
18+
printf("Number is prime\n");
19+
}while(x>0);
20+
return 0;
21+
}

prime.c

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
#include<stdio.h>
2+
int main(){
3+
int n,i,m=0,flag=0,x=1;
4+
do{printf("Enter the number to check prime:");
5+
scanf("%d",&n);
6+
m=n/2;
7+
8+
for(i=2;i<=m;i++)
9+
{
10+
if(n%i==0)
11+
{
12+
printf("Number is not prime\n");
13+
flag=1;
14+
break;
15+
}
16+
}
17+
if(flag==0)
18+
printf("Number is prime\n");
19+
}while(x>0);
20+
return 0;
21+
}

reverse number.c

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
int n, reverse=0, rem;
5+
printf("Enter a number: ");
6+
scanf("%d", &n);
7+
while(n!=0)
8+
{
9+
rem=n%10;
10+
reverse=reverse*10+rem;
11+
n/=10;
12+
}
13+
printf("Reversed Number: %d",reverse);
14+
return 0;
15+
}

0 commit comments

Comments
 (0)