![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm
inag0000
on the IT way
展开
-
ACMPOJ--1125
Problem Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical原创 2015-10-07 16:58:09 · 337 阅读 · 0 评论 -
acmPOJ--1847
Problem Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out o原创 2015-10-07 17:48:02 · 444 阅读 · 0 评论 -
acmPOJ--1502
Problem Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine M原创 2015-10-07 17:53:20 · 361 阅读 · 0 评论 -
计算1至n中数字X出现的次数(转载)
描述计算 1 至 n 中数字 X 出现的次数,其中 n≥1,X∈[0,9]解题思路这是一道比较简单的题目,举个例子先:假设 n=11,X=1,那么就是求 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 这 11 个数字中 1 出现的次数,很容易能看出来结果为 4,在 1 和 10 中各出现了一次,在 11 中出现了两次。最简单的办法就是依次遍历 1 至 n,再分别求每个数字中 X转载 2016-09-08 00:53:18 · 815 阅读 · 0 评论