浙江大学PAT 甲级考试
文章平均质量分 56
qinweibig
这个作者很懒,什么都没留下…
展开
-
python knn分类算法
import mathimport operatordef euclideanDistance(inst1,inst2,length): distance=0 for x in range(length): distance+=pow((inst1[x]-inst2[x]),2) return math.sqrt(distance)def getN...原创 2018-09-13 15:14:02 · 183 阅读 · 0 评论 -
PAT程序设计考题——甲级1043(Is It a Binary Search Tree ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct node{ int num; node *lchild,*原创 2017-07-08 00:21:03 · 332 阅读 · 0 评论 -
PAT程序设计考题——甲级1066(Root of AVL Tree ) C++实现
点击打开pat链接#include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct node{ int num,height; node *原创 2017-07-06 01:02:55 · 287 阅读 · 0 评论 -
PAT程序设计考题——甲级1020( Tree traverse ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int pre[maxn];int post[maxn];原创 2017-07-14 20:18:40 · 302 阅读 · 0 评论 -
PAT程序设计考题——甲级1082( Read Number in Chinese ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010 int store[maxn];int num;str原创 2017-07-14 00:11:32 · 312 阅读 · 0 评论 -
PAT程序设计考题——甲级1009( Product of Polynomials ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct polo{ int zhi; double xi;};原创 2017-07-05 00:17:43 · 278 阅读 · 0 评论 -
PAT程序设计考题——甲级1065( A+B and C (64bit) ) C++实现
点击打开pat链接#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int main(){long long a,b,c;int n;bool flag;ci原创 2017-06-24 02:17:07 · 269 阅读 · 0 评论 -
PAT程序设计考题——甲级1017(Queueing at Bank ) C++实现
点击打开pat链接#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct customer{ int time,sertime;}newcustomer;原创 2017-06-24 01:46:04 · 224 阅读 · 0 评论 -
PAT程序设计考题——甲级1077(Kuchiguse ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010 vector sto; string temp;voi原创 2017-07-12 19:30:08 · 218 阅读 · 0 评论 -
PAT程序设计考题——甲级1107( Social clusters并查集) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int father[1010];int isroot[1010]={0};原创 2017-07-03 19:22:58 · 268 阅读 · 0 评论 -
PAT程序设计考题——甲级1102( Invert a Binary Tree ) C++实现
#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct node{//由于题目中直接 给出了节点关系 用静态二叉树比较方便原创 2017-07-21 01:44:01 · 227 阅读 · 0 评论 -
PAT程序设计考题——甲级1012( The best rank ) C++实现
自认为完美 但有两分没有调试成功点击打开链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct subject{原创 2017-07-16 01:52:15 · 565 阅读 · 0 评论 -
pat python B1046
num=int(input())qw=[[0 for col in range(0,4)] for row in range(0,num)]for i in range(0,num): qw[i]=input().split(" ")num1,num2=0,0for i in range(0,num): if int(qw[i][0])+int(qw[i][2])...原创 2018-09-03 13:18:38 · 127 阅读 · 0 评论 -
python PAT B1016
A,a,B,b=input().split()num1=A.count(a)num2=B.count(b)qw=''qw2=''if num1==0:qw=0if num2==0:qw2=0for i in range(0,num1): qw+=afor i in range(0,num2): qw2+=bprint(int(qw)+int(qw2))原创 2018-08-30 14:54:07 · 129 阅读 · 0 评论 -
PAT B1011 A+B 和 C(15 分)
num=int(input())for i in range(0,num): a,b,c=input().split() a=int(a) b=int(b) c=int(c) if a+b>c: print('Case #{}: {}'.format(i+1,'true')) else:print('Case #{}: {}'...原创 2018-08-29 12:24:10 · 363 阅读 · 0 评论 -
PAT程序设计考题——甲级1086( The best rank ) C++实现
点击打开链接 #include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct node{ int id; nod原创 2017-07-20 02:04:04 · 270 阅读 · 0 评论 -
PAT程序设计考题——甲级1003(Emergency ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct edge{ int end,weight;};st原创 2017-07-10 01:03:21 · 290 阅读 · 0 评论 -
PAT程序设计考题——甲级1094(The largest generation) C++实现
#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010 struct node{ vector child; int level;原创 2017-07-21 18:42:00 · 269 阅读 · 0 评论 -
PAT程序设计考题——甲级1090( Highest Price in Supply Chain ) C++实现
点击打开链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010 struct node{//记录最长路径 和个数还有更好的方法原创 2017-07-21 14:17:20 · 278 阅读 · 0 评论 -
PAT程序设计考题——甲级1079( Total Sales of Supply Chain ) C++实现
点击打开链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct node{ int pnum; vector c原创 2017-07-21 13:27:17 · 321 阅读 · 0 评论 -
PAT程序设计考题——甲级1053( Path of Equal Weight) C++实现
#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int s;struct node{//注意为什么才用先更遍历 是因为到达某个节点原创 2017-07-18 00:31:27 · 277 阅读 · 0 评论 -
PAT程序设计考题——甲级1098(Insertion or Heap Sort ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int start[maxn],heap[maxn],object[maxn];原创 2017-07-03 00:22:31 · 177 阅读 · 0 评论 -
PAT程序设计考题——甲级1008( elevator) C++实现
to PAT#include #include#include#include#include#include#includeusing namespace std;#define maxn 100010int main(){ int m; cin>>m; if(m==0) return 0; int store[maxn]; int s原创 2017-06-22 19:46:06 · 605 阅读 · 0 评论 -
PAT程序设计考题——甲级1014( Waiting in Line ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int line;struct windows{ int id;原创 2017-06-30 00:47:19 · 290 阅读 · 0 评论 -
PAT程序设计考题——甲级1002(A+B for Polynomials ) C++实现
TO PAT#include #include#include#include#includeusing namespace std;bool cmp(double a,double b){ return a>b;}int main(){ bool hush[10000]={false}; int exponent[10000]={0};原创 2017-06-18 23:39:11 · 295 阅读 · 0 评论 -
PAT程序设计考题——甲级1001( A+B Format ) C++实现
TO pat#include #include#include#include#includeusing namespace std;int main(){ int a,b; cin>>a>>b; int c=a+b; int temp=abs(c); if(abs(c) return 0; } if(c int store[1001原创 2017-06-18 21:22:38 · 236 阅读 · 0 评论 -
PAT程序设计考题——甲级1046(循环最短距离) C++实现
to PAT#include#include#include#include#includeusing namespace std;int main(){ int path[100010],left[100010]={0};//数组尽量大一点 int num,sum=0; cin>>num; for(int i=1;i {cin>>path[i]原创 2017-06-18 19:01:06 · 145 阅读 · 0 评论 -
PAT程序设计考题——甲级1042(洗牌机) C++实现
TO PAT#include#include#include#include#includeconst int maxn=10010;const int maxc=210;using namespace std;int main(){int times;cin>>times;int start[55],next[55],end[55];for(原创 2017-06-18 13:17:08 · 288 阅读 · 0 评论 -
PAT程序设计考题——甲级1068 (背包问题) C++实现
to PAT#include#include#include#include#includeconst int maxn=10010;const int maxc=210;using namespace std;int q=0;bool flag[10010];int coin[10010];bool cmp(int a,int b){ return原创 2017-06-18 08:25:03 · 226 阅读 · 0 评论 -
PAT程序设计考题——甲级1007 (最大连续子序列和) C++实现
#include #includeusing namespace std;int main(){ int k; scanf("%d",&k); int qw[10010]; int s[10010]={0}; int dp[10010]; bool flag=true; for(int i=0;iscanf("%d",&qw[i]); if(qw[i原创 2017-06-16 09:21:14 · 332 阅读 · 0 评论 -
PAT程序设计考题——甲级1045 (最长不下降子序列) C++实现
传送门原创 2017-06-16 13:34:18 · 261 阅读 · 0 评论 -
PAT程序设计考题——甲级1040 (最长回文串) C++实现
#include #include#include#include#includeconst int maxn=10010;const int maxc=210;using namespace std; int main() {int ans=1; string a; getline(cin,a); int len=a.length();原创 2017-06-17 15:59:58 · 305 阅读 · 0 评论 -
PAT程序设计考题——甲级1030(Travel Plan) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct highway{ int end; int原创 2017-07-11 11:27:19 · 296 阅读 · 0 评论 -
PAT程序设计考题——甲级1011( World Cup Betting ) C++实现
#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010struct ticket{ int result; double weigh原创 2017-07-11 12:00:12 · 268 阅读 · 0 评论 -
PAT程序设计考题——甲级1057( stock 分块查询) C++实现
to PAt 注意这题有5分的点没有通过 实在 查不出错误如果大牛能指出不胜感激#include #include#include#include#include#include#includeusing namespace std;const int maxn=100001;const int j=sqrt(100001);int tab原创 2017-06-22 19:28:51 · 223 阅读 · 0 评论 -
PAT程序设计考题——甲级1019( General Palindromic Number ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int store[maxn];int num,base;原创 2017-07-11 20:03:42 · 246 阅读 · 0 评论 -
PAT程序设计考题——甲级1031(Hello World for U) C++实现
#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int main(){ string a; cin>>a; int m=a原创 2017-07-11 19:18:24 · 245 阅读 · 0 评论 -
PAT程序设计考题——甲级1027(Colors in Mars ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int store[maxn]={0};int num,ba原创 2017-07-11 20:58:52 · 220 阅读 · 0 评论 -
PAT程序设计考题——甲级1058(A+B in Hogwarts ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010int result[3]={0};int main()原创 2017-07-11 21:16:46 · 287 阅读 · 0 评论 -
PAT程序设计考题——甲级1035( Password ) C++实现
点击打开pat链接#include #include#include#include#include#include#include#include#includeusing namespace std;#define INF 100000000#define maxn 100010bool modefy[maxn]={false};str原创 2017-07-11 23:26:26 · 218 阅读 · 0 评论