2013年3月21日
A + B Problem
摘要： A + B ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 278755Accepted Submission(s): 82422 Problem DescriptionCalculateA + B.InputEach line will contain two integersAandB. Process to end of file.OutputFor each case, outputA + Bin one line.Sa 阅读全文
posted @ 2013-03-21 13:43 王文城 阅读(144) 评论(0) 推荐(0) 编辑
成绩转换
摘要： 成绩转换Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 52865Accepted Submission(s): 22850 Problem Description输入一个百分制的成绩t，将其转换成对应的等级，具体转换规则如下： 90~100为A; 80~89为B; 70~79为C; 60~69为D; 0~59为E;Input输入数据有多组，每组占一行，由一个整数组成。Output对于每组输入数据，输出一行。如果输入数据不在0~100范围内， 阅读全文
posted @ 2013-03-21 13:40 王文城 阅读(194) 评论(0) 推荐(0) 编辑
求绝对值
摘要： 求绝对值Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 47832Accepted Submission(s): 23469 Problem Description求实数的绝对值。Input输入数据有多组，每组占一行，每行包含一个实数。Output对于每组输入数据，输出它的绝对值，要求每组数据输出一行，结果保留两位小数。Sample Input123-234.00Sample Output123.00234.00AuthorlcySource 阅读全文
posted @ 2013-03-21 13:33 王文城 阅读(193) 评论(0) 推荐(0) 编辑
计算球体积
摘要： 计算球体积Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 59068Accepted Submission(s): 23370 Problem Description根据输入的半径值，计算球的体积。Input输入数据有多组，每组占一行，每行包括一个实数，表示球的半径。Output输出对应的球的体积，对于每组输入数据，输出一行，计算结果保留三位小数。Sample Input11.5Sample Output4.18914.137Hint#def 阅读全文
posted @ 2013-03-21 13:29 王文城 阅读(242) 评论(0) 推荐(0) 编辑
计算两点间的距离
摘要： 计算两点间的距离Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 68451Accepted Submission(s): 25856 Problem Description输入两点坐标（X1,Y1）,（X2,Y2）,计算并输出两点间的距离。Input输入数据有多组，每组占一行，由4个实数组成，分别表示x1,y1,x2,y2,数据之间用空格隔开。Output对于每组输入数据，输出一行，结果保留两位小数。Sample Input0 0 0 10 阅读全文
posted @ 2013-03-21 13:17 王文城 阅读(272) 评论(0) 推荐(0) 编辑
Sum Problem
摘要： Sum ProblemTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 201094Accepted Submission(s): 48459 Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. 阅读全文
posted @ 2013-03-21 13:10 王文城 阅读(155) 评论(0) 推荐(0) 编辑
2013年3月20日
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): 58298Accepted Submission(s): 32537Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners. You must 阅读全文
posted @ 2013-03-20 19:26 王文城 阅读(166) 评论(0) 推荐(0) 编辑
2013年3月19日
A + B Problem Too
摘要： A + B Problem TooTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8687Accepted Submission(s): 6543Problem DescriptionThis problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For exa 阅读全文
posted @ 2013-03-19 20:52 王文城 阅读(130) 评论(0) 推荐(0) 编辑
矩阵的顺序调换
摘要： 输入事例：1 2 3 43 4 5 76 4 5 41 5 4 3输出事例：1 3 6 12 4 4 53 5 5 41 5 4 3程序：#include<stdio.h>main(){ int a[100][100],i,j,temp; for(i=0;i<4;i++) for(j=0;j<4;j++) scanf("%d",&a[i][j]); for(i=0;i<4;i++) for(j=i;j<4;j++) { if(a[i][j]!=a[j][i]) { temp=a[i][j]; a[i][j]=a[j][i]; a[ 阅读全文
posted @ 2013-03-19 20:08 王文城 阅读(497) 评论(0) 推荐(0) 编辑
2013年2月25日
Q10222: Decode the Mad man
摘要： The ProblemOnce in BUET, an old professor had gone completely mad. He started talking with some peculiar words. Nobody could realize his speech and lectures. Finally the BUET authority fall in great trouble. There was no way left to keep that man working in university. Suddenly a student (definitely 阅读全文
posted @ 2013-02-25 17:06 王文城 阅读(322) 评论(0) 推荐(0) 编辑
下一页