qq2285580599的博客

scanf("%d %d %d %d", &N, &M, &c1, &c2);//Important!!!!!!!!!fill(G[0], G[0] + max_n*max_n, INF);for (int i = 0; i < N; i++) { scanf("%d", &single_weight[i]);} 

所有BFS都是在que.push()之后设置true的。

1034 Head of a Gang （30 分）One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a...

1107 Social Clusters （30 分）When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of...

1099 Build A Binary Search Tree （30 分）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...

1043 Is It a Binary Search Tree （25 分）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...

1053 Path of Equal Weight （30 分）Given a non-empty tree with root R, and with weight W​i​​ assigned to each tree node T​i​​. The weight of a path from R to L is defined to be the sum of the weights o...

#include<cstdio>#include<queue>using namespace std;const int max_n = 50;int N = 0;int level[max_n];int in[max_n];int post[max_n];bool flag[max_n] = { false };struct node { int d...

1，记住在scanf("%c",&a)输入一个字符型变量时，若是之前有输入回车，一定要用getchar()吸收。2，进行广度和深度优先搜索代码的调试时，还有那些输入数据较多的代码的调试时，一定要一步一步地，子函数都要进入，每一条语句都要看，能够在执行指向语句前及时改正错误，否则一旦错过去，可能得重新输入大量数据或者重新执行复杂的步骤。...

1097 Deduplication on a Linked List （25 分）Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K,...

1052 Linked List Sorting （25 分）A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointe...

1074 Reversing Linked List （25 分）Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then y...

1056 Mice and Rice （25 分）Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given map. The goal of each m...

1071 Speech Patterns （25 分）People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can ...

1100 Mars Numbers （20 分）People on Mars count their numbers with base 13:Zero on Earth is called "tret" on Mars. The numbers 1 to 12 on Earch is called "jan, feb, mar, apr, may, jun, jly, aug, sep...

1060 Are They Equal （25 分）If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×10​5​​ with simple chopping. No...

1063 Set Similarity （25 分）Given two sets of integers, the similarity of the sets is defined to be N​c​​/N​t​​×100%, where N​c​​ is the number of distinct common numbers shared by the two sets, and N...

1047 Student List for Course （25 分）Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student na...

1039 Course List for Student （25 分）Zhejiang 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 co...

1024 Palindromic Number （25 分）A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit...

1023 Have Fun with Numbers （20 分）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 happe...

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to be H(key)=key%TSiz...

不能将abs用于long long类型的数据，pat的c++编译器会报错。

1049 Counting Ones （30 分）The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. For example, given N bei...

1104 Sum of Number Segments （20 分）Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segme...

1101 Quick Sort （25 分）There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the p...

#include<cstdio>#include<cstdlib>#include<ctime>#include<algorithm>using namespace std;const int max_n = 100010;int A[max_n], n;int randPartition(int A[], int left, int...

以stdio为头文件时，在main函数外声明数组时，数组长度用数字而不要用变量。#include<stdio.h>#include<string.h>const int max_n = 100100;const int MOD = 1000000007;char str[max_n]; //这里极易编译出错，因为这里应该用数字...

1029 Median （25 分）Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9,...

1089 Insert or Merge （25 分）According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one...

1085 Perfect Sequence （25 分）Given a sequence of positive integers and another positive integer p. The sequence is said to be a perfect sequence if M≤m×p where M and m are the maximum and minimum num...

1044 Shopping in Mars （25 分）Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the cha...

1010 Radix （25 分）Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number.Now for any pa...

1085 Perfect Sequence （25 分）Given a sequence of positive integers and another positive integer p. The sequence is said to be a perfect sequence if M≤m×p where M and m are the maximum and minimum num...

版权声明：转载请注明出处 http://blog.youkuaiyun.com/TwT520Ly https://blog.youkuaiyun.com/TwT520Ly/article/details/53980196 基本性质：若p|(a-b)，则a≡b(%p)(a%p) = (...

1038 Recover the Smallest Number （30 分）Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can recove...

1033 To Fill or Not to Fill （25 分）With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the...

1070 Mooncake （25 分）Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the ...

在codeup墓地里面要使用abs必须要用#include<cmath>

1048 Find Coins （25 分）Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coi...