dsa/6.1.cpp at main · Mrdecent08/dsa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <iostream>

using namespace std;

int stack[100], n=100, top=-1;

void push(int val) {

      top++;

      stack[top]=val;

}

int pop() {


   int a;

      a = stack[top];

      top--;

   return a;

}

void display()

{

      cout<<stack[top];

}

int main()
{


   int a,i,val,x,y;

   cout<<"enter a number"<<endl;

   cin>>a; //no whose factorial is to be found


   if(a==0)

   cout<<"1"<<endl;


   else


   {

   for(i=a;i>0;i--)

   push(i);


   for(i=a;i>1;i--)

   {

   x = pop();

   y = pop();

   val = x*y;

   push(val);

   }

   display();
}
   return 0;

}