pat考试

《DevC++支持C++11等与其软件分辨率低的解决办法》🔥小龙报：个人主页 🎬作者简介：C++研发，嵌入式，机器人方向学习者 ❄️个人专栏：《C语言》《算法》KelpBar海带Linux智慧屏项目《coze智能体开发平台》 ✨ 永远相信美好的事情即将发生

仰泳的熊猫

1013 Battle Over Cities#include<iostream> #include<cstring>//处理memset() using namespace std; bool visited[2200];//定义是否访问过该城市 int v[2000][2000];

剪一朵云爱着

PAT 1088 Rational Arithmetic这一题的大意是让模拟两个分数进行加减乘除运算，输出计算后的结果。看起来比较麻烦，但是认真的拆分成一步一步来做还是比较简单的要注意负数，0，等特殊情况在进行分数运算的时候，要注意通分和约分，这里会涉及到最小公倍数和最大公因数的算法的书写。过程就是模拟分数的运算。第一次提交的代码如下：

剪一朵云爱着

PAT 1086 Tree Traversals Again这一题的大意是说给出N个点，然后用栈的方式来建树，通过入栈和出栈的顺序来建立一棵二叉树，建立好树后，输出其后序遍历的序列。我的思路是，根据题目中的入栈出栈，模拟建树，建好树后输出其后序遍历序列。我刚开始采用的是用指针来构造树，比较麻烦，容易出错：

剪一朵云爱着

PAT 1065 A+B and C (64bit)这一题很浅显，就是让求A+B>C，如果符合条件则输出true，反之输出false 按道理说直接模拟即可，但是因为C的范围很大，在-2^63, 到 2^36之间，A和B同样会很大，那么就可能出现A+B溢出，即超出数据类型的范围。因此我们要考虑溢出的情况：

圣保罗的大教堂

1143 Lowest Common Ancestor (30)The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.

圣保罗的大教堂

1039 Course List for StudentZhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.

圣保罗的大教堂

1095 Cars on Campus (30)Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the nu

编程题 03-树2 List Leaves【PAT】编程练习题目集目录Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

编程题 02-线性结构3 Reversing Linked List【PAT】编程练习题目集目录Given a constant K K K and a singly linked list L L L, you are supposed to reverse the links of every K K K elements on L L L. For example, given L being 1 → 2 → 3 → 4 → 5 → 6 1→2→3→4→5→6 1→2→3→4→5→6, if K = 3 K=3 K=3, then you must output 3 → 2

软件工程师中级考试-上午知识点总结（下）连续式模型级别1：初始级，特点是混乱和不可预测；级别2：重复级，特点是项目得到管理监控和跟踪，有稳定的策划和产品基线；级别3：确定级，通过软件过程的定义和制度化确保对产品质量的控制；级别4：管理级,，特点是产品质量得到策划，软件过程基于度量的跟踪（关注产品和过程的质量）；级别5：优化级，特点是持续的过程能力改进。

不是小盆友

零基础上岸高项丨经验分享直接上干货！！！-❥选择题-❥案例分析-❥论文-●备考资料教材：官方教材第四版网课：苏景一软考题库：51CTO，刷题王

8、STL中的map和pair使用方法map提供了 key-value(键值对)的存储机制，这使得map成为处理具有唯一键的关联数据的理想选择。无重复值且有序。

圣保罗的大教堂

1170 Safari Park (25)A safari park（野生动物园）has K species of animals, and is divided into N regions. The managers hope to spread the animals to all the regions, but not the same animals in the two neighboring regions. Of course, they also realize that this is an NP complete prob

圣保罗的大教堂

1166 Summit (25)A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit is not a simple job. The ideal arrangement of one area is to invite those heads so that everyone is a direct friend of everyone.

圣保罗的大教堂

1164 Good in C (20)When your interviewer asks you to write "Hello World" using C, can you do as the following figure shows?

圣保罗的大教堂

1161 Merging Linked Lists (25)Given two singly linked lists L1=a1→a2→⋯→an−1→an and L2=b1→b2→⋯→bm−1→bm. If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a1→a2→bm→a3→a4→bm−1⋯. For example, given one list being 6→7 and the other one

圣保罗的大教堂

1156 Sexy Primes (20)Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six". (Quoted from http://mathworld.wolfram.com/SexyPrimes.html)

圣保罗的大教堂

1150 Travelling Salesman Problem (25)The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in co

圣保罗的大教堂

1133 Splitting A Linked List (25)Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside each class