-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path100factorial.cpp.txt
88 lines (74 loc) · 1.22 KB
/
100factorial.cpp.txt
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
82
83
84
85
86
87
// ConsoleApplication8.cpp: 콘솔 응용 프로그램의 진입점을 정의합니다.
//
#include "stdafx.h"
#include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
using namespace std;
int main()
{
vector<int> v(3,0);
v[0] = 0;
v[1] = 0;
v[2] = 1;
for (int s = 99; s > 0; s--)
{
int a1 = s / 10;
int a2 = s % 10;
int ex[2];
ex[0] = a2;
ex[1] = a1;
int size_z = v.size();
v.push_back(0);
v.push_back(0);
vector<int> v_ex(v.capacity(),0);
if (s >= 10)
{
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < size_z; j++)
{
v_ex[i + j] += ex[i] * v[j];
}
}
}
else
{
for (int i = 0; i < 1; i++)
{
for (int j = 0; j < size_z; j++)
{
v_ex[i + j] += ex[i] * v[j];
}
}
}
size_z = v_ex.size();
v_ex.push_back(0);
v.push_back(0);
for (int i = 0; i < size_z; i++)
{
v_ex[i + 1] += v_ex[i] / 10;
v_ex[i] = v_ex[i] % 10;
}
while (v_ex.size() > 1 && v_ex.back() == 0)
{
v_ex.pop_back();
}
for (int i = 0; i < v_ex.size(); i++)
{
v[i] = v_ex[i];
}
while (v.size() > 1 && v.back() == 0)
{
v.pop_back();
}
}
for (int i = v.size() - 1; i >= 0; i--)
{
cout << v[i];
}
cout << endl;
return 0;
}