Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
刘皓东
ChatGPT Template With Vue
提交
dedb7fff
C
ChatGPT Template With Vue
项目概览
刘皓东
/
ChatGPT Template With Vue
与 Fork 源项目一致
Fork自
inscode / ChatGPT Template With Vue
通知
1
Star
4
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
ChatGPT Template With Vue
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
提交
dedb7fff
编写于
5月 20, 2023
作者:
6
643fea67aa93e810cdda7f81
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Auto commit
上级
3daf8636
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
172 addition
and
0 deletion
+172
-0
ddd.cpp
ddd.cpp
+172
-0
未找到文件。
ddd.cpp
0 → 100644
浏览文件 @
dedb7fff
#include<bits/stdc++.h>
using
namespace
std
;
#define maxk_of_vector 1000000000
#define my (*this)
class
big
{
std
::
deque
<
unsigned
long
long
>
v
;
/*00 00 22 55*/
/* 表示 2255*/
inline
void
ZERO_CLEAR__alg
(
deque
<
unsigned
long
long
>
v
=
v
)
{
/*去0*/
while
(
!
v
[
0
])
v
.
pop_front
();
}
inline
void
ZERO_ON_INT__alg
(
unsigned
x
,
deque
<
unsigned
long
long
>
v
=
v
)
{
/*加0*/
while
(
v
.
size
()
<
x
)
v
.
push_front
(
0
);
}
inline
void
REMOVE_ARR__alg
(
deque
<
unsigned
long
long
>
v
=
v
)
{
/*反转*/
stack
<
int
>
x
;
while
(
v
.
size
())
x
.
push
(
v
.
front
());
while
(
x
.
size
())
{
v
.
push_front
(
x
.
top
());
x
.
pop
();
}
}
inline
void
EQAUL_STRING__alg
(
string
x
)
{
v
.
clear
();
stack
<
char
>
c
;
while
(
x
.
size
())
{
c
.
push
(
x
.
back
()
^
48
);
x
.
pop_back
();
}
unsigned
long
long
d
=
0
;
while
(
c
.
size
())
{
if
(
d
*
10
>=
maxk_of_vector
)
v
.
push_back
(
d
),
d
=
0
;
d
=
d
<<
3
+
d
<<
1
+
c
.
top
();
}
}
deque
<
unsigned
long
long
>
mul
(
deque
<
unsigned
long
long
>
&
a
,
deque
<
unsigned
long
long
>
&
b
)
{
deque
<
unsigned
long
long
>
ans
(
a
.
size
()
+
b
.
size
()
+
1
,
0
);
// 初始化结果数组
REMOVE_ARR__alg
(
a
);
REMOVE_ARR__alg
(
b
);
// 标准竖式乘法
for
(
int
i
=
0
;
i
<
a
.
size
();
i
++
)
{
unsigned
long
long
carry
=
0
;
for
(
int
j
=
0
;
j
<
b
.
size
();
j
++
)
{
unsigned
long
long
tmp
=
a
[
i
]
b
[
j
]
carry
;
ans
[
i
+
j
]
+=
tmp
;
carry
=
ans
[
i
+
j
]
/
maxk_of_vector
;
ans
[
i
+
j
]
%=
maxk_of_vector
;
}
if
(
carry
)
ans
[
i
+
b
.
size
()]
+=
carry
;
}
REMOVE_ARR__alg
(
ans
);
ZERO_CLEAR__alg
(
ans
);
return
ans
;
}
public
:
big
(
std
::
string
x
)
{
EQAUL_STRING__alg
(
x
);
}
big
(
unsigned
long
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
long
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
unsigned
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
short
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
unsigned
short
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
char
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
unsigned
char
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
big
(
big
x
)
{
v
=
x
.
v
;
}
~
big
()
{
v
.
clear
();
}
inline
void
operator
=
(
unsigned
long
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
long
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
unsigned
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
long
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
unsigned
short
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
short
x
)
{
v
.
clear
();
v
.
push_back
(
x
);
}
inline
void
operator
=
(
big
x
)
{
v
=
x
.
v
;
}
inline
void
operator
>>=
(
unsigned
long
long
wei
);
inline
void
operator
<<=
(
unsigned
long
long
wei
);
inline
big
operator
>>
(
unsigned
long
long
wei
);
inline
big
operator
<<
(
unsigned
long
long
wei
);
inline
big
operator
+
(
big
x
);
inline
big
operator
-
(
big
x
);
inline
big
operator
*
(
big
x
);
inline
big
operator
/
(
big
x
);
inline
big
operator
%
(
big
x
);
inline
void
operator
+=
(
big
x
);
inline
void
operator
-=
(
big
x
);
inline
void
operator
*=
(
big
x
);
inline
void
operator
/=
(
big
x
);
inline
void
operator
%=
(
big
x
);
inline
bool
operator
==
(
big
x
)
{
auto
i
=
v
.
begin
();
auto
j
=
x
.
v
.
begin
();
if
(
x
.
v
.
size
()
==
v
.
size
())
while
(
i
!=
v
.
end
())
{
if
(
*
i
^
*
j
)
return
false
;
++
i
;
++
j
;
}
else
return
false
;
return
true
;
}
inline
bool
operator
>=
(
big
x
)
{
auto
i
=
v
.
begin
();
auto
j
=
x
.
v
.
begin
();
if
(
x
.
v
.
size
()
==
v
.
size
())
while
(
i
!=
v
.
end
())
{
if
(
*
i
<
*
j
)
return
false
;
++
i
;
++
j
;
}
else
return
v
.
size
()
>=
x
.
v
.
size
();
return
true
;
}
inline
bool
operator
<=
(
big
x
)
{
return
!
(
my
==
x
||
my
<
x
);
}
inline
bool
operator
!=
(
big
x
)
{
return
!
(
my
==
x
);
}
inline
bool
operator
>
(
big
x
)
{
return
!
(
my
<=
x
);
}
inline
bool
operator
<
(
big
x
)
{
return
!
(
my
>=
x
);
}
};
/*高精度*/
\ No newline at end of file
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录