zhangpiu的专栏

#include #include #include using namespace std;string toString(int num){ if(num == 0) return string("0"); string s; int flag = 0; while(num){ s = char(num % 10 + '0') +

#include #include #include using namespace std;int main(){ std::vector coef(1001, 0); for(int i = 0; i < 2; ++i){ int k, exp; float c; scanf("%d", &k); for (int j = 0; j < k; ++j){

Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Eac

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

The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 sec

Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades

On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.Now given a string that you are supposed to

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number con

Given N rational numbers in the form "numerator/denominator", you are supposed to calculate their sum.Input Specification:Each input file contains one test case. Each case starts with a positive i

一、题目Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top positi

一、题目Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. TheMaximum Subsequence is the continuous subsequence which

This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the informa

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Si

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and E - Eng

排序后贪心#include #include #include #include using namespace std;int main(){ int n, p; scanf("%d%d", &n, &p); vector arr(n); for(int i = 0; i < n; ++i){ scanf("%lld", &arr[i]); } sort

所有的Push组成前序遍历，pop出来的顺序为中序遍历，转化为知道前序与中序，求后序遍历的问题#include #include #include #include using namespace std;struct Node{ int val; Node* left; Node* right; Node(int v) : val(v), left(nullptr

DFS， 走的过程，把符合条件的全记录下来#include #include #include #include using namespace std;#define MAX_CITY (205)#define INF (~(1<<31))vector> graph(MAX_CITY, vector(MAX_CITY, -1));vector happy(MAX_C

给定分子分母能准确给出其标准形式，期间需要求最大公约数，注意负数还有加括号的处理#include #include #include using namespace std;long long gcd(long long a, long long b){ while(b){ long long r = a%b; a = b; b = r; } return

判断是否为插入排序较为简单，只需找到第一个违反升序的数，判断从该数开始，其后所有的数是否与原数组一样，是则采用的插入排序，否则采用的归并排序。对于归并排序，关键是找到当前几个元素一组，然后进行下一次归并即可。#include #include #include #include using namespace std;bool isequal(vector& arr, vec

DFS走一遍，找出最大深度，如果最大深度的叶结点不止一个，则统计数量。#include #include #include #include using namespace std;vector> chains;int maxLevel = 0;int maxNum = 0;void dfs(int src, int level){ if(chains[src].e

主要在于理解题意，读了三遍，竟然没懂啥意思，最后还看了Uncle_Sugar 的解释才明白，真是给这题跪了。实质上是三维空间走一遍DFS或者BFS，统计一下连通区域中1的个数，其中如果一个连通区域1的个数小于给定阈值则不算进去。#include #include #include #include using namespace std;int graph[1286][1

直接建表查询#include #include #include #include using namespace std;int main(){ string owner, eva; cin >> owner >> eva; unordered_map table; for(auto& c : owner){ if(table.find(c) == table

线性走一遍，如果遇到P则把当前位置之前P的个数加1，遇到A则更新当前位置之前 PA 的个数，遇到 T 则统计PAT的个数#include #include using namespace std;int main(){ string s; cin >> s; const int N = 1000000007; long long sum = 0; int p = 0,

走一遍BFS，计算每一层的孩子数目，同时跟踪最大值#include #include #include #include using namespace std;vector> tree;int main(){ int n,m; scanf("%d%d", &n, &m); tree.resize(n+1, vector()); for(int i = 0; i

考查结构体排序，需要足够细心，大致思路是先将所有记录按车牌号排序，车牌号一样按时间排序，然后将合法的记录挑选出来。在查询的时候，维护当前已经查询到何处，下一次查询从当前位置开始。查询中，如果是进的，则把当前车辆数加1，出的则减1，同时更新车辆所停靠的时间，顺便选出最长停靠时间及相关车辆。#include #include #include #include #include #i

一开始思路错了，参考了这里的解法。#include #include #include using namespace std;int main(){ int n; scanf("%d", &n); pair p; int len = 0; int r = sqrt(n); for(int i = 2; i <= r; ++i){ int j = i;

先走一遍，找出所有有效的链表节点，然后按要求将节点分成两组，然后输出#include #include #include #include #include using namespace std;struct Node{ int add, key, next; Node(){} Node(int a, int k, int n) : add(a), key(k),

先判断是否为插入排序，不是的话找出堆排序进行到第几次，然后再来一次。#include #include #include #include using namespace std;int main(){ int n; scanf("%d", &n); vector arr(n), part(n); for(int i = 0; i < n; ++i){ sca

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l

从根结点开始，每次统计根节点左边孩子节点的数目n，以此确定当前根节点的key值，应该是所有的key排序之后的数组的第n+1个值，递归构建即可。#include #include #include #include #include using namespace std;struct Node{ int key, left, right; Node(){} Node

考查进制转换#include #include using namespace std;string t1[] = {"tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};string t2[] = {"", "tam", "hel", "maa",

It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts with a line

将排队的人按照到达的时间排序，然后开始轮询，会有四种情况：桌子是VIP，人是VIP，则直接分配桌子不是VIP，人也不是VIP，则直接分配桌子是VIP，人不是VIP，则往后找，是否存在一个VIP，且其到达时间早于该桌子的可用时间，找到则给VIP，当前的人继续等待，找不到这样的VIP，则把该桌子给当前用户桌子不是VIP，人是VIP，则检查桌子，是否还存在一张VIP桌子也空闲着，如果有这样一张V

Suppose a bank has N windows 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 s

A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pr

1. 采用计算月初00:00:00到现在的分钟数，然后将算的钱差值得出，比直接时间差值再求钱数简单2. 题目中只强调至少有一条匹配成功的记录，不是说每个人都至少有一条匹配成功的记录，所以没有成功匹配记录的人不输出#include #include #include #include #include using namespace std;struct Record

Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow li

DFS找符合条件的路径#include #include #include #include #include using namespace std;int cmax, n, sp, m, half;vector used;vector bikes;vector> edges;int minTime = numeric_limits::max();int m