Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: System Test
Description A semi-final competition was just over. There are n players. Each player had an SEED number from 1 to After the system-tests, the Before the system-tests, you need to count how many different combinations of advancers (including finalist and wildcard participants) are possible. Two ranks with same set of finalist and wildcard participants are consider same here. Note that, the players with negative scores can also advance to the final round or wildcard round, because the challenge scores may be smaller than 0. Input The first line of input four integers A_{i}_{1}, A_{i}_{2}, ……A, _{im}C denote the SEED number, the scores of the _{i}m problems and the score during the challenge phase for player i. All S will be distinct. 1 ≤ _{i}S ≤ _{i}n, 0 ≤ A ≤ 1000, -2000 ≤ _{ij}C ≤ 2000_{i}Output The first line of output contains one integer denoting the number of different advancers. Sample Input
Sample Output
Source POJ Founder Monthly Contest – 2008.10.05, Lou Tiancheng |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator