若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1110: Problem A: Gopher II

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,450

题目描述

Problem A: Gopher II

The gopher family, having averted the canine threat, must face a new predator.
The are n gophers and m gopher holes, each at distinct (x, y) coordinates. A hawk arrives and if a gopher does not reach a hole in s seconds it is vulnerable to being eaten. A hole can save at most one gopher. All the gophers run at the same velocity v. The gopher family needs an escape strategy that minimizes the number of vulnerable gophers.
The input contains several cases. The first line of each case contains four positive integers less than 100: n, m, s, and v. The next n lines give the coordinates of the gophers; the following m lines give the coordinates of the gopher holes. All distances are in metres; all times are in seconds; all velocities are in metres per second.
Output consists of a single line for each case, giving the number of vulnerable gophers.

输入

暂无

输出

暂无

样例输入

2 2 5 10
1.0 1.0
2.0 2.0
100.0 100.0
20.0 20.0

样例输出

1

参考代码

#include <stdio.h>
double x[100][10];
double s;
main() 
{
    int i,j,k,n;
    while (2 == scanf("%d%d",&k,&n)) 
    {
        k++;
        for (i=0;i<n;i++) for (j=0;j<k;j++) x[i][j] = 0;
        for (i=0;i<k;i++) x[0][i] = 100.0/k;
        for (i=1;i<n;i++) 
        {
            for (j=0;j<k;j++) x[i][j] += x[i-1][j]/k;
            for (j=1;j<k;j++) x[i][j] += x[i-1][j-1]/k;
            for (j=0;j<k-1;j++) x[i][j] += x[i-1][j+1]/k;
        }
        for (s=i=0;i<k;i++) s += x[n-1][i];
        printf("%0.5lfn",s);
   }
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Dreams孤独患者 原站点 Skip
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist