PAT
南方铁匠
在深度学习和体系结构熔炉的铁匠
展开
-
【PAT】 A1009 Product of Polynomials
This time, you are supposed to findA×BwhereAandBare two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the informa...原创 2020-02-14 20:42:34 · 86 阅读 · 0 评论 -
【PAT】 A1026 Table Tennis
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the ava...原创 2020-02-08 00:54:09 · 209 阅读 · 0 评论 -
【PAT】A1139 First Contact
Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually not contact her directly i...原创 2020-02-07 12:12:43 · 383 阅读 · 0 评论 -
【PAT】 A1007 Maximum Subsequence Sum
Given a sequence ofKintegers {N1,N2, ...,NK}. A continuous subsequence is defined to be {Ni,Ni+1, ...,Nj} where1≤i≤j≤K. The Maximum Subsequence is the continuous subsequen...原创 2020-02-06 23:17:37 · 128 阅读 · 0 评论 -
【PAT】A1014 Waiting in Line
Suppose a bank hasNwindows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:The space...原创 2020-02-06 21:46:43 · 135 阅读 · 0 评论 -
【PAT】A1006 Sign In and Sign Out
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you...原创 2020-02-06 11:20:01 · 148 阅读 · 0 评论 -
【PAT】A1051 Pop Sequence
Given a stack which can keepMnumbers at most. PushNnumbers in the order of 1, 2, 3, ...,Nand pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of t...原创 2020-02-05 16:27:55 · 209 阅读 · 0 评论 -
【PAT】Learning Notes
#算法##二分查找二分查找尽量不要使用递归,使用while循环解决查找范围内等于value的索引,当退出while循环时,即意味着在vec内没有对应mid的值,返回-1int find(int left,int right,int value){ while(left<=right){ int mid = left+(right-left)/2; ...原创 2020-02-05 13:39:21 · 209 阅读 · 0 评论 -
【PAT】A1099 Build A Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key. The right su...原创 2020-02-05 00:04:08 · 84 阅读 · 0 评论 -
【PAT】 A1085 Perfect Sequence
Given a sequence of positive integers and another positive integerp. The sequence is said to be aperfect sequenceifM≤m×pwhereMandmare the maximum and minimum numbers in the sequence, respecti...原创 2020-02-02 21:12:18 · 92 阅读 · 0 评论 -
【PAT】A1030 Travel Plan
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path b...原创 2020-02-01 19:53:20 · 108 阅读 · 0 评论 -
【PAT】A1097 Depulication On a Linked List
Given a singly linked listLwith integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each valueK, only the first node of which the value or a...原创 2020-02-01 12:30:40 · 155 阅读 · 0 评论 -
【PAT】A1094 Largest_Generation
终于在PAT上提交了第一题PAT Bug:1) node_tree 这种全局变量不要在main里创建,这样是在栈上。改成全局变量。2)scanf 竟然强制需要返回值调试Bug1)使用map进行layer和number的统计,但是map是按照key的升序,而不是value的升序2)在现在的编译器中,不支持auto声明iterator,必须指定类型声明3)在map迭代时,迭...原创 2020-01-31 18:22:33 · 84 阅读 · 0 评论 -
【PAT】PAT 笔记
修改code completion快捷键位CTRL+ENTER,帮助提示函数名称修改命令行提示符的属性,开启快速编辑模式,方便调试添加c++11语言标准支持开启代码调试功能对输入的字符串进行切割时,可以使用scanf按照指定格式分别输入达到切割效果,比如://对于这样的输入3-10 9911-5 87102-1 0//对于这种格式不绝对统一的字符串,可以自己构造相应的...转载 2020-01-31 17:54:34 · 166 阅读 · 0 评论 -
【PAT】A1087 ALL Roads Leads to Road
Dijkstra+DFS1) Dijkstra 解决最短路径,以HZH作为输入,得到 到达各个节点的最短路径 的前驱节点数组;2) DFS 以ROM作为输入,根据前驱节点数组,在每次递归DFS之前,使用数组保留路径,在最终到达递归边界时,根据数组的路径,得到一路上的weight总和注意:1)Dijkstra的算法,DFS算法2)尽量使用全局变量,引用传递参数太费心了。/...原创 2020-01-30 23:56:24 · 142 阅读 · 0 评论 -
【PAT】 A1013 使用并查集解决城市连通问题
/* * disjoint_set.cpp * * Created on: Jan 28, 2020 * Author: */#include <cstdio>#include <vector>#include <algorithm>using namespace std;int find_root(int *cities_...原创 2020-01-29 01:24:47 · 264 阅读 · 0 评论 -
【PAT】A1079 子节点供应商 叶子节点经销商问题
使用深度优先搜索,传递深度深度优先搜索函数返回当前节点的sales#include <cstdio>#include <vector>using namespace std;double product_price = 0.0;double percent = 0;struct Node { int node_id;// this is not n...原创 2020-01-27 18:05:35 · 98 阅读 · 0 评论 -
【PAT】A1007 最大子序列和问题
这个问题的本质在于seq[i] 的状态由seq[i-1]正负决定(seq[i] 为以i结尾的最大子序列)/* * max_subseq_sum.cpp * * Created on: Jan 26, 2020 * Author: */#include <cstdio>int max (int &a, int &b) { if (a...原创 2020-01-26 20:13:10 · 140 阅读 · 0 评论