xjhz

摘要： Network Description A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integ 阅读全文

摘要： SPF Description Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer- 阅读全文

摘要： Problem F: 我是好人4 Description 众所周知，我是好人！所以不会出太难的题，题意很简单 给你n个数，问你1000000000（含1e9）以内有多少个正整数不是这n个数任意一个的倍数 最后友情提供解题代码（我真是太好人了） void solve(int p[], int n) { 阅读全文

摘要： Going from u to v or from v to u? Description In order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and on 阅读全文

摘要： Apple Catching Description It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) 阅读全文

摘要： Popular Cows Description Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to 阅读全文

摘要： 迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和 阅读全文

摘要： India and China Origins Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description A long time ago there are 阅读全文

摘要： 描述 在大学期间，经常需要租借教室。大到院系举办活动，小到学习小组自习讨论，都需要向学校申请借教室。教室的大小功能不同，借教室人的身份不同，借教室的手续也不一样。面对海量租借教室的信息，我们自然希望编程解决这个问题。我们需要处理接下来n天的借教室信息，其中第i天学校有ri个教室可供租借。共有m份订单 阅读全文

摘要： 题目描述 Description 求关于 x 同余方程 ax ≡ 1 (mod b)的最小正整数解。 题目描述 Description 求关于 x 同余方程 ax ≡ 1 (mod b)的最小正整数解。 求关于 x 同余方程 ax ≡ 1 (mod b)的最小正整数解。 输入描述 Input Des 阅读全文