LYHVOYAGE的专栏

Train Problem I时间限制：3000 ms  |  内存限制：65535 KB难度：2描述As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because

I Can Guess the Data Structure!There is a bag-like data structure, supporting two operations:1 xThrow an element x into the bag.2Take out an element from the bag.Given a sequence of oper

数单词时间限制：1000 ms  |  内存限制：65535 KB难度：4描述为了能够顺利通过英语四六级考试，现在大家每天早上都会早起读英语。LYH本来以为自己在6月份的考试中可以通过六级，可是没想到，成绩出来以后，居然没有通过。所以他不得不付出更多的时间来学习英语。要想通过六级，最基本的要求就是词汇量。为了能够更快的记住一些陌生单词，LYH有时会找一些

Magical Forest                                                                      Time Limit: 24000/12000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Description

Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland is m

沉重的货物              Time Limit: 1000ms                                       Memory Limit: 65536KB 64-bit integer IO format: %lld      Java class name: Main CUITCPC是一个专门生产大型货运火车

Factorial Problem in Base KTime Limit: 2 Seconds      Memory Limit: 65536 KBHow many zeros are there in the end of s! if both s and s! are written in base k which is not necessarily to be 10

吝啬的国度时间限制：1000 ms  |  内存限制：65535 KB难度：3描述在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据

ExpeditionTime Limit: 1000MS Memory Limit: 65536K   DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather po

Train Problem ITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays

Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6246 Accepted: 2532DescriptionOur Black Box represents a primitive database. It can save an int

Trees时间限制：1000 ms  |  内存限制：65535 KB难度：2描述       A graph consists of a set vertices and edges between pairs of vertices. Two vertices are connected if there is a path(subset of edges)

Bob's Print Service时间限制：1000 ms  |  内存限制：65535 KB难度：3描述Bob is providing print service,while the pricing doesn't seem to be reasonable,so people using her price service found some tri

how many hairstyles can they see?时间限制：1000 ms  |  内存限制：65535 KB描述Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her m

set集合容器实现了hongheish