[2/2] Calculation of Simple Interest for 3 sets of P, N, R (using For loop)

orkut.com
This program calculates the Simple Interest for 3 different values of P, N, R.
This program makes use of the For Loop, which is by far the most efficient loop used in C Programming.


#include<stdio.h>
main()
{

int p, n, count;
float r, si;

for (count=1;count<=3;count++)

{
printf ("Enter the values of p, n and r:");
scanf ("%d %d %f", &p, &n, &r);

si = p*n*r / 100 ;

printf ("Simple Interest = Rs. %f\n", si);
}

}



The file can be downloaded at:
Download File

Comments

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