Posts

smallest notes from given

 #include <stdio.h> int main(void) { int amount,nohun,nofifty,noten,nofive,notwo,noone,total; printf("enter amount\n"); scanf("%d",&amount); nohun=amount/100; amount=amount%100; nofifty=amount/50; amount=amount%50; noten=amount/10; amount=amount%10; nofive=amount/5; amount=amount%5; notwo=amount/2; amount=amount%2; noone=amount/1; amount=amount%1; total=nohun+nofifty+noten+nofive+notwo+noone; printf("smallest number of notes=%d\n",total); return 0; }
Post a Comment
Read more

reverse digit

 #include <stdio.h> int main(void) { int n,d5,d4,d3; long int revnum; printf("enter number\n"); scanf("%d",&n); d5=n%10; n=n/10; d4=n%10; n=n/10; d3=n%10; printf("answer\n%d%d%d",d5,d4,d3); }
Post a Comment
Read more

triangle area finding

 #include <stdio.h> #include <math.h> int main() { float a,b,c,sp,area,squareroot,num; printf("\n Enter sides of triangle\n"); scanf("%f %f %f",&a,&b,&c); sp=(a+b+c)/2; num =(sp*(sp-a)*(sp-b)*(sp-c)); area = sqrt(num); printf("Area of triangle %f\n",area); return 0; }
Post a Comment
Read more

pointer arithmetic operation

Post a Comment
Read more

pointer use for adress

 #include <stdio.h> int main(void) { int a=76; int* ptra= &a; printf("address of a is %p\n\t",&ptra); printf("address of a is %p\n\t",&a); printf("The value of a is %d\n",*ptra); return 0; }
Post a Comment
Read more

useing recursion function fibonaki series

  #include <stdio.h> int fib(int number){  if (number == 1 || number == 2){ return number-1;      }  else{ return (fib(number - 1) + fib(number - 2));  } } int main(void) { int number;     scanf("%d", &number); printf("Enter the number \n"); printf("the fibonaki number of %d is %d\n", number, fib(number)); return 0; }
Post a Comment
Read more

2 d array

 #include <stdio.h> int main(void) { int marks[2][4]={{45,65,6,9},                  {9,23,54,87,12}}; for(int i = 0; i < 3; i++ ){ for(int j=0; j < 4; j++){ printf("the value of %d , %d element of array is %d\n",i,j,marks[i][j]); } } }
Post a Comment
Read more