Distance Conversion Program

This Program converts the value entered in Km to inches, centimetres, feet and metres.


The distance between two cities (in km.) is input through the keyboard.
Write a program to convert and print this distance in meters, feet, inches and centimetres.


/*
Distance Conversion:
1Km = 39370 inches
1Km = 3281 Feet
1Km = 100000 Cm
1Km = 1000 metres
*/





#include<stdio.h>

main()
{
float km,m,cm,inch,foot;

printf("Enter the distance between the two cities in Km: ");
scanf("%f", &km);

inch = 39370*km;
foot = 3281*km;

cm= 100000*km;
m = 1000*km;

printf ("\nDistance converted to inches: %f", inch);
printf ("\nDistance converted to feet: %f", foot);

printf ("\nDistance converted to centimeters: %f", cm);
printf ("\nDistance converted to meters: %f", m);

}

Comments

Unknown said…
hi can u write a code that looks up the driving distance between two cities. Use two drop-down boxes that contain the names of the cities. Label one drop-down Departure and the other Destination. Use a Distance button to find and display the distance, and a Clear button to clear the selection.


Distance Table
Boston Chicago Dallas Las
Vegas Los
Angeles Miami New
Orleans Toronto Vancouver Washington
DC
Boston 0 1004 1753 2752 3017 1520 1507 609 3155 448
Chicago 1004 0 921 1780 2048 1397 919 515 2176 709
Dallas 1753 921 0 1230 1399 1343 517 1435 2234 1307
Las Vegas 2752 1780 1230 0 272 2570 1732 2251 1322 2420
Los Angeles 3017 2048 1399 272 0 2716 1858 2523 1278 2646
Miami 1520 1397 1343 2570 2716 0 860 1494 3447 1057
New Orleans 1507 919 517 1732 1858 860 0 1307 2734 1099
Toronto 609 515 1435 2251 2523 1494 1307 0 2820 571
Vancouver 3155 2176 2234 1322 1278 3447 2734 2820 0 2887
Washington DC 448 709 1307 2420 2646 1057 1099 571 2887 0
8:54 AM, December 03, 2009
Post a Comment

Popular posts from this blog

C Program - Calculation of Area and Circumference of a Circle using Pointers

The following program is one good example that illustrates how we can return more than one value in a function. The answer is certainly using Pointers. The following program demonstrates the method. Write a function that calculates both Area and Perimeter/ Circumference of the Circle, whose Radius is entered through the keyboard. #include <stdio.h> main ( ) { int radius ; float area , perimeter ; printf ( " \n Enter radius of a circle:" ) ; scanf ( "%d" , & radius ) ; areaperi ( radius , & area , & perimeter ) ; printf ( "Area=%f" , area ) ; printf ( " \n Perimeter=%f" , perimeter ) ; } areaperi ( int r , float * a , float * p ) { * a = 3.14 * r * r ; * p = 2 * 3.14 * r ; } // This Program exhibits the use of Call By Reference . The program can be found at: Download File.
Read more

Matchstick Game using C Programming

Write a program for a matchstick game being played between the computer and a user. Your program should ensure that the computer always wins. Rules for the game are as follows: -There are 21 matchsticks. -The computer asks the player to pick 1, 2, 3 or 4 matchsticks. -After the person picks, the computer does its picking. -Whoever is forced to pick up the last matchstick loses the game. -There are 21 matchsticks. -Whoever is forced to pick up the last matchstick loses the game. So the last one is special, so it's all about how to get rid of 20 matches in pairs of turns. -The computer asks the player to pick 1, 2, 3 or 4 matchsticks. So if we reduce the total by 5 each round, the sequence will go 21 16 11 6 1 In effect, whatever number the user picks (n), the computer picks 5-n #include <stdio.h> main ( ) { int matchsticks = 21 , user , computer ; printf ( "Do not enter Invalid Numbers. \n Numbers above 4 are invalid." ) ; printf ( " \n If you do so, t
Read more

Generation of Fibonacci Sequence using Recursion.

Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence. In a Fibonacci sequence the sum of two successive terms gives the third term. Following are the first few terms of the Fibonacci sequence: 1 1 2 3 5 8 13 21 34 55 89 ... #include <stdio.h> main ( ) { static int prev_number = 0 , number = 1 ; // static : so value is not lost int fibonacci ( int prev_number , int number ) ; printf ( "Following are the first 25 Numbers of the Fibonacci Series: \n " ) ; printf ( "1 " ) ; // to avoid complexity fibonacci ( prev_number , number ) ; } fibonacci ( int prev_number , int number ) { static int i = 1 ; // i is not 0 , cuz 1 is already counted in main . int fibo ; if ( i = = 25 ) { printf ( " \n done" ) ; // stop after 25 numbers } else { fibo = prev_number + number ; prev_number = number ; // important steps number = fibo ; printf ( " \n %d" , fibo ) ; i + + ; // increment
Read more