pat
文章平均质量分 52
guojiaqi007
这个作者很懒,什么都没留下…
展开
-
pat 1101. Quick Sort (25)
https://www.patest.cn/contests/pat-a-practise/1101参考了:http://www.sigmainfy.com/blog/pat-advanced-1101-quick-sort.html用了动态规划,记录每个元素左边的最大值,右边的最小值。查看当前元素是否比左边的最大大,比右边的最小小。#include #inc转载 2017-02-17 11:14:11 · 322 阅读 · 0 评论 -
pat 1003. Emergency (25)
https://www.patest.cn/contests/pat-a-practise/1003#include #include #include using namespace std;pair dijstra(vector> g, vector hands,int c1,int c2,int n) { vector v(n, 0); vector dist(n, IN原创 2017-02-22 21:00:34 · 187 阅读 · 0 评论 -
pat 1004. Counting Leaves (30)
https://www.patest.cn/contests/pat-a-practise/1004这个题做的不好一开始用 链接法构造树,但是发现如果有的节点的孩子信息先给出,但是他的父节点的孩子信息还没给出(就是这个点还没建出来)。是会出问题的。开始就就没想到!!!啊!后来参考了:http://www.liuchuo.net/archives/2229#i转载 2017-02-25 10:49:46 · 185 阅读 · 0 评论 -
pat 1007. Maximum Subsequence Sum (25)
https://www.patest.cn/contests/pat-a-practise/1007#include #include int main(){ int a[10000],n,maxSum=INT_MIN,maxBegin,maxEnd=0,sum=INT_MIN,begin = 0; scanf("%d", &n); for (int i = 0; i原创 2017-02-25 11:56:24 · 166 阅读 · 0 评论 -
pat 1021. Deepest Root (25)
https://www.patest.cn/contests/pat-a-practise/1021照抄了http://blog.csdn.net/jtjy568805874/article/details/50805402里面用到了求树的半径的方法,1)用任何一个点dfs 找到最深的深度,所有深度最深的node 是半径上的点。2)再用任意一个半径上的点dfs,找到转载 2017-03-05 17:40:40 · 279 阅读 · 0 评论 -
pat 1023. Have Fun with Numbers (20)
https://www.patest.cn/contests/pat-a-practise/1023#include #include #define rep(i,j,k) for(int i=j;i<=k;i++)const int maxn = 100;char s[maxn];int b[maxn], c[maxn], len, x;bool flag;int main(原创 2017-03-05 20:01:54 · 292 阅读 · 0 评论 -
pat 1048. Find Coins (25)
https://www.patest.cn/contests/pat-a-practise/1048参考了http://blog.csdn.net/jtjy568805874/article/details/50858073水题,想了dp,二分。 后来看了题解才发现好简单。#include #define inone(i) scanf("%d",&i)#d转载 2017-03-05 21:52:02 · 202 阅读 · 0 评论 -
pat 1042. Shuffling Machine (20)
https://www.patest.cn/contests/pat-a-practise/1042hash 一下顺序, 然后就是dp了。#include #include using namespace std;#define rep(i,j,k) for(int i=j;i<=k;i++)#define inone(i) scanf("%d",&i)const int原创 2017-03-09 12:07:33 · 292 阅读 · 0 评论 -
pat 1010. Radix (25)
https://www.patest.cn/contests/pat-a-practise/1010代码来自http://blog.csdn.net/jtjy568805874/article/details/50782565#include #include #include using namespace std;typedef unsigned long l转载 2017-02-27 08:17:56 · 326 阅读 · 0 评论 -
pat 1011 1011. World Cup Betting (20)
https://www.patest.cn/contests/pat-a-practise/1011代码来自 http://blog.csdn.net/jtjy568805874/article/details/50782588#include #include using namespace std;double x, y, z, ans = 1;int mai转载 2017-02-27 08:34:45 · 180 阅读 · 0 评论 -
pat 1012. The Best Rank (25)
https://www.patest.cn/contests/pat-a-practise/1012使用基数排序部分代码参考了:http://blog.csdn.net/jtjy568805874/article/details/50782867#include int wc[4][102];int ids[1000001];int scor[2001][4]原创 2017-02-27 09:52:43 · 237 阅读 · 0 评论 -
pat 1013. Battle Over Cities (25)
https://www.patest.cn/contests/pat-a-practise/1013代码来自http://blog.csdn.net/jtjy568805874/article/details/50791941#include #include #include using namespace std;typedef struct edge { i转载 2017-02-27 10:33:22 · 183 阅读 · 0 评论 -
pat 1042. Shuffling Machine (20)
1042. Shuffling Machine (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueShuffling is a procedure used to randomi转载 2017-03-09 17:47:34 · 213 阅读 · 0 评论 -
pat 1026. Table Tennis (30)
https://www.patest.cn/contests/pat-a-practise/1026根据http://blog.csdn.net/jtjy568805874/article/details/50809719 修改#include #include using namespace std;#define inthree(i,j,k) scanf("%d%d%d"转载 2017-03-06 13:17:06 · 307 阅读 · 0 评论 -
pat 1040. Longest Symmetric String (25)
https://www.patest.cn/contests/pat-a-practise/1040参考了:https://segmentfault.com/a/1190000003914228http://blog.csdn.net/jtjy568805874/article/details/50856440#include #include #inc转载 2017-02-27 17:07:13 · 202 阅读 · 0 评论 -
pat 1043. Is It a Binary Search Tree (25)
1043. Is It a Binary Search Tree (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Binary Search Tree (BST) is r转载 2017-03-09 20:20:12 · 313 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
https://www.patest.cn/contests/pat-a-practise/1002使用stl 版#include #include #include using namespace std;int main(){ int k,a; double b; map M; map::iterator it; for (int i = 0; i < 2原创 2017-02-22 20:15:25 · 196 阅读 · 0 评论 -
pat 1123. Is It a Complete AVL Tree (30)
https://www.patest.cn/contests/pat-a-practise/1123参考了:http://www.liuchuo.net/archives/2732#include #include using namespace std;typedef struct node { int v; struct node * left, *right;转载 2017-02-21 09:50:14 · 225 阅读 · 0 评论 -
pat 1122. Hamiltonian Cycle (25)
https://www.patest.cn/contests/pat-a-practise/1122参考了:http://www.liuchuo.net/archives/2748#include #include #include using namespace std;int ** graph;bool isConnected(int *v, int n)转载 2017-02-20 21:16:11 · 204 阅读 · 0 评论 -
pat 1103. Integer Factorization (30)
https://www.patest.cn/contests/pat-a-practise/1103参考了:http://blog.csdn.net/apie_czx/article/details/48415197此题不是素数的分解,所以用了搜索,因为k不大,n也不大。直接用pow(i,p) 会超时从小到大遍历,如果出现sum相同的(there i转载 2017-02-17 14:55:22 · 164 阅读 · 0 评论 -
pat 1105. Spiral Matrix (25)
https://www.patest.cn/contests/pat-a-practise/1105#include #include #include #include int dir[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };int N,m, n,map[1001][1001],a[1000001];bool myGreater(i原创 2017-02-17 16:36:15 · 278 阅读 · 0 评论 -
pat 1106. Lowest Price in Supply Chain (25)
https://www.patest.cn/contests/pat-a-practise/1106找最近的叶节点, bfs。#include #include #include using namespace std;typedef struct node { int k; vector edges;}Node;int n;double r, price;原创 2017-02-17 17:59:10 · 166 阅读 · 0 评论 -
pat 1107. Social Clusters (30)
https://www.patest.cn/contests/pat-a-practise/1107这道题我觉得有点歧异如果3个人分别喜欢1 22 44 6算几个圈子,我觉得是两个(1,2),和(2,3),因为1和3没有共同的爱好。但是pat的过的例子任何是一个圈子(1,2,3) , 1和3可以通过2联系起来。#include #inclu转载 2017-02-17 21:56:39 · 230 阅读 · 0 评论 -
pat 1108. Finding Average (20)
https://www.patest.cn/contests/pat-a-practise/1108笨方法:#include #include #include using namespace std;bool to2Doboule(string s, double &f) { double res = 0.0; int i = 0; if (s[i] == '-') i+原创 2017-02-18 11:19:56 · 245 阅读 · 0 评论 -
pat 1109. Group Photo (25)
https://www.patest.cn/contests/pat-a-practise/1109#include #include#include #include #include using namespace std;typedef struct peo { string name; int height; friend bool operator < (s原创 2017-02-18 14:44:36 · 311 阅读 · 0 评论 -
pat 1110. Complete Binary Tree (25)
https://www.patest.cn/contests/pat-a-practise/1110层序遍历,如果没有child时打标记,如果再出现inValid#include #include #include #include #include #include #define MAXN 21using namespace std;typedef s原创 2017-02-18 15:41:14 · 192 阅读 · 0 评论 -
pat 1111. Online Map (30)
https://www.patest.cn/contests/pat-a-practise/1111#include #include#include #include #includeusing namespace std;int timeC[500][500],len[500][500],visit[500],dist[500], from[500],nNode[500原创 2017-02-18 18:34:46 · 269 阅读 · 0 评论 -
pat 1112. Stucked Keyboard (20)
https://www.patest.cn/contests/pat-a-practise/1112#include #include #include #include #include using namespace std;bool map[256];int main(){ vector stuckKeysPre; set stuckKey; int k, reps原创 2017-02-18 20:32:28 · 252 阅读 · 0 评论 -
pat 1113. Integer Set Partition (25)
https://www.patest.cn/contests/pat-a-practise/1113#include #include using namespace std;int a[100001],k,n;void quicksort(int l,int r) { swap(a[l], a[(l + r) / 2]); if (l > r) return; i原创 2017-02-18 21:48:51 · 216 阅读 · 0 评论 -
pat 1114. Family Property (25)
https://www.patest.cn/contests/pat-a-practise/1114#include #include #include #include #include #include #include #include #include using namespace std;typedef struct family { int minId; in原创 2017-02-19 11:57:47 · 279 阅读 · 0 评论 -
pat 1115. Counting Nodes in a BST (30)
https://www.patest.cn/contests/pat-a-practise/1115#include typedef struct node { int v; struct node * left, * right; node(int x) :left(NULL),right(NULL) { v = x; }}Node;int deep,n1,n原创 2017-02-19 13:40:39 · 229 阅读 · 0 评论 -
pat 1117. Eddington Number(25)
https://www.patest.cn/contests/pat-a-practise/1117#include #include using namespace std;int a[1000001];int main(){ fill(a, a + 100001, 0); int n,len,maxLen = 0; scanf("%d",&n); for (int i原创 2017-02-19 14:58:25 · 353 阅读 · 0 评论 -
pat 1119. Pre- and Post-order Traversals (30)
https://www.patest.cn/contests/pat-a-practise/1119#include typedef struct node { int v; struct node * left, *right; node(int x) : left(NULL), right(NULL) { v = x; }}Node;bool build(No原创 2017-02-19 17:08:00 · 256 阅读 · 0 评论 -
pat 1016. Phone Bills (25)
https://www.patest.cn/contests/pat-a-practise/1016#include #include #include #include #include #include #define _CRT_SECURE_NO_WARNINGSusing namespace std;typedef struct item { int typ原创 2017-03-01 13:29:05 · 228 阅读 · 0 评论 -
pat 1020. Tree Traversals (25)
1020. Tree Traversals (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSuppose that all the keys in a binary tree原创 2017-03-12 12:39:54 · 310 阅读 · 0 评论