2012年8月3日

Setu(水题)

摘要： K -SetuTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1387DescriptionRahaduzzaman Setu, (Roll - 12) of 13th batch, CSE, University of Dhaka. He passed away on 18thApril 2012. This is one of the saddest news to all. May he rest in peace. This problem i 阅读全文

posted @ 2012-08-03 21:06 铁树银花 阅读(994) 评论(0) 推荐(0)

<LightOJ 1338> Hidden Secret!

摘要： Hidden Secret!Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1338DescriptionIn this problem you are given two names, you have to find whether one name is hidden into another. The restrictions are:1.You can change some uppercase letters to lower case a 阅读全文

posted @ 2012-08-03 20:26 铁树银花 阅读(294) 评论(0) 推荐(0)

<FZU1033>URLs

摘要： URLsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1033DescriptionIn the early nineties, the World Wide Web (WWW) was invented. Nowadays, most people think that the WWW simply consists of all the pretty (or not so pretty) HTML-pages that you can read wi 阅读全文

posted @ 2012-08-03 18:11 铁树银花 阅读(336) 评论(0) 推荐(0)

<FZU 1019>猫捉老鼠

摘要： A -猫捉老鼠Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1019Description一只猫和一只老鼠在10*10的迷宫中。迷宫中的每个方格可以是空的，或者含有障碍。猫和老鼠可以进入任意一个空的方格中。当他们相遇时，猫和老鼠在同一个方格中。但是，无论猫或老鼠都不能进入有障碍的方格。我们可以用字符组成的二维数组表示迷宫，如下图所示。老鼠在迷宫中按照一种固定的方式行走：每个时刻，老鼠都向它所面对的方向前进一格，这需要花费１秒时间。如果前方是一个障碍或者是 阅读全文

posted @ 2012-08-03 11:11 铁树银花 阅读(462) 评论(0) 推荐(0)

导航