![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT甲级
heavenbiang
奋战在IT的小程序媛一枚
展开
-
A1068 Find More Coins
#include<cstdio>#include<algorithm>using namespace std;const int maxn=10010;const int maxv=110;int w[maxn],dp[maxv]={0};bool choice[maxn][maxv],flag[maxn];bool cmp(int a,int b){ r...原创 2018-03-14 10:28:47 · 159 阅读 · 0 评论 -
A1104 Counting Leaves
给出一棵树,问每一层各有多少叶子结点#include<cstdio>#include<vector>#include<cmath>using namespace std;const int maxn=110;vector<int> G[maxn];int leaf[maxn]={0};int maxh=1;void DFS(int ...原创 2018-03-13 08:55:58 · 106 阅读 · 0 评论 -
A1106 Lowest Price in Supply Chain
#include<cstdio>#include<vector>#include<cmath>using namespace std;const int maxn=100010;const int INF=1000000000; ///****vector<int> Node[maxn];int n;double p,r;int n...原创 2018-03-13 08:16:23 · 105 阅读 · 0 评论 -
A1094 The Largest Generation
#include<cstdio>#include<vector>using namespace std;const int maxn=110;vector<int> Node[maxn];int hashtable[maxn]={0};void DFS(int index,int level){ hashtable[level]++; for...原创 2018-03-13 07:47:59 · 119 阅读 · 0 评论 -
A1090 Hightest Price in Supply Chain
#include<cstdio>#include<vector>#include<cmath>using namespace std;const int maxn=100010;vector<int> child[maxn];double p,r;int n,maxdepth=0,num=0;void DFS(int index,i...原创 2018-03-13 07:03:26 · 93 阅读 · 0 评论 -
A1079 Total State of Supply Chain
又回来了,忙了几天别的考试,发现不知不觉又一个星期未敲代码,这可不算好的程序员干的事,敲起来,快考试啦#include<cstdio>#include<cmath>#include<vector>using namespace std;const int maxn=100010;struct node{ double data; vector&...原创 2018-03-12 21:38:28 · 140 阅读 · 0 评论 -
A1103 Integer Factorization
#include<cstdio>#include<cmath>#include<vector>#include<algorithm>using namespace std;int n,k,p,maxFacSum=-1;vector<int> fac,temp,ans;void init(){ int i=1; do...原创 2018-03-05 20:45:57 · 211 阅读 · 0 评论 -
A1052 Linked List Sorting
#include<cstdio>#include <algorithm>using namespace std;struct NODE { int address, key, next; bool flag;}node[100000];int cmp1(NODE a, NODE b) { return !a.flag || !b.flag ...原创 2018-03-05 17:29:37 · 97 阅读 · 0 评论 -
A1032 Sharing
#include<cstdio>#include<algorithm>using namespace std;int main(){ int first1,first2,n; scanf("%d%d%d",&first1,&first2,&n); char data[100010]; int next[100010]; int li...原创 2018-03-05 16:13:28 · 103 阅读 · 0 评论 -
A1056 Mice and Rice
注:如果当前剩下的老鼠可以分为group组,那么这一组里面没有晋级的老鼠排名就是group+1#include <iostream>#include<cstdio>#include <queue>#include <vector>#include <algorithm>using namespace std;struct no...原创 2018-03-05 14:16:25 · 130 阅读 · 0 评论 -
A1051 Pop Sequence
#include<cstdio> #include<stack> #include<vector> using namespace std; int main() { int m,n,k; scanf("%d%d%d",&m,&n,&k); vector<int> v(n+2); stack<原创 2018-03-05 11:18:54 · 74 阅读 · 0 评论 -
A1054 The Dominant Color
#include<cstdio>#include<map>using namespace std;int main(){ int m,n,col; map<int,int> count; scanf("%d%d",&m,&n); for(int i=0;i<n;i++) { for(int j=0;j<m;j++...原创 2018-03-05 00:30:26 · 117 阅读 · 0 评论 -
A1063 Set Similarity
#include<cstdio>#include<set>using namespace std;const int N=51;set<int> st[N];void compare(int x,int y)///x,y均为int型!!!{ int totalnum=st[y].size(); int samenum=0; for(set<...原创 2018-03-04 22:26:16 · 87 阅读 · 0 评论 -
A1047 Student List for Course
#include<cstdio>#include<vector>#include<algorithm>using namespace std;const int maxn=400010;const int maxc=2510;char name[maxn][5];///***定义二维数组存储姓名 vector<int> v[maxc]...原创 2018-03-04 21:19:02 · 105 阅读 · 0 评论 -
A1039 Course List for Student
思路:用hash将学生姓名转换为int,然后存到vector数组中#include<cstdio>#include<vector>#include<algorithm>using namespace std;const int maxn=26*26*26*10+1;vector<int> v[maxn]; ////*****注意写法,这样...原创 2018-03-04 20:44:28 · 197 阅读 · 0 评论 -
A1024 Palindromic Number
#include<iostream>#include<string>#include<algorithm>using namespace std;string s;void add(string t){ int len=s.length(),carry=0; for(int i=0;i<len;i++)///两个字符串从高位相加,最后逆转,...原创 2018-03-04 19:54:39 · 164 阅读 · 0 评论 -
A1020 Tree Traversals
#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;const int maxn=50;struct node{ int data; node* lchild; node* rchild;};int pre...原创 2018-03-05 22:16:47 · 101 阅读 · 0 评论 -
A1086 Tree Traversals Again
#include<cstdio>#include<cstring>#include<stack>#include<algorithm>using namespace std;const int maxn=50;struct node{ int data; node* lchild; node* rchild;};int pr...原创 2018-03-05 22:49:17 · 101 阅读 · 0 评论 -
A1040 Longest Symmetric String
#include<cstdio>#include<cstring>const int maxn=1010;char S[maxn];int dp[maxn][maxn];int main(){ gets(S); int len=strlen(S),ans=1; memset(dp,0,sizeof(dp)); for(int i=0;i<len;...原创 2018-03-14 10:08:54 · 134 阅读 · 0 评论 -
A1045 Favorite Color Stripe
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxc=210;const int maxn=10010;int HashTable[maxc];int A[maxn],dp[maxn];int main(){ int n,...原创 2018-03-14 09:48:06 · 148 阅读 · 0 评论 -
A1007 Maximum Subsequence Sum
#include<cstdio>const int maxn=10010;int a[maxn],dp[maxn];int s[maxn]={0};int main(){ int n; scanf("%d",&n); bool flag=false; for(int i=0;i<n;i++) { scanf("%d",&a[i]); ...原创 2018-03-14 09:35:28 · 153 阅读 · 0 评论 -
A1087 All Roads Lead to Rome
#include<iostream>#include<cstdio>#include<cstring>#include<map>#include<string>#include<algorithm>using namespace std;const int MAXV=210;const int INF=1000...原创 2018-03-14 09:15:34 · 257 阅读 · 0 评论 -
A1030 Travel Plan
#include<cstdio>#include<cstring>#include<vector>#include<algorithm>using namespace std;const int maxv=510;const int INF=1000000000;int n,m,st,ed,G[maxv][maxv],cost[max...原创 2018-03-14 07:48:01 · 237 阅读 · 0 评论 -
A1003 Emergency
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxv=510;const int INF=1000000000;int n,m,st,ed,G[maxv][maxv],weight[maxv];int d[maxv],w[maxv...原创 2018-03-14 00:41:27 · 133 阅读 · 0 评论 -
A1076 Forwards on Weibo
#include<cstdio>#include<cstring>#include<vector>#include<queue>using namespace std;const int maxv=1010;struct Node{ int id; int layer;};vector<Node> adj[maxv]...原创 2018-03-14 00:08:16 · 137 阅读 · 0 评论 -
A1034 Head of aGang
#include<iostream>#include<string>#include<map>using namespace std;const int maxn=2010;map<int,string> intToString;map<string,int> stringToInt;map<string,int&g...原创 2018-03-13 23:31:16 · 128 阅读 · 0 评论 -
A1021 Deepest Root
#include<cstdio>#include<vector>#include<algorithm>using namespace std;const int N=100010;vector<int> G[N];bool isRoot[N];int father[N];int findFather(int x){ int a=...原创 2018-03-13 22:46:18 · 144 阅读 · 0 评论 -
A1013 Battle over cities
对于一个无向图,求删除一个顶点编号后需要增加多少条边,才能使图变为连通#include<cstdio>#include<cstring>#include<vector>using namespace std;const int N=1111;vector<int> G[N];bool vis[N];int currentPoint;...原创 2018-03-13 20:53:30 · 124 阅读 · 0 评论 -
A1107 Social Clusters
#include<cstdio>#include<algorithm>using namespace std;const int N=1010;int father[N];int isRoot[N]={0};int course[N]={0};int findFather(int x){ int a=x; while(x!=father[x]) {...原创 2018-03-13 17:53:30 · 98 阅读 · 0 评论 -
A1099 Build a Binary Search Tree
#include<cstdio>#include<queue>#include<algorithm>using namespace std;const int maxn=110;struct node{ int data; int lchild,rchild;}Node[maxn];int n,origin[maxn],num=0;void...原创 2018-03-13 15:08:50 · 107 阅读 · 0 评论 -
A1064 Complete Binary Search Tree
二叉排序树+完全二叉树,用数组存放完全二叉树,中序遍历元素#include<cstdio>#include<algorithm>using namespace std;const int maxn=1010;int n,number[maxn],CBT[maxn],index=0;void inorder(int root){ if(root>n) r...原创 2018-03-13 14:08:50 · 113 阅读 · 0 评论 -
A1043 Is it a Binary Search Tree
note:对镜像树的先序遍历只需要在原树的先序遍历时交换左右子树的访问顺序即可#include<cstdio>#include<vector>using namespace std;struct node{ int data; node *left,*right;};void insert(node* &root,int data){ if(r...原创 2018-03-13 11:00:03 · 87 阅读 · 0 评论 -
A1053 Path of Equal Weight
强调:在读入时对每个结点的所有子结点按权值从大到小排序,这样在递归的过程中总是会先访问所有子结点中权值更大的#include<cstdio>#include<vector>#include<algorithm>using namespace std;const int maxn=110;struct node{ int weight; vecto...原创 2018-03-13 10:09:49 · 138 阅读 · 1 评论 -
A1015 Reversible Primes
#include<cstdio>#include<cmath>bool isprime(int n){ if(n<=1) return false; int sqr=(int)sqrt(1.0*n); for(int i=2;i<=sqr;i++) { if(n%i==0) return false; } return true;}in...原创 2018-03-04 14:37:31 · 93 阅读 · 0 评论 -
A1081 Rational Sum
分数的几个模块,没有为什么,背下来!!!#include<cstdio>#include<algorithm>using namespace std;typedef long long ll;struct fraction{ ll up,down;};ll gcd(ll a,ll b){ return b==0?a:gcd(b,a%b);///欧几里...原创 2018-03-04 12:37:52 · 237 阅读 · 0 评论 -
A1049 Counting Ones
数学问题通常暴力的话会超时,规律自己又找不到,这类问题实际不好搞....#include<cstdio>int main(){ int n,a=1,ans=0; int left,now,right; scanf("%d",&n); while(n/a!=0) { left=n/(a*10); now=n/a%10; right=n%a; if(n...原创 2018-03-04 10:23:52 · 228 阅读 · 0 评论 -
A1077 Kuchiguse
又是一道很心酸的题目,感觉到处都对,原来却是少了\n,可见逻辑真心一点点差池都不能有,本题值得好好学习#include<cstdio>#include<iostream>#include<algorithm>#include<string>using namespace std;int main(){ int n; scanf("%d...原创 2018-03-01 23:00:20 · 451 阅读 · 0 评论 -
A1035 Password
由于尚处菜鸟级别string和cstring傻傻分不清,vector容器不太会用,输入只会scanf,晕现附借鉴的代码,有好多好多地方值得我学习#include<cstdio>#include<string>#include <iostream>#include <vector>using namespace std;int main() ...原创 2018-03-01 21:59:34 · 209 阅读 · 0 评论 -
A1005 Spell It Right
#include<cstdio>char eng[10][6]={"zero","one","two","three","four","five","six","seven","eight","nine"};int main(){ int n; scanf("%d原创 2018-03-01 20:55:21 · 73 阅读 · 0 评论 -
A1001 A+B Format
#include<cstdio>int main(){ int a,b; scanf("%d%d",&a,&b); int sum=a+b; if(sum<0) { sum=-sum; printf("-"); } int count=0; int c[10]={0};///数组大小为10足够 do { c[count++]=...原创 2018-03-01 20:33:47 · 86 阅读 · 0 评论