Codeforces Beta Round #93 (Div. 2 Only) A题
来源:互联网 发布:configparser python 编辑:程序博客网 时间:2024/06/05 02:33
这题,我弄了好久,就因为一个len=0.0未进行声明,导致我错了好几次!哎,无语了#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;int main(){ int n,k,i,j; double x[205],y[205],len; cin>>n>>k; for(i=0; i<n; i++) { cin>>x[i]>>y[i]; } len=0.0; for(i=0; i<n-1; i++) { len+=sqrt((x[i]-x[i+1])*(x[i]-x[i+1])+(y[i]-y[i+1])*(y[i]-y[i+1])); } len*=k; len/=50; printf("%0.9llf\n",len); return 0;}
- Codeforces Beta Round #93 (Div. 2 Only) A题
- Codeforces Beta Round #85 (Div. 2 Only) A题
- Codeforces Beta Round #87 (Div. 2 Only) A题
- Codeforces Beta Round #77 (Div. 2 Only) A题
- Codeforces Beta Round #84 (Div. 2 Only) A题
- Codeforces Beta Round #91 (Div. 2 Only) A题
- Codeforces Beta Round #92 (Div. 2 Only) A题
- Codeforces Beta Round #75 (Div. 2 Only) A题
- Codeforces Beta Round #69 (Div. 2 Only) A题
- Codeforces Beta Round #74 (Div. 2 Only) A题
- Codeforces Beta Round #25 (Div. 2 Only) A题
- Codeforces Beta Round #93 (Div. 2 Only)
- Codeforces Beta Round #75 (Div. 1 Only) A题
- Codeforces Beta Round #18 (Div. 2 Only)——A
- Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon
- Codeforces Beta Round #6 (Div. 2 Only) A. Triangle
- Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon
- Codeforces Beta Round #6 (Div. 2 Only) A. Triangle
- 数列转换(守恒思想)
- 跨apk访问SharedPreferences
- 八大排序算法:简单插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序等总结。
- 代码的抽象三原则
- 23种设计模式(11):责任连模式
- Codeforces Beta Round #93 (Div. 2 Only) A题
- @高三--我的一些语录,一些心情。上课无聊,写在草稿本上的
- POJ 3613 Cow Relays Floyd+快速幂加速
- sqoop错误解决
- 有关使用xsl输出csv格式文档的实践小结
- 跨平台调试,安卓真机无法显示个别图片的问题(一)
- 回调函数和函数指针
- VC++中用内存映射文件
- Flex 弹出窗派发事件主页面用于接收