Thursday, December 26, 2019
print table
//print any table
#include<stdio.h>
int main()
{
int i,r,c;
printf("which table you want:");
scanf("%d",&c);
for(i=1;i<=10;i++)
{
printf("%d*%d=%d\n",c,i,c*i);
}
return 0;
}
sum of digits
//sum of digits
#include<stdio.h>
main()
{
int a,n,s=0;
printf("enter number:");
scanf("%d",&n);
while(n>0)
{
a=n%10;
s=s+a;
n=n/10;
}
printf("sum of digits is:%d",s);
}
Friday, December 20, 2019
armstrong
//armstrong program
#include <stdio.h>
int main()
{
int a,b,n,d=0;
printf("enter 3 digit number:");
scanf("%d",&n);
a=n;
while(n>0)
{
b=n%10;
d=d+b*b*b;
n=n/10;
}
if(a==d)
{
printf("number is armstrong");
}
else
{
printf("not armstrong");
}
return 0;
}
int main()
{
int a,b,n,d=0;
printf("enter 3 digit number:");
scanf("%d",&n);
a=n;
while(n>0)
{
b=n%10;
d=d+b*b*b;
n=n/10;
}
if(a==d)
{
printf("number is armstrong");
}
else
{
printf("not armstrong");
}
return 0;
}
factorial using recursion
//factorial using recurssion
#include <stdio.h>
int fact(n);
int i,n,p;
int main()
{
printf("which factorial you want:");
scanf("%d",&p);
printf("%d",fact(p));
}
int fact(n)
{
if(n==0)
{
return 1;
}
else
{
return n*fact(n-1);
}
}
#include <stdio.h>
int fact(n);
int i,n,p;
int main()
{
printf("which factorial you want:");
scanf("%d",&p);
printf("%d",fact(p));
}
int fact(n)
{
if(n==0)
{
return 1;
}
else
{
return n*fact(n-1);
}
}
factorial
//factorial of a given number
#include <stdio.h>
int main()
{
int i,n,fact=1;
printf("which factorial you want:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
fact=fact*i;
}
printf("%d",fact);
return 0;
}
#include <stdio.h>
int main()
{
int i,n,fact=1;
printf("which factorial you want:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
fact=fact*i;
}
printf("%d",fact);
return 0;
}
febnocii
- //febnocii series
- #include <stdio.h>
- int main()
- {
- int a=0,b=1,c,i,n;
- printf("enter number of elements:");
- scanf("%d",&n);
- printf("%d %d ",a,b);
- for(i=1;i<=n;i++)
- {
- c=a+b;
- printf(" %d ",c);
- a=b;
- b=c;
- }
- return 0;
- }
Subscribe to:
Comments (Atom)