- 博客(15)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 插入排序
示意图如下： 代码如下：#include//#includeusing namespace std;void insert_sort(int arr[],int length){ for (int i = 1; i < length; i++) { int key
2015-10-31 22:29:58
231
原创 杭电acm--1008
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 sec
2015-10-19 22:22:35
441
原创 杭电acm--1076
Ignatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?Given a positive integers Y which indicate the start year, and a positive integer N, yo
2015-10-19 21:22:26
604
原创 杭电acm--1064
Problem DescriptionLarry graduated this year and finally has a job. He’s making a lot of money, but somehow never seems to have enough. Larry has decided that he needs to grab hold of his financial
2015-10-13 22:33:33
502
原创 杭电acm--1049
An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches
2015-10-13 21:07:57
289
原创 杭电acm--1046
For years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are the “easy” problems
2015-10-13 20:40:30
311
原创 杭电acm--1040
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the numbe
2015-10-13 19:38:27
2073
原创 杭电acm--1037
InputInput to this problem will consist of a single data set. The data set will be formatted according to the following description.The data set will consist of a single line containing 3 number
2015-10-13 19:20:14
361
原创 杭电acm--1021
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an integer n. (n Output
2015-10-12 22:07:33
449
原创 杭电acm--1019
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.Inpu
2015-10-12 21:28:55
426
原创 杭电acm--1017
Given two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an integer N, then a blank l
2015-10-12 20:01:01
375
原创 杭电acm--2013
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two
2015-10-11 22:42:38
340
原创 杭电acm--1012
A simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n. Ou
2015-10-09 22:04:13
830
转载 杭电acm--1005
A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n). InpuThe inpu
2015-10-09 21:17:39
352
原创 杭电acm--2080
Problem Description这次xhd面临的问题是这样的：在一个平面内有两个点，求两个点分别和原点的连线的夹角的大小。注：夹角的范围[0，180]，两个点不会在圆心出现。 Input输入数据的第一行是一个数据T，表示有T组数据。每组数据有四个实数x1,y1,x2,y2分别表示两个点的坐标,这些实数的范围是[-10000,10000]。
2015-10-08 20:44:11
465
通讯簿管理系统
2015-09-20
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人