摘要: 题目链接 Bridges 题目描述 An edge in an undirected graph is a bridgeif after removing it the graph will be disconnected. Given an undirected connected graph, 阅读全文
posted @ 2020-08-11 20:41 oblivionl 阅读(111) 评论(0) 推荐(0) 编辑
摘要: 题目链接 MEX Queries 题目描述 You are given a set of integer numbers, initially it is empty. You should perform \(n\) queries. There are three different types 阅读全文
posted @ 2020-08-11 19:03 oblivionl 阅读(174) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Intervals 题目描述 You are given \(n\) closed, integer intervals \([a_i,b_i]\) and \(n\) integers \(c_1\), ...,\(c_n\). Write a program that: reads t 阅读全文
posted @ 2020-08-11 18:34 oblivionl 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Sightseeing trip 题目描述 There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attrac 阅读全文
posted @ 2020-08-11 18:33 oblivionl 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Non-trivial Common Divisor 题目描述 You are given a positive integer sequence \(A\) of length \(N\). You can remove any numbers from the sequence to 阅读全文
posted @ 2020-08-11 18:32 oblivionl 阅读(207) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Patches 题目描述 Carlos is very concerned with the environment. Whenever possible, he tries to use less pollutingmeans of transport. He recently got 阅读全文
posted @ 2020-08-11 18:31 oblivionl 阅读(145) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Naptime 题目描述 Goneril is a very sleep-deprived cow. Her day is partitioned into \(N\) ($3 \le N \le 3,830$) equal time periods but she can spend o 阅读全文
posted @ 2020-08-11 18:29 oblivionl 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Choosing Capital for Treeland 题目描述 The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall 阅读全文
posted @ 2020-08-11 18:28 oblivionl 阅读(119) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Binary Apple Tree 题目描述 Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any bipa 阅读全文
posted @ 2020-08-11 18:27 oblivionl 阅读(171) 评论(0) 推荐(1) 编辑
摘要: 题目链接 Anniversary Party 题目背景 The president of the Ural State University is going to make an 80'th Anniversary party. The university has a hierarchical 阅读全文
posted @ 2020-08-11 18:25 oblivionl 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Longge's problem 题目描述 Longge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful 阅读全文
posted @ 2020-08-11 18:24 oblivionl 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Farey Sequence 题目描述 The Farey Sequence Fn for any integer \(n\) with \(n \ge 2\) is the set of irreducible rational numbers \(a/b\) with $0 < a < 阅读全文
posted @ 2020-08-11 18:22 oblivionl 阅读(112) 评论(0) 推荐(0) 编辑
摘要: 题目链接 How many ways?? 题目描述 春天到了, HDU校园里开满了花, 姹紫嫣红, 非常美丽. 葱头是个爱花的人, 看着校花校草竞相开放, 漫步校园, 心情也变得舒畅. 为了多看看这迷人的校园, 葱头决定, 每次上课都走不同的路线去教室, 但是由于时间问题, 每次只能经过$k$个地方 阅读全文
posted @ 2020-08-11 18:20 oblivionl 阅读(84) 评论(0) 推荐(0) 编辑
摘要: 题目链接 随机数生成器 题目描述 栋栋最近迷上了随机算法,而随机数生成是随机算法的基础。栋栋准备使用线性同余法(Linear Congruential Method)来生成一个随机数列,这种方法需要设置四个非负整数参数$m$,\(a\),\(c\),\(X_0\),按照下面的公式生成出一系列随机数 阅读全文
posted @ 2020-08-11 18:19 oblivionl 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Another kind of Fibonacci 题目描述 As we all known , the Fibonacci series : \(F\)($0$)\(=1\),\(F\)($1$)\(=1\),\(F\)(\(N\))\(=F\)(\(N-1\))\(+F\)(\(N-2 阅读全文
posted @ 2020-08-11 18:18 oblivionl 阅读(109) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Queuing 题目描述 Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life 阅读全文
posted @ 2020-08-11 18:17 oblivionl 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 题目链接 A Simple Math Problem 题目描述 Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x >= 10 f(x) = a0$\(f(x-1)+a1\)\(f(x-2)+a2\) 阅读全文
posted @ 2020-08-11 18:16 oblivionl 阅读(91) 评论(0) 推荐(0) 编辑
摘要: 题目链接 Tr A 题目描述 $A$为一个方阵,则$Tr\ A$表示$A$的迹(就是主对角线上各项的和),现要求$Tr$(\(A^k\))\(\%9973\)。 输入格式 数据的第一行是一个$T$,表示有$T$组数据。 每组数据的第一行有$n$($2 \le n \le 10$)和$k$($2 \l 阅读全文
posted @ 2020-08-11 18:15 oblivionl 阅读(116) 评论(0) 推荐(0) 编辑
摘要: 题目链接 排列组合 题目描述 有$n$种物品,并且知道每种物品的数量。要求从中选出$m$件物品的排列数。例如有两种物品A,B,并且数量都是$1$,从中选$2$件物品,则排列有"AB","BA"两种。 输入格式 每组输入数据有两行,第一行是二个数$n$,\(m\)($1 \le m$,\(n \le 阅读全文
posted @ 2020-08-11 18:14 oblivionl 阅读(105) 评论(0) 推荐(0) 编辑