#include int main() { int n,t,c=0,sum1,sum2,rem,i; printf("enter the value of n:"); scanf("%d",&n); t=n; while (t!=0){ c++; t=t/10; } if(c%2!=0){ printf("false"); exit(0);
#include void main() { int rn=0,n; scanf("%d",&n); int temp=n; int p=n; while(n!=0) { rn=rn*10+n%10; n=n/10; } if(temp==rn) printf("%d is a palindrome",p); else printf("%d is not palindrome",p); }
Calculate sum of the individual digits of the given number
#include void main() { long int n,c=0,temp,sum=0,r; scanf("%ld",&n); temp=n; if(n>=0) { while(n!=0) { n=n/10; c++; } n=temp; while(c!=0) { r=n%10; sum=sum+r; n=n/10; c--; } printf("sum of individual digits of a positive integer is %ld",sum); } else printf("invalid:you need to enter positive number"); }
3 Comments
This comment has been removed by the author.
ReplyDelete
ReplyDeleteInput float value
#include
#include
void main()
{
float a; scanf("%f",&a);
printf("%0.1f\n",(floor(10*a))/10);
printf("%0.2f\n",(floor(100*a))/100);
printf("%0.3f\n",(floor(1000*a))/1000);
}
Handshakes
#include
int main()
{
int n,t;
scanf("%d",&n);
t=n*(n-1)/2;
printf("%d\n",t);
return 0;
}
Sum of tens and ones digit
# include
int main()
{
int n,t,o,sum;
printf("input: ");
scanf("%d",&n);
o=n%10;
t=(n/10)%10;
sum=t+o;
printf("output: %d\n", sum);
return 0;
}
Maximal value of the xor operation
#include
void main()
{
int i,j,l,r,max=0;
printf("Enter values for Lower bound & Upper bound\n");
scanf("%d %d",&l,&r);
for(i=l;i<=r;i++)
for(j=i+1;j<=r;j++)
max=(max<(i^j))?(i^j):max;
printf("%d",max);
}
Lucky number
#include
int main()
{
int n,t,c=0,sum1,sum2,rem,i;
printf("enter the value of n:");
scanf("%d",&n);
t=n;
while (t!=0){
c++;
t=t/10;
}
if(c%2!=0){
printf("false");
exit(0);
}
sum2=0;
for(i=1;i<=c/2;i++){
rem=n%10;
sum2+=rem;
n=n/10;}
sum1=0;
for(i=1;i<=c/2;i++){
rem=n%10;
sum1+=rem;
n=n/10;}
if(sum1==sum2)
printf("true");
else
printf("false");
return 0;
}
Smith number
#include
void main()
{
long int n,i,j,sum=0,prime_sum=0;
scanf("%ld",&n);
if(n>=0)
{
i=n;
while(i>0)
{
sum=sum+(i%10);
i=i/10;
}
for(i=2;i<=n;i++)
{
while(n%i==0)
{
if(i>9)
{
j=i;
while(j>0)
{
prime_sum=prime_sum+j%10;
j=j/10;
}
}
else
prime_sum=prime_sum+i;
n=n/i;
}
}
if(sum==prime_sum)
printf("1");
else
printf("0");
}
else
printf("0");
}
Armstrong number
ReplyDelete#include
int main()
{
int num,originalNum,remainder,result = 0;
printf("Enter a three-digit integer: ");
scanf("%d", &num);
originalNum = num;
while (originalNum != 0) {
remainder = originalNum % 10;
result += remainder * remainder * remainder;
originalNum /= 10;
}
if (result == num)
printf("%d is an Armstrong number.", num);
else
printf("%d is not an Armstrong number.", num);
return 0;
}
No. Of candies by n children
#include
int main()
{
int year,c=0;
printf("input:");
scanf("%d",&year);
while (year>0)
{
year=year-100;
c=c+1;
}
printf("output:%d\n",c);
return 0;
}
Given a year, produce the century it is in.
#include
int main()
{
int year,c=0;
printf("input:");
scanf("%d",&year);
while (year>0)
{
year=year-100;
c=c+1;
}
printf("output:%d\n",c);
return 0;
}
Floyd triangle
#include
void main()
{
int i,j,n,k;
scanf("%d",&n);
printf("the required pattern is\n");
for(i=1;i<=n;i++)
{
for(j=i;j=1; i--)
{
for(j=n;j>i;j--)
printf(" ");
for(k=1;k<2*i;k++)
printf("*");
printf("\n");
}
}
Print the * for the number of times in a rows to form diamond shape
#include
void main()
{
int i,j,n,k;
scanf("%d",&n);
printf("the required pattern is\n");
for(i=1;i<=n;i++)
{
for(j=i;j=1; i--)
{
for(j=n;j>i;j--)
printf(" ");
for(k=1;k<2*i;k++)
printf("*");
printf("\n");
}
}
Check whether given number is Palindrome or not
#include
void main()
{
int rn=0,n;
scanf("%d",&n);
int temp=n;
int p=n;
while(n!=0)
{
rn=rn*10+n%10;
n=n/10;
}
if(temp==rn)
printf("%d is a palindrome",p);
else
printf("%d is not palindrome",p);
}
Calculate sum of the individual digits of the given number
#include
void main()
{
long int n,c=0,temp,sum=0,r;
scanf("%ld",&n);
temp=n;
if(n>=0)
{
while(n!=0)
{
n=n/10;
c++;
}
n=temp;
while(c!=0)
{
r=n%10;
sum=sum+r;
n=n/10;
c--;
}
printf("sum of individual digits of a positive integer is %ld",sum);
}
else
printf("invalid:you need to enter positive number");
}
Please do not enter any spam link in the comment box .