随笔分类 -  pat

PAT 甲级 1012 The Best Rank
摘要：输出格式：排名 科目代号（优先按照排 #include <iostream> #include <algorithm> #include <vector> using namespace std; const int INF = 0x3fffffff; int n,f; struct student 阅读全文
posted @ 2020-11-15 15:25 ggexs 阅读(153) 评论(0) 推荐(0)
PAT 甲级 1011  World Cup Betting
摘要：1 #include <iostream> 2 #include <cstdio> 3 #include <cmath> 4 5 void betAns(char c[], int n,int index); 6 int main() { 7 //std::cout << "Hello, World 阅读全文
posted @ 2020-11-11 21:10 ggexs 阅读(139) 评论(0) 推荐(0)
PAT 甲级 1010 Radix
摘要：#include <cstdio> #include <cstring> #include <cctype> #include <algorithm> using namespace std; typedef long long LL; struct bign { int len; int d[30 阅读全文
posted @ 2020-11-06 13:04 ggexs 阅读(147) 评论(0) 推荐(0)
PAT 甲级 1009 Product of Polynomials
摘要：https://blog.csdn.net/a845717607/article/details/86530433 map使用： 声明：map<键，值> 变量名； 存储： scanf("%d %lf",&e,&coe); mp1[e]=coe; 遍历：for(map<int,double>::ite 阅读全文
posted @ 2020-10-30 17:23 ggexs 阅读(104) 评论(0) 推荐(0)
1008 Elevator (20分)
摘要：#include <iostream> #include <cstdio> #include <cstring> int main() { //std::cout << "Hello, World!" << std::endl; int n , tmp=0, floor,ans=0; scanf(" 阅读全文
posted @ 2020-10-28 21:28 ggexs 阅读(101) 评论(0) 推荐(0)
PAT 甲级 1007 Maximum Subsequence Sum
摘要：#include <iostream> #include <cstdio> #include <cstring> const int maxn = 10050; struct node { int start,end; int sum; int value; }dp[maxn]; int main( 阅读全文
posted @ 2020-10-27 16:58 ggexs 阅读(162) 评论(0) 推荐(0)
PAT 甲级 1006 Sign In and Sign Out
摘要：1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 const int maxn = 110; 5 bool compare(int a[],int b[]){//a小于b返回真，否则返回假 6 if(a[0]!=b[0] 阅读全文
posted @ 2020-10-26 22:58 ggexs 阅读(180) 评论(0) 推荐(0)