其他
Problem Description
Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.
But I also don't want to use...
Problem Description
Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.
Teacher HU and his 40 students wil...
算法训练 最大最小公倍数
时间限制：1.0s 内存限制：256.0MB
问题描述
已知一个正整数N，问从1~N中任选出三个数，他们的最小公倍数最大可以为多少。
输入格式
输入一个正整数N。
输出格式
输出一个整数，表示你找到的最小公倍数。
样例输入
9
样例输出
504
数据规模与约定
...
Problem Description
用半径相等的两个圆覆盖一个w*h的矩形，要求两圆不相交且必须在矩形内。求覆盖面积最大时两圆半径。
Input
输入包含多组数据，EOF结束。
每组数据包含一行，分别是两个实数w和h代表矩形的长和宽。
0
Output
每组数据输出一行表示圆的半径，小数点后保留三位。
Sample Input
2.000 1....
MMapDirectory继承自FSDirectory,针对jre至今没解决的Mmap close不回收空间(直至full gc才回收)的bug,lucene用hack方式回收(仅对sun jam)(线上目前还是出现这个问题，是什么情况,得确认一下)。其中64位linux下chunk是1G,MMAP之后返回ByteBuffer数组，其IndexInput类是MMapIndexInput。
FSD...
Problem Description
We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. ...
/***************************************************
二叉树的线性存储
by Rowandjj
2014/5/23
***************************************************/
#include
#include
using namespace std;
#define MAX 255
#define...
Problem Description
Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.
But I also don't want to use...
形态：
实现：
/***************************************8
二叉树的三叉链表存储
by Rowandjj
2014/5/23
*****************************************/
#include
using namespace std;
typedef int ElemType;
//------...
Problem Description
Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.
Teacher HU and his 40 students wil...