Skip to main content

Generate the electricity bill based on the specifications: Domestic >100 units Rs 1.50 101 – 300 units Rs 2.00 301 – 500 units Rs 2.50 L.T.Consumer 501 – 1000 units Rs 4.00 H.T.Consumer 1001- 2000 units Rs 5.00

PROCEDURE:-

      1.input no. of units consumed
      2.according to the above specifications find the amount to be paid
      3.print the above result

CODE:-

#include<stdio.h>
void main()
{
  int units;
  float price;
  printf(“enter the number of units “);
  scanf(“%d”,&units);
  if(units<100)
  price=units*1.50;
  else if(units>100&&units<=300)
  price=units*2.00;
  else if(units>300&&units<=500)
  price=units*2.50;
  else if (units>500&&units<=1000)
  price=units*4.00;
  else if(units>1000&&units<=2000)
  price=units*5.00;
  printf(“the total bill is %f”,price);
}


Input:- enter the number of units
             320
Output:-the total bill is 800.00
Labels:

Comments

Post a Comment

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200
1 comment
Read more

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime  
Post a Comment
Read more