随笔分类 - 数学
摘要:Zball in Tina Town Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description Tina Town is a friendly plac
阅读全文
摘要:D. "Or" Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given n numbers a1,
阅读全文
摘要:Balls Rearrangement Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Problem Description Bob has N balls and A boxes.
阅读全文
摘要:D. Remainders Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Today Pari and Arya ar
阅读全文
摘要:1192: [HNOI2006]鬼谷子的钱袋 Description 鬼谷子非常聪明,正因为这样,他非常繁忙,经常有各诸侯车的特派员前来向他咨询时政。有一天,他在咸阳游历的时候,朋友告诉他在咸阳最大的拍卖行(聚宝商行)将要举行一场拍卖会,其中有一件宝物引起了他极大的兴趣,那就是无字天书。但是,他的行
阅读全文
摘要:Twin Prime Conjecture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description If we define dn as: dn = pn
阅读全文
摘要:B. Modulo Sum time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Modulo Sum time limit p
阅读全文
摘要:C. Vasya and Petya's Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Vasya and Pe
阅读全文
摘要:C. Bear and Prime 100 time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Bear and Prime 1
阅读全文
摘要:Eddy's digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5928 Accepted Submission(s):
阅读全文
摘要:1225 余数之和 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 收藏 关注 1225 余数之和 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 1225 余数之和 基准时间限制:1 秒 空间限制:131072 KB 分值:
阅读全文
摘要:1179 最大的最大公约数 题目来源: SGU 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注 1179 最大的最大公约数 题目来源: SGU 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 1179 最大的最大公约
阅读全文
摘要:Problem B: Handing Out Candies Description After the 40th ACM-ICPC, Diao Yang is thinking about finding a girlfriend because he feels very lonely when
阅读全文
摘要:A. Noldbach problem A. Noldbach problem Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer gr
阅读全文
摘要:C. The World is a Theatre C. The World is a Theatre There are n boys and m girls attending a theatre club. To set a play "The Big Bang Theory", they n
阅读全文
摘要:百度百科:http://baike.baidu.com/link?url=cAw3_kH3BSbESXx6UolE7k2u9CgDlrkLTWeJMv9XqR0EDL5SIaJnG_mlnkub3-kWwc6kgQttZXuQDG_LqqDDT_ 对于一个大于1正整数n可以分解质因数:n=p1^a1
阅读全文
摘要:Segment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Silen August does not like to talk with o
阅读全文