xuanweiace的博客

题干： Mr. Kitayuta has just bought an undirected graph consisting ofnvertices andmedges. The vertices of the graph are numbered from 1 ton. Each edge, namely edgei, has a colorci, connecting ver...

题干： 链接：https://ac.nowcoder.com/acm/contest/157/E 来源：牛客网 题目描述 有一只可爱的老青蛙，在路的另一端发现了一个黑的东西，想过去一探究竟。于是便开始踏上了旅途 一直这个小路上有很多的隧道，从隧道的a进入，会从b出来，但是隧道不可以反向走。 这只青蛙因为太老了，所以很懒，现在想请你帮帮慢，问他最少需要几步才可以到达对面。 将小径看作一条...

题干： Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never...

https://nanti.jisuanke.com/t/41290 题干： Firdaws and Fatinah are living in a country withnncities, numbered from11tonn. Each city has a risk of kidnapping or robbery. Firdaws's home locates in t...