摘要:
此题首先为利用筛选法求得10000以内的素数,然后对于输入的每一个数字,依次以小于它的连续素数相加,相等则种类数加一,返回,换另一个素数开始往后继续相加进行这个过程,最后输出种类数。1259. Sum of Consecutive PrimesConstraintsTime Limit: 1 sec... 阅读全文
摘要:
1240. Faulty OdometerConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionYou are given a car odometer which displays the miles traveled as an... 阅读全文
摘要:
1050. Numbers & LettersConstraintsTime Limit: 3 secs, Memory Limit: 32 MBDescriptionIn the early 80’s, a popular TV show on Dutch television was ‘Cijf... 阅读全文
摘要:
DescriptionThere are N cities and N-1 roads in Magic-Island. You can go from one city to any other. One road only connects two cities. One day, The ki... 阅读全文
摘要:
1156. Binary treeConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionYour task is very simple: Given a binary tree, every node of which conta... 阅读全文
摘要:
1443. Printer QueueConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionThe only printer in the computer science students' union is experienci... 阅读全文
摘要:
1006. Team RankingsConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionIt's preseason and the local newspaper wants to publish a preseason ra... 阅读全文