2013年11月25日

Web Navigation 模拟

摘要: Web NavigationTime Limit:1000MSMemory Limit:10000KTotal Submissions:27179Accepted:12164DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reac 阅读全文

posted @ 2013-11-25 19:04 keep trying 阅读(363) 评论(0) 推荐(0)

A. Strange Addition 暴力

摘要: A. Strange Additiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputUnfortunately, Vasya can only sum pairs of integers (a,b), such that for any decimal place at least one number has digit0in this place. For example, Vasya can sum numbers505and50, 阅读全文

posted @ 2013-11-25 17:08 keep trying 阅读(302) 评论(0) 推荐(0)

A - Pair of Numbers 数论

摘要: A -Pair of NumbersTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionSimon has an arraya1, a2, ..., an, consisting ofnpositive integers. Today Simon asked you to find a pair of integersl, r(1 ≤ l ≤ r ≤ n), such that the following conditi 阅读全文

posted @ 2013-11-25 15:08 keep trying 阅读(300) 评论(0) 推荐(0)

导航