Viewing code of 1111
// ------ 1111.CPP --------------
//--- Programmed By Rajesh -----
/*
This is a program to calculate factorial without the use of recursion
*/
#include<stdio.h>
#include<conio.h>
int factorial(int a)
{
int i,pro=1;
for (i=2;i<=a;i++)
pro*=i;
return(pro);
}
void main()
{
int a,pro;
clrscr();
printf("\nThe factorial of the following number is required:",a);
scanf("%d",&a);
pro=factorial(a);
printf("the factorial of %d is %d",a,pro);
getch();
}
Home
Library Home:
- 1 1111
- 2 AVG_LINE
- 3 Assembly cubing
- 4 EX02_102
- 5 EX02_18
- 6 EX03_10A
- 7 EX03_11A
- 8 EX03_12A
- 9 EX03_9A
- 10 EX18A_R
- 11 EX1_8AR
- 12 EX2_102B
- 13 EX2_102C
- 14 EX2_Q4
- 15 EX3R9A
- 16 EX3_8A
- 17 EXCEQNO4
- 18 EXCSQ6A
- 19 EX_2_102
- 20 EX_CPLUS
- 21 FIB1
- 22 FIB2
- 23 FIB3
- 24 FIBONAC
- 25 FIB_NO_R
- 26 Fibonaci_without ercursion
- 27 MULTIRAJ
- 28 PALINDCT
- 29 PLDRM_N
- 30 Pointer matrix multiply
- 31 RAJ3
- 32 RAJAGE
- 33 RAJMAT1
- 34 RPBROKER
- 35 RPDIGIT
- 36 RPDIGIT1
- 37 RPKILOMETE
- 38 RPOVERTIME
- 39 RPRestaurantBilling
- 40 SRCOMP1
- 41 SRIIMP
- 42 STRUCTCW
- 43 socket programming