- 博客(17)
- 收藏
- 关注
RSS订阅原创 《奥巴马传》读书笔记
在那样一个无法预测甚至很残酷的世界里，幸好有安教会了奥巴马一些正确的价值观。首先是诚实；税务员来家里收税的时候，罗洛曾经把冰箱藏到储藏室。显然，这行为是遭到安摒弃的。她不希望奥巴马也这样做；然后是公正。印尼学校里的有钱家长会给教师送礼，安觉得这实在不应该；接着是直率。安对奥巴马说，如果你不喜欢我在你生日时送给你的衬衣，你可以直接说出来，而不是把它塞在衣柜的底部；最后是独立判断，不必为他人的评价改变自己值得一提的是，奥巴马在茁壮成长的青春期初期学会了打篮球。虽然技巧有限，但是激情无限。篮球让奥巴马认识了最.
2021-01-30 23:59:20
289
原创 PAT 1155 Heap Paths 笔记
#include <iostream>#include <stdio.h>#include <vector>using namespace std;const int maxm =1005;int arr[maxm];int flag1=0,flag2=0;int n;vector<int> v;void DFS(int s){ v.push_back(arr[s]); if(s*2>n){ for(in
2020-10-11 22:49:00
112
原创 [排序] PAT 1016 Phone Bills 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <vector>#include <queue>#include <stack>#include <math.h>#include <cstring>#include <map>#include <cctype>#define maxm 1
2020-08-29 17:44:45
93
原创 [DFS 树的遍历] 1079 Total Sales of Supply Chain 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <vector>#include <queue>#include <stack>#include <math.h>#include <cstring>#include <cctype>#define maxm 100010#define inf 0x3
2020-08-26 14:57:36
71
原创 [dijkstra] 1030 Travel Plan 笔记
#include <iostream>#include <sstream>#include <string>#include <sstream>#include <cstdio>#include <stdio.h>#include <string.h>#include <vector>#include <map>#include <queue>#include <
2020-08-25 00:02:03
75
原创 [图的遍历DFS] PAT 1034 Head of a Gang 笔记
#include <iostream>#include <sstream>#include <string>#include <sstream>#include <cstdio>#include <stdio.h>#include <string.h>#include <vector>#include <map>#include <set>#define maxm 20
2020-08-24 14:33:28
105
原创 [Dijkstra + DFS] PAT 1018 Public Bike Management 笔记
我的代码：有两个测试点错了，我知道错在哪，就是我不可以一下判读要运多少车，但是我觉的是题目自己表述不清楚，下次想改再改吧#include <iostream>#include <sstream>#include <string>#include <sstream>#include <cstdio>#include <stdio.h>#include <string.h>#include <vector&
2020-08-22 16:51:37
89
原创 [字符串] PAT 1108 Finding Average 笔记
我的代码：#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <sstream>#include <cctype>using namespace std;int main() { int t; cin>>t; string s1,s2; int counter=0
2020-08-20 17:19:49
104
1
原创 [字符串] PAT 1082. Read Number in Chinese 笔记
自己写的代码：#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <vector>using namespace std;string dig[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};string bit[4]={"","Shi","Bai
2020-08-20 09:01:53
81
原创 [字符串] PAT 1077 Kuchiguse 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <sstream>#include <math.h>using namespace std;int main() { string s1,s2,s3; int n; cin>>n; int a,b; get
2020-08-19 19:14:27
92
原创 [字符串] PAT 1073. Scientific Notation 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <sstream>using namespace std;int main() { string s; stringstream ss; cin>>s; int h=0,q; while(h<s.size()&am
2020-08-19 13:37:05
92
原创 [字符串] PAT 1061. Dating 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <sstream>#include <cctype>using namespace std;string days[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};int main() { bool c
2020-08-19 09:36:57
75
原创 [字符串] PAT 1035 Password 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <string>#include <sstream>using namespace std;int main() { int t=0; stringstream ss; char c; int counter=0; string s1,s2; scanf("
2020-08-18 21:08:22
71
原创 [字符串] PAT 1005 Spell It Right 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <cstdio>#include <vector>#include <queue>#include <math.h>#include <string>#include <string.h>#include <sstream>using n
2020-08-18 19:58:51
64
原创 PAT 1053 Path of Equal Weight 笔记
#include <iostream>#include <algorithm>#include <stdio.h>#include <vector>#include <queue>#include <math.h>using namespace std;vector<int> v[103];int path[103]={0};int o;void DFS(int id,int w,int p){
2020-08-18 15:57:08
88
原创 PAT 1003 Emergency(25分)笔记
1003 Emergency (25分)As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair
2020-08-14 15:09:19
114
原创 PAT 1001 A+B Format (20分)笔记
#include <stdio.h>#include <string>#include <iostream>#include <sstream>#define LL long longusing namespace std;int main(){ LL a,b; scanf("%lld%lld",&a,&b); LL c = a+b; stringstream ss; //转换为string
2020-08-11 10:11:23
112
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人