分类 POJ 下的文章

POJ 1006 Biorhythms

题目大意

求如下方程的最小正整数解。

$$\begin{cases} x \equiv p(\mod 23) \\ x \equiv e(\mod 28) \\ x \equiv i(\mod 33) \end{cases}$$

- 阅读剩余部分 -

POJ 3744 Scout YYF I

题目大意

给你一个数轴,数轴上有一坨地雷,你初始在1号点,设你现在在i号点,每次有概率p跑到i+1,有概率(1-p)跑到i+2,求活着跑完全程的概率。

- 阅读剩余部分 -

POJ 3723 Conscription

Description

Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege, he must pay 10000 RMB. There are some relationships between girls and boys and Windy can use these relationships to reduce his cost. If girl x and boy y have a relationship d and one of them has been collected, Windy can collect the other one with 10000-d RMB. Now given all the relationships between girls and boys, your assignment is to find the least amount of money Windy has to pay. Notice that only one relationship can be used when collecting one soldier.

xxx想招募士兵,这些士兵有男有女,招募是需要花钱的,如果招募某士兵的时候和他有关系的已经被招募了那么他就会少要钱,问全部招募最小开销。

- 阅读剩余部分 -

最新文章

最近回复

板块

杂项

    本站托管于学园都市
    由御坂网络提供CDN加速服务