| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 3192 | (*) Geometry Problem |
|
| 3193 | (*) Interleaved Periodic String |
|
| 3194 | (*) Lap time in a racing circuit |
|
| 3195 | (*) Lattice Squares |
|
| 3196 | (*) Trip Compulsion |
|
| 3197 | (*) Visible Lattice |
|
| 3198 | (*) XOR Sum |
|
| 3199 | (*) Find The Number |
|
| 3200 | (*) Love for Pizza |
|
| 3201 | (*) Succession |
|
| 3202 | (*) Carl the Ant |
|
| 3203 | (*) Heliport |
|
| 3204 | (*) Image Is Everything |
|
| 3205 | (*) Insecure in Prague |
|
| 3206 | (*) Intersecting Dates |
|
| 3207 | (*) Merging Maps |
|
| 3208 | (*) Navigation |
|
| 3209 | (*) Tree-Lined Streets |
|
| 3210 | (*) Suspense! |
|
| 3211 | (*) Air Traffic Control |
|
| 3216 | (*) Playing Field |
|
| 3217 | (*) Regular Expression Edit Distance |
|
| 3218 | (*) Square-Free Numbers |
|
| 3219 | (*) Soccer Teams |
|
| 3220 | (*) Sales Prediction |
|
| 3221 | (*) Cookie Piles |
|
| 3222 | (*) Christmas Play |
|
| 3223 | (*) Shopping Rush |
|
| 3224 | (*) Dividing Stones |
|
| 3225 | (*) Chemicals |
|
| 3243 | Constructing Roads |
|
| 3244 | Agri-Net |
|
| 3245 | ID Codes |
|
| 3246 | Generating Fast |
|
| 3247 | Combinations |
|
| 3248 | Game of Connections |
|
| 7315 | Frogger |
|
| 7423 | Binomial Showdown |
|
Description
http://poj.org/problem?id=2421
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
http://poj.org/problem?id=1258
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=82
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1039
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=305
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2424
Input
Output
Sample Input Download
Sample Output Download
Tags
Discuss
Description
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen, he wants to avoid swimming and instead reach her by jumping.
Unfortunately Fiona's stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps.
To execute a given sequence of jumps, a frog's jump range obviously must be at least as long as the longest jump occuring in the sequence.
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones.
You are given the coordinates of Freddy's stone, Fiona's stone and all other stones in the lake. Your job is to compute the frog distance between Freddy's and Fiona's stone.
Input
The input file will contain one or more test cases. The first line of each test case will contain the number of stones n ( 2<=n<=200). The next n lines each contain two integers xi, yi (0<=xi,yi<=1000) representing the coordinates of stone #i. Stone #1 is Freddy's stone, stone #2 is Fiona's stone, the other n-2 stones are unoccupied. There's a blank line following each test case. Input is terminated by a value of zero (0) for n.
Output
For each test case, print a line saying ``Scenario #x" and a line saying ``Frog Distance = y" where x is replaced by the test case number (they are numbered from 1) and y is replaced by the appropriate real number, printed to three decimals. Put a blank line after each test case, even after the last one.
Sample Input Download
Sample Output Download
Tags
Discuss
Description
In how many ways can you choose k elements out of n elements, not taking order into account?
Write a program to compute this number.
Input
The input file will contain one or more test cases.
Each test case consists of one line containing two integers n (n>=1) and k (0<=k<=n).
Input is terminated by two zeroes for n and k.
Output
For each test case, print one line containing the required number. This number will always fit into an integer, i.e. it will be less than 231.
Warning: Don't underestimate the problem. The result will fit into an integer - but if all intermediate results arising during the computation will also fit into an integer depends on your algorithm. The test cases will go to the limit.