![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
patest
Linfanty
啦啦啦~
展开
-
L1-006连续因子
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll inf = 0x3f3f3f3f3f3f3f3f; #define show(a) cout<<#a<&...原创 2018-02-20 17:17:03 · 440 阅读 · 0 评论 -
L1-011 两个getline ASCII码在0~255之间
// 这题有点意思了 改来改去的 / 其实一点意思都没有 #pragma comment(linker, "/STACK:1024000000,1024000000") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll inf = 0x3f3f3f3f3f3f3f3f; #defin...原创 2018-02-20 23:17:11 · 307 阅读 · 0 评论 -
L1-039 古风排版
去年天梯赛印象最深的一道没写出来的题link:https://www.patest.cn/contests/gplt/L1-039#pragma comment(linker, "/STACK:1024000000,1024000000") #include <bits/stdc++.h> using namespace std; typedef long long ll; const...原创 2018-02-23 14:55:49 · 322 阅读 · 0 评论 -
L2-001. 紧急救援 多条最短路 spfa/dijkstra
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll inf = 0x3f3f3f3f3f3f3f3f; #define show(a) cout<<#a<&...原创 2018-02-25 22:35:04 · 547 阅读 · 0 评论