oj题记 - 随笔分类(第4页) - 沈香茶

HDoj 2001 计算两点间的距离

摘要：Problem Description 输入两点坐标（X1,Y1）,（X2,Y2）,计算并输出两点间的距离。 Input 输入数据有多组，每组占一行，由4个实数组成，分别表示x1,y1,x2,y2,数据之间用空格隔开。 Output 对于每组输入数据，输出一行，结果保留两位小数。 Sample In 阅读全文

posted @ 2020-03-10 15:30 沈香茶阅读(140) 评论(0) 推荐(0)

HDoj 2000 ASCII码排序

摘要：Problem Description 输入三个字符后，按各字符的ASCII码从小到大的顺序输出这三个字符。 Input 输入数据有多组，每组占一行，有三个字符组成，之间无空格。 Output 对于每组输入数据，输出一行，字符中间用一个空格分开。 Sample Input qwe asd zxc S 阅读全文

posted @ 2020-03-10 14:49 沈香茶阅读(148) 评论(0) 推荐(0)

HDoj 1096 A+B for Input-Output Practice (VIII)

摘要：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. 阅读全文

posted @ 2020-03-09 21:04 沈香茶阅读(112) 评论(0) 推荐(0)

HDoj 1089 A+B for Input-Output Practice (I)

摘要：/*A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 213862 Accepte 阅读全文

posted @ 2020-03-09 16:17 沈香茶阅读(161) 评论(0) 推荐(0)

HDoj 1015 Safecracker

摘要：Problem Description Op tech briefing, 2002/11/02 06:42 CST "The item is locked in a Klein safe（克莱因保险柜） behind a painting in the second-floor library. 阅读全文

posted @ 2020-03-08 15:40 沈香茶阅读(224) 评论(0) 推荐(0)

HDoj 1008 Elevator

摘要：Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at w 阅读全文

posted @ 2020-03-07 13:50 沈香茶阅读(106) 评论(0) 推荐(0)

HDoj 1005 Number Sequence

摘要：#include<stdio.h> int F(int ,int ,int); int main() { int a=0; int b=0; int n=0; int res=0; while(1) { scanf("%d%d%d",&a,&b,&n); if(a==0&&b==0&&n==0) b 阅读全文

posted @ 2020-02-12 21:02 沈香茶阅读(98) 评论(0) 推荐(0)

HDoj 1002 A + B Problem II

摘要：Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of 阅读全文

posted @ 2020-02-01 15:42 沈香茶阅读(162) 评论(0) 推荐(0)

HDoj 1004 Let the Balloon Rise

摘要：Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guess 阅读全文

posted @ 2020-02-01 15:34 沈香茶阅读(128) 评论(0) 推荐(0)

随笔分类 - oj题记