Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
zhhf96
C-Plus-Plus-TheAlgorithms
提交
f659bcc9
C
C-Plus-Plus-TheAlgorithms
项目概览
zhhf96
/
C-Plus-Plus-TheAlgorithms
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
C-Plus-Plus-TheAlgorithms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
f659bcc9
编写于
4月 18, 2020
作者:
S
stepfencurryxiao
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Don't use bits/stdc++.h
上级
f51c5e11
变更
16
隐藏空白更改
内联
并排
Showing
16 changed file
with
18 addition
and
16 deletion
+18
-16
backtracking/knight_tour.cpp
backtracking/knight_tour.cpp
+1
-1
computer_oriented_statistical_methods/Gaussian_elimination.cpp
...ter_oriented_statistical_methods/Gaussian_elimination.cpp
+1
-1
dynamic_programming/Cut Rod.cpp
dynamic_programming/Cut Rod.cpp
+1
-1
dynamic_programming/Fibonacci_Bottom_Up.cpp
dynamic_programming/Fibonacci_Bottom_Up.cpp
+1
-1
dynamic_programming/Fibonacci_Top_Down.cpp
dynamic_programming/Fibonacci_Top_Down.cpp
+1
-1
dynamic_programming/Longest Increasing Subsequence (nlogn).cpp
...ic_programming/Longest Increasing Subsequence (nlogn).cpp
+1
-1
dynamic_programming/longest_common_string.cpp
dynamic_programming/longest_common_string.cpp
+1
-1
graph/BFS.cpp
graph/BFS.cpp
+1
-1
graph/DFS.cpp
graph/DFS.cpp
+1
-1
graph/Kruskal.cpp
graph/Kruskal.cpp
+1
-1
graph/lca.cpp
graph/lca.cpp
+2
-1
others/matrix_exponentiation.cpp
others/matrix_exponentiation.cpp
+1
-1
range_queries/MO.cpp
range_queries/MO.cpp
+1
-1
range_queries/bit.cpp
range_queries/bit.cpp
+1
-1
range_queries/segTree.cpp
range_queries/segTree.cpp
+2
-1
sorting/Tim Sort.cpp
sorting/Tim Sort.cpp
+1
-1
未找到文件。
backtracking/knight_tour.cpp
浏览文件 @
f659bcc9
#include
<bits/stdc++.h
>
#include
<iostream
>
# define n 8
/**
...
...
computer_oriented_statistical_methods/Gaussian_elimination.cpp
浏览文件 @
f659bcc9
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
main
()
...
...
dynamic_programming/Cut Rod.cpp
浏览文件 @
f659bcc9
...
...
@@ -3,7 +3,7 @@ contains prices of all pieces of size smaller than n. Determine
the maximum value obtainable by cutting up the rod and selling
the pieces.*/
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
cutrod
(
int
p
[],
int
n
)
{
...
...
dynamic_programming/Fibonacci_Bottom_Up.cpp
浏览文件 @
f659bcc9
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
fib
(
int
n
)
{
...
...
dynamic_programming/Fibonacci_Top_Down.cpp
浏览文件 @
f659bcc9
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
arr
[
1000000
];
int
fib
(
int
n
)
...
...
dynamic_programming/Longest Increasing Subsequence (nlogn).cpp
浏览文件 @
f659bcc9
...
...
@@ -2,7 +2,7 @@
// in O(n log n)
// tested on : https://cses.fi/problemset/task/1145/
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
LIS
(
int
arr
[],
int
n
)
...
...
dynamic_programming/longest_common_string.cpp
浏览文件 @
f659bcc9
#include
<bits/stdc++.h
>
#include
<iosrteam
>
using
namespace
std
;
int
max
(
int
a
,
int
b
)
...
...
graph/BFS.cpp
浏览文件 @
f659bcc9
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
class
graph
{
...
...
graph/DFS.cpp
浏览文件 @
f659bcc9
#include <
bits/stdc++.h
>
#include <
iostream
>
using
namespace
std
;
int
v
=
4
;
void
DFSUtil_
(
int
graph
[
4
][
4
],
bool
visited
[],
int
s
)
...
...
graph/Kruskal.cpp
浏览文件 @
f659bcc9
#include
"bits/stdc++.h"
#include
<iostream>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
const
int
mx
=
1e6
+
5
;
...
...
graph/lca.cpp
浏览文件 @
f659bcc9
#include<bits/stdc++.h>
//#include<bits/stdc++.h>
#include <iostream>
using
namespace
std
;
// Find the lowest common ancestor using binary lifting in O(nlogn)
...
...
others/matrix_exponentiation.cpp
浏览文件 @
f659bcc9
...
...
@@ -18,7 +18,7 @@ Steps for Matrix Expo
The first element of this matrix is the required result.
*/
#include <
bits/stdc++.h
>
#include <
iostream
>
using
std
::
cin
;
using
std
::
cout
;
using
std
::
vector
;
...
...
range_queries/MO.cpp
浏览文件 @
f659bcc9
#include
"bits/stdc++.h"
#include
<iostream>
using
namespace
std
;
const
int
N
=
1e6
+
5
;
int
a
[
N
],
bucket
[
N
],
cnt
[
N
];
...
...
range_queries/bit.cpp
浏览文件 @
f659bcc9
// Binary Indexed Tree.
#include
<bits/stdc++.h
>
#include
<iostream
>
using
namespace
std
;
...
...
range_queries/segTree.cpp
浏览文件 @
f659bcc9
#include <bits/stdc++.h>
//#include <bits/stdc++.h>
#incldue <iostream>
#define MAX 4000000
using
namespace
std
;
typedef
long
long
ll
;
...
...
sorting/Tim Sort.cpp
浏览文件 @
f659bcc9
// C++ program to perform TimSort.
#include
<bits/stdc++.h
>
#include
<iostream
>
using
namespace
std
;
const
int
RUN
=
32
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录