计算两点间的距离
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 94488 Accepted Submission(s): 36264
Problem Description
输入两点坐标(X1,Y1),(X2,Y2),计算并输出两点间的距离。
Input
输入数据有多组,每组占一行,由4个实数组成,分别表示x1,y1,x2,y2,数据之间用空格隔开。
Output
对于每组输入数据,输出一行,结果保留两位小数。
Sample Input
0 0 0 1 0 1 1 0
Sample Output
1.00 1.41
Author
lcy
第一次代码:
#include <stdio.h>
#include <math.h>
int main ()
{
double x1,x2,y1,y2,d;
while (scanf("%lf%lf%lf%lf",&x1,&x2,&y1,&y2)!=EOF)
{
d=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
printf ("%.2lf\n",d);
}
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11105740 | 2014-07-20 17:49:31 | Wrong Answer | 2001 | 0MS | 240K | 251 B | C++ | Hidden Secret |
第二次代码:
#include <stdio.h>
#include <math.h>
int main ()
{
double x1,x2,y1,y2;
while (scanf("%lf%lf%lf%lf",&x1,&x2,&y1,&y2)!=EOF)
{
printf ("%.2lf\n",sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)));
}
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11105790 | 2014-07-20 17:55:37 | Wrong Answer | 2001 | 15MS | 240K | 235 B | C++ | Hidden Secret |
第三次代码:
#include <cstdio>
#include <cmath>
int main()
{
double x1, y1, x2, y2;
while(scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2) != EOF)
printf("%.2lf\n", sqrt((double)((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))));
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11105818 | 2014-07-20 17:59:19 | Accepted | 2001 | 0MS | 240K | 239 B | C++ | Hidden Secret |
第四次代码:
#include <cstdio>
#include <cmath>
int main()
{
double x1, y1, x2, y2;
while(scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2) != EOF)
printf("%.2lf\n", sqrt((double)((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))));
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11105828 | 2014-07-20 18:00:28 | Accepted | 2001 | 0MS | 240K | 236 B | C++ | Hidden Secret |
第五次代码:
#include <stdio.h>
#include <math.h>
int main ()
{
double x1,x2,y1,y2,d;
while (scanf("%lf%lf%lf%lf",&x1,&x2,&y1,&y2)!=EOF)
{
d=(double)sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
printf ("%.2lf\n",d);
}
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11105872 | 2014-07-20 18:05:16 | Wrong Answer | 2001 | 15MS | 240K | 259 B | C++ | Hidden Secret |
表示此题始终不知道自己错在哪里