摘要： DescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n .InputThe first line of the input file c 阅读全文

摘要： When a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segm 阅读全文

摘要： DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius i 阅读全文

摘要： DescriptionFarmer John loves to help the cows further their mathematical skills. He has promised them Hay-flavored ice cream if they can solve various mathematical problems.He said to Bessie, "Choose a six digit integer, and tell me what it is. Then extract the middle four digits. Square them a 阅读全文

摘要： 虽然没有A过去，但是自己学会了结构体的排序与运用。#include #include #include #include #include using namespace std;structTeam{ int rank ; stringname; int count ; int time ; int gm ; int Qus[7];}; Teamt[25];bool cmp1(Teama1,Teama2){ if(a1.count != a2.count) return a1.count > a2.count; else { if(a1.time != a2.time) ret... 阅读全文

摘要： 1.采用dfs：#include #include #include #include using namespace std;char map[25][25];int count = 1;int r,c;int dx[4] = {1,-1,0,0};int dy[4] = {0,0,1,-1};bool judge(int x,int y){ if(x= r || y =c) return 0; return 1;}void dfs(int x,int y){ map[x][y] = '#'; int nx = 0; int ny = 0; for(int i = 0 ; i 阅读全文

摘要： 学会用字符数组来存。还有读取数据的细节。两个年对应的关系。#include #include #include #include char Haab[20][10] = {"pop", "no", "zip", "zotz", "tzec", "xul","yoxkin", "mol", "chen", "yax", "zac", "ceh", " 阅读全文

摘要： 最主要的是分清楚从一个点遍历到周围的点，并且将遍历过的点做好标记。还有就是弄清楚分界。#include using namespace std;char map[105][105];int n,m;int dy[10] = {-1,-1,-1,0,0,1,1,1};int dx[10] = {-1,0,1,-1,1,-1,0,1};int judge(int x,int y){ if(y m|| x n) { return 0; } return 1;}void dfs(int x, int y)　{ map[x][y] = -1; for(i... 阅读全文

摘要： Farmer John went to cut some wood and leftN(2 ≤N≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport e 阅读全文

摘要： Many graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus - Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to school. Due to the bad traffic in Beijing, many students choose to ride a bike.We may assume that all 阅读全文