杭电OJ
sinat_39173458
这个作者很懒,什么都没留下…
展开
-
杭电OJ acm_step1.1.2
原题目描述如下:Problem DescriptionYour task is to Calculate a + b. InputInput contains an integer N in the first line, and then N lines follow. Each line consists of a pair of int原创 2017-06-18 11:05:27 · 300 阅读 · 0 评论 -
航电OJ1000
作为编程小白,早已听说航电OJ大法,今天很激动地就打开OJ开始刷题,下面来看第一道: Problem Description Calculate A + B. Input Each line will contain two integers A and B. Process to end of file. Output For each case, output A + B in on原创 2017-06-14 21:06:44 · 453 阅读 · 0 评论 -
杭电ACM_step1.2.1
先上原题: 问题描述 在我们的城市中最高的建筑只有一个电梯。请求列表是由具有N个正数。这些数字表示在该楼层电梯将停止,按指定顺序。它的费用6秒移动电梯了一层楼,4秒,移动到下一层。电梯将保持在每站5秒。对于给定的请求列表,你是来计算花费履行名单上的请求的总时间。电梯是在开始的第0楼,没有当请求得到满足,返回到地面。输入 有多个测试用例。每一种情况下包含一个正整数N,接着加入N-正数。在输入的所原创 2017-06-22 00:27:39 · 263 阅读 · 0 评论 -
bootstrap开发小网页实例
慕课上跟着老师做的,之前没学过这些前端语言,不过调用别人所写的东西,好像就不需要写代码(哈哈)。看着自己写出来的东西(虽然是照着老师的写的),还是挺有成就感。下面看看成果。下面是代码: 现代浏览器博物馆原创 2017-06-30 20:25:04 · 1672 阅读 · 0 评论 -
1.2.3
原题:Problem DescriptionThe Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief wi原创 2017-06-30 20:08:04 · 215 阅读 · 0 评论 -
杭电acm_step1.2.2
先上原题:Problem DescriptionAn 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. Dur原创 2017-06-30 19:44:41 · 357 阅读 · 0 评论 -
acm_step1.1.6 1.1.7 1.1.8
1.1.6和1.1.4相似,不过是少了n=0时不做处理那个条件,1.1.7和1.1.1相似,不过多了输出一个空行而已。1.1.8和1.1.5类似,下面来看看1.1.8。 题目描述: Problem Description Your task is to calculate the sum of some integers.Input Input contains an integer N i原创 2017-06-18 16:39:09 · 276 阅读 · 0 评论 -
acm_step1.1.5
题目描述: Problem Description Your task is to calculate the sum of some integers.Input Input contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and then原创 2017-06-18 16:02:00 · 250 阅读 · 0 评论 -
acm_step1.1.4
题目描述: Problem Description Your task is to Calculate the sum of some integers.Input Input contains multiple test cases. Each test case contains a integer N, and then N integers follow in the same lin原创 2017-06-18 15:29:53 · 169 阅读 · 0 评论 -
杭电1001
Problem Description Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + … + n.Input The input will consist of a series of int原创 2017-06-14 22:33:35 · 252 阅读 · 0 评论