2016年11月_Sureina

原创实验报告二叉树

一、二叉树的遍历 #include #include #include #define MAX 20 #define OK 1 #define ERROR 0 #define NULL 0 #define OVERFLOW 0 typedef char TElemType; typedef int Status; typedef struct BiTNode { TElemType

2016-11-30 18:44:45 725

原创 HDU 5914 - Triangle

Problem Description Mr. Frog has n sticks, whose lengths are 1,2, 3⋯n respectively. Wallice is a bad man, so he does not want Mr. Frog to form a triangle with three of the sticks here.

2016-11-28 19:49:46 379

原创 UVA 11426 - GCD Extreme(II)

题意：求sum(gcd(i,j),1 1.建立递推关系，s(n)=s(n-1)+gcd(1,n)+gcd(2,n)+……+gcd(n-1,n); 2.设f(n)=gcd(1,n)+gcd(2,n)+……+gcd(n-1,n)。 gcd(x,n)=i是n的约数（x 而gcd(x,n)=i等价于gcd(x/i,n/i)=1，因此g(n,i)等价于phi(n/i).phi(x)为欧拉函数。

2016-11-22 16:43:12 370

原创走出迷宫功能【误】

打完区域赛之后好久没做题了，按理来说这样是不行的，但是因为区域赛战绩太烂，也和周围的人发生了一些事情，所以并没有心情做。。。这博文的主要内容是因为我没带优盘在机房写了个小作业，发在这好带走。 #include #include #include char maps[1000][1000]; bool vis[1000][1000]; int step[2][4] = {{1,

2016-11-21 20:04:25 450

原创 HDU 5738 - Eureka

Problem Description Professor Zhang draws n points on the plane, which are conveniently labeled by 1,2,...,n. The i-th point is at (xi,yi). Professor Zhang wants to know the number of best sets. As t

2016-11-17 18:42:40 446

原创 HDU 5734 - Acperience

Problem Description Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular ty

2016-11-10 16:47:34 414

原创 HDU 5727 - Necklace

Problem Description SJX has 2*N magic gems. N of them have Yin energy inside while others have Yang energy. SJX wants to make a necklace with these magic gems for his beloved BHB. To avoid making the

2016-11-08 15:26:57 378

原创 NYOJ 104 - 最大和

描述给定一个由整数组成二维矩阵（r*c），现在需要找出它的一个子矩阵，使得这个子矩阵内的所有元素之和最大，并把这个子矩阵称为最大子矩阵。例子： 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 其最大子矩阵为： 9 2 -4 1 -1 8 其元素总和为15。输入第一行输入一个整数n（0 每组测试数据：第

2016-11-07 19:11:38 358

原创 HDU 5952 - Counting Cliques

Problem Description A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of cliques

2016-11-05 18:25:17 737

原创 HDU 5724 - Chess

Problem Description Alice and Bob are playing a special chess game on an n × 20 chessboard. There are several chesses on the chessboard. They can move one chess in one turn. If there are no other che

2016-11-03 17:58:29 445

Shiina Mashiro no youni