chaoer

摘要： 问题:给定一个十进制整数N,求出从1到N的所有整数中出现”1”的个数。 例如：N=2时 1,2出现了1个 “1” 。N=12时 1,2,3,4,5,6,7,8,9,10,11,12。出现了5个“1”。回答：#include#include#includelong long int Count(lon... 阅读全文

摘要： 问题：There are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible. 输入:For eac... 阅读全文

摘要： 问题：输入三角形三边长，判断是否是直角三角形写出算法。InputThe inputs start with a line containing a single integer n. Each of the n following lines contains one test case. Each... 阅读全文