PAT甲级
石大笑吃得多
这个作者很懒,什么都没留下…
展开
-
1002 A+B for Polynomials (25分)
#include <iostream>using namespace std;int main() { double a, ans[1001] = { 0 }; int k,n,count = 0; cin >> k; for (int i = 0; i < k; i++) { cin >> n >> a; count++; ans[n] = a; } cin >> k; for (int i= 0; i &l.原创 2021-01-26 22:02:55 · 91 阅读 · 0 评论 -
1001 A+B Format (20分)
#include <iostream>#include <string>using namespace std;int main (){ int a,b; cin>>a>>b; if(a+b<0) cout<<"-"; string ans=to_string(abs(a+b)); for(int i=0;i<ans.length();i++){ cout<<ans[i]; if(i!=an.原创 2021-01-26 21:11:56 · 95 阅读 · 0 评论 -
1003 Emergency (25分)
#include <iostream>using namespace std;int G[500][500] = { 0 };//路消耗 int N[500] = { 0 };//每个城市的人数int d[500] = { -1 };//到i的距离 int s[500] = { 0 };//到i最大救人数量int p[500] = { 0 };//到i的最短路径数量 bool v[500] = { false };int n, m, c1, c2;void Dj(int c1.原创 2020-11-16 22:21:36 · 131 阅读 · 0 评论 -
1034 Head of a Gang (30分)
#include<string>#include<iostream> #include<unordered_map> #include<vector> #include<algorithm>using namespace std;struct node { int value; int id;};int n, k, numb = 0,numbgang=0;vector<int> score(2000, 0).原创 2020-11-09 20:59:23 · 70 阅读 · 0 评论 -
1152 Google Recruitment (20分)
#include<string>#include<iostream>using namespace std;bool prime(int n){ if(n<=1) return false; for(int i=2;i*i<=n;i++) if(n%i==0) return false; return true;}int main(){ int n,k; string s; cin>>n>>k>>s; f.原创 2020-11-07 21:23:49 · 153 阅读 · 0 评论 -
1153 Decode Registration Card of PAT (25分)
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<unordered_map>using namespace std;struct student{ string number; int score; string lever; string site; string date; string id;};bool .原创 2020-11-07 21:21:00 · 148 阅读 · 0 评论 -
1155 Heap Paths (30分)
#include<iostream>#include<vector>using namespace std;int n;bool maxheap=true,minheap=true;vector<int> heap(1001,0);vector<int> list(1000,0);void print(int numb){ for(int i=0;i<numb;i++){ if(i) cout<<" "; cout&.原创 2020-11-05 21:40:11 · 108 阅读 · 0 评论 -
PAT甲级题目知识点总结
...原创 2020-11-05 20:36:09 · 182 阅读 · 0 评论