whmnixx-CSDN博客

原创 PAT甲级1060 Are They Equal

AC代码#include<bits/stdc++.h>using namespace std;int n;void Change(string s,string &a,int &b){ while(s.length()>0&&s[0]=='0') { s.erase(s.begin()); } if(s[0]=='.') { s.erase(s.begin()); while(s.length()>0&&

2020-05-12 23:00:26 82

原创 PAT甲级1059 Prime Factors

AC代码#include<stdio.h>#include<math.h>int prime[50001],cn=0,p[100001]={0};void Prime(){ for(int i=2;i<100001;i++) { if(p[i]==0) { prime[cn++]=i; for(int j=i+i;j<100001;j+=i) { p[j]=1; } } }}int main(){ Pr

2020-05-12 22:59:18 82

原创 PAT甲级1058 A+B in Hogwarts

AC代码#include<stdio.h>int main(){ int g[3],s[3],k[3]; for(int i=0;i<2;i++) { scanf("%d.%d.%d",&g[i],&s[i],&k[i]); } int temp=k[0]+k[1],change=s[0]+s[1]; k[2]=temp%29; s[2]=(change+temp/29)%17; g[2]=g[0]+g[1]+(chan

2020-05-12 22:58:23 73

原创 PAT甲级1057 Stack

本来想用做的，重复的值保存其个数在对应的数组，但是逻辑还是太麻烦了；最后用的是算法笔记中的代码。#include<bits/stdc++.h>using namespace std;stack<int> s;int block[317]={0},num[100001]={0};void Median(int k){ int cn=0,cb=0; while(cn+block[cb]<k) { cn+=block[cb++]; } int change

2020-05-12 22:57:34 90

原创 PAT甲级1056 Mice and Rice

AC代码#include<bits/stdc++.h>using namespace std;vector<int> v[12];int main(){ int n,m,cn=0; scanf("%d%d",&n,&m); int key[n],rank[n],temp; for(int i=0;i<n;i++) { scanf("%d",&key[i]); } for(int i=0;i<n;i++)

2020-05-12 22:38:00 62

原创 PAT甲级1055 The World's Richest

AC代码#include<bits/stdc++.h>using namespace std;struct Person{ string name; int age,money;}p[100001];bool cmp(Person a,Person b){ if(a.money!=b.money) return a.money>b.money; else if(a.age!=b.age) return a.age<b.age; else return

2020-05-09 21:42:32 114

原创 PAT甲级1054 The Dominant Color

AC代码#include<bits/stdc++.h>using namespace std;int color[480001];int main(){ int n,m,k; scanf("%d%d",&n,&m); k=m*n; for(int i=0;i<k;i++) { scanf("%d",&color[i]); } sort(color,color+k); for(int i=0;i<=k/2;i++

2020-05-09 21:41:20 71

原创 PAT甲级1053 Path of Equal Weight

坑点如果一个节点的孩子中有权重相等的，下面的代码就不一定会得出正确的结果（题目好像没说兄弟节点之间权重互异吧)；写完我还以为有些测试点会通不过呢，谁知道测试点突然怎么友好，测试点似乎都是互异的；如果可能出现相同权重的话，就只能记录下所有的路径，然后再比较了。AC代码#include<bits/stdc++.h>using namespace std;vector<int> v[100],out;int n,m,s,w[101],pre[101];bool cmp(in

2020-05-09 21:40:26 113

原创 PAT甲级1052 Linked List Sorting

AC代码#include<cstdio>#include<algorithm>#include<vector>using namespace std;int Node[100001][2],b[200010];vector<int> v;int main(){ int n,s,add,key,next; scanf("%d%d",&n,&s); for(int i=0;i<n;i++) { scan

2020-05-09 21:28:40 61

原创 PAT甲级1051 Pop Sequence

AC代码#include<cstdio>#include<stack>using namespace std;int main(){ int m,n,k; scanf("%d%d%d",&m,&n,&k); while(k--) { int num[n],temp=1; for(int i=0;i<n;i++) scanf("%d",&num[i]); stack<int> s;

2020-05-09 21:27:37 76

原创 PAT甲级1050 String Subtraction

AC代码#include<stdio.h>int main(){ char s1[10001],c; int cn=0,tag[256]={0}; while((c=getchar())!='\n') { s1[cn++]=c; } while((c=getchar())!='\n') { tag[(int)c]=1; } fo...

2020-05-06 22:02:07 56

原创 PAT甲级1049 Counting Ones

AC代码#include<stdio.h>int P10(int cn){ int change=1; while(cn--) change*=10; return change;}int main(){ int n,num[10],cn=0,sum=0; scanf("%d",&n); while(n!=0) { num[cn++]=...

2020-05-06 22:00:12 92

原创 PAT甲级1048 Find Coins

AC代码#include<stdio.h>int main(){ int n,m,value,num[1001]={0}; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%d",&value); num[value]++; } int flag=0; ...

2020-05-06 21:34:45 75

原创 PAT甲级1047 Student List for Course

AC代码#include<bits/stdc++.h>using namespace std;void change(char out[],int id){ out[3]=id%10+'0'; id/=10; for(int i=2;i>=0;i--) { out[i]=id%26+'A'; id/=26; }}int main()...

2020-05-06 21:17:35 68

原创 PAT甲级1046 Shortest Distance

AC代码#include<bits/stdc++.h>using namespace std;int main(){ int n,m,dis,temp,p,q,Min; scanf("%d",&n); int d[n+2]; d[1]=0; for(int i=0;i<n;i++) { scanf("%d",&dis); ...

2020-05-06 21:16:26 102

原创 PAT甲级1045 Favorite Color Stripe

AC代码#include<bits/stdc++.h>using namespace std;int main(){ int n,m,k,cn=0,temp; scanf("%d",&n); int status[n+1]={0},num[10001]; scanf("%d",&m); for(int i=1;i<=...

2020-05-05 22:36:55 79

原创 PAT甲级1044 Shopping in Mars

AC代码#include<stdio.h>int num[100001],dp[100001],pre[100001];int main(){ int n,k; scanf("%d%d",&n,&k); for(int i=0;i<n;i++) { scanf("%d",&num[i]); }...

2020-05-05 22:35:34 80

原创 PAT甲级1043 Is It a Binary Search Tree

AC代码#include<bits/stdc++.h>using namespace std;struct Node{ Node *left,*right; int data;};vector<int> ini,pre,prem,post,postm;Node* root=NULL;void insert(Node* &root,int...

2020-05-05 22:34:11 79

原创 PAT甲级1042 Shuffling Machine

AC代码#include<stdio.h>int shuff[55],ini[55];void shuffing(){ int change[55]; for(int i=1;i<55;i++) { change[i]=ini[shuff[i]]; } for(int i=1;i<55;i++) { ...

2020-05-05 22:33:26 65

原创 PAT甲级1041 Be Unique

AC代码#include<stdio.h>int tag[10001]={0};int main(){ int n,flag=0; scanf("%d",&n); int num[n]; for(int i=0;i<n;i++) { scanf("%d",&num[i]); tag[n...

2020-05-05 22:32:20 51

原创 PAT甲级1040 Longest Symmetric String

AC代码#include<bits/stdc++.h>using namespace std;int dp[1001][1001];//dp[i][j]表示从i到j这一段是否是回文，1代表是int main(){ int cn=0,Max=1; char s[1001],c; while((c=getchar())!='\n') { ...

2020-05-04 22:37:06 80

原创 PAT甲级1039 Course List for Student

AC代码#include<bits/stdc++.h>using namespace std;int change(string s){ int sum=0; for(int i=0;i<3;i++) { sum=sum*26+s[i]-'A'; } return sum*10+s[3]-'0';}set<...

2020-05-04 22:32:20 45

原创 PAT甲级1038 Recover the Smallest Number

AC代码#include<bits/stdc++.h>using namespace std;bool cmp(string a,string b){ string c=a+b,d=b+a; return c<d;}int main(){ int n; string s; scanf("%d",&n); vec...

2020-05-04 22:28:31 47

原创 PAT甲级1037 Magic Coupon

AC代码#include<bits/stdc++.h>using namespace std;vector<int> p1,n1,p2,n2;bool cmp(int a,int b){ return a>b;}int main(){ long long sum=0; int nc,np,temp; scanf("%d",&a...

2020-05-04 22:26:01 60

原创 PAT甲级1036 Boys vs Girls

AC代码#include<bits/stdc++.h>using namespace std;int main(){ int n,Grade[2],grade; string Name[2],Id[2],name,id; char gender; Grade[0]=101;Grade[1]=-1; scanf("%d",&n);...

2020-05-04 22:23:38 64

原创 PAT甲级1035 Password

AC代码#include<bits/stdc++.h>using namespace std;int main(){ int n; scanf("%d",&n); string name[n],pwd[n]; vector<int> v; for(int i=0;i<n;i++) { int flag=0; cin>>n...

2020-05-03 22:30:57 49

原创 PAT甲级1034 Head of a Gang

AC代码#include<bits/stdc++.h>using namespace std;int father[2001],n,k,cn=0;int num[2001],w[2001],w1[2001];map<string,int> sti;map<int,string> its;struct Head{ string s; ...

2020-05-03 22:29:01 64

原创 PAT甲级1033 To Fill or Not to Fill

坑点（1）必须存在一个距离为0的加油站，否则哪也去不了测试点4就是过不了，以后再回头看吧，，，#include<bits/stdc++.h>using namespace std;struct Sta{ double price; double dis;}sta[501];double cap,d,avg;int n;bool cmp(Sta a,St...

2020-05-03 21:59:29 472

原创 PAT甲级1032 Sharing

AC代码#include<bits/stdc++.h>using namespace std;struct Node{ int next; char data;}node[100001];int main(){ int a1,b1,n,a,next; char c; scanf("%d%d%d",&a1,&b1,&am...

2020-05-02 23:14:17 98

原创 PAT甲级1031 Hello World for U

AC代码#include<stdio.h>int main(){ int cn=0,a; char c[81],ch; while((ch=getchar())!='\n') { c[cn++]=ch; } a=(cn+2)/3; for(int i=0;i<a-1;i++) { ...

2020-05-02 22:58:37 58

原创 PAT甲级1030 Travel Plan

AC代码#include<bits/stdc++.h>using namespace std;const int INF=1000000000;const int maxn=501;int G[maxn][maxn],d[maxn],cost[maxn][maxn],c[maxn],pre[maxn];int n,m,s,d1;bool vis[maxn]={false}...

2020-05-02 22:57:19 48

原创 PAT甲级1029 Median

AC代码#include<bits/stdc++.h>using namespace std;int num[400001];int main(){ int n,cn=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&num[cn++]); ...

2020-05-02 22:39:13 112

原创 PAT甲级1028 List Sorting

AC代码#include<bits/stdc++.h>using namespace std;struct Student{ int id; char name[10]; int score;};bool cmp1(Student a,Student b){ return a.id<b.id;}bool cmp2(Student a...

2020-05-02 22:37:31 62

原创 PAT甲级1027 Colors in Mars

AC代码#include<stdio.h>int out[2];void Out(){ for(int i=0;i<2;i++) { if(out[i]<10){ printf("%d",out[i]); } else printf("%c",out[i]-10+'A'); ...

2020-05-02 22:35:04 54

原创 PAT甲级1026 Table Tennis

坑点最后一个一分的测试点还是过不了，心态大崩，，，（1）等待的队首是VIP的话，先选择当前空闲的最小编号的VIP桌，如果没有空闲的VIP桌，选择编号最小的普通桌（2）等待的队首是普通客人且等待队伍中没有VIP的话，就直接选择编号最小的桌子，就算是VIP桌也无所谓。（3）四舍五入时间的秒数差除以60，余数大于等于30才加一#include<bits/stdc++.h>usi...

2020-05-02 21:33:24 182

原创 PAT甲级1025 PAT Ranking

AC代码#include<bits/stdc++.h>using namespace std;struct Testee{ string id; int frank,lnum,lrank,score;}t[30010];int cn=0;bool cmp(Testee a,Testee b){ if(a.score==b.score) return...

2020-04-17 21:48:37 53

原创 PAT甲级1024 Palindromic Number

AC代码#include<bits/stdc++.h>using namespace std;vector<int> n;int judge(){ int s=n.size(),flag=0; for(int i=0;i<s;i++) { if(n[i]!=n[s-1-i]) { ...

2020-04-17 21:47:28 69

原创 PAT甲级1023 Have Fun with Numbers

AC代码#include<bits/stdc++.h>using namespace std;int main(){ string s; int num[10]={0},j=0; cin>>s; for(int i=s.size()-1;i>=0;i--) { int temp=s[i]-'0'; ...

2020-04-17 21:45:21 54

原创 PAT甲级1022 Digital Library

坑点如果查询输入的年份用int类型存储，输出时要用%04d，查询中的年份可能小于1000#include<bits/stdc++.h>using namespace std;struct Book{ int id; string title,author; vector<string> key; string pub; int...

2020-04-17 21:43:31 79

原创 PAT甲级1021 Deepest Root

AC代码#include<bits/stdc++.h>using namespace std;int n,cn=0,Max;vector<int> v[10001],temp[10001];bool vis[10001]={false};void DFS(int i,int cn){ vis[i]=true; temp[cn].push_bac...

2020-04-17 21:15:17 65

空空如也

空空如也