hihocoder 1388 &&2016 ACM/ICPC Asia Regional Beijing Online Periodic Signal

摘要: #1388 : Periodic Signal 时间限制:5000ms 单点时限:5000ms 内存限制:256MB 描述 Profess X is an expert in signal processing. He has a device which can send a particular 阅读全文
posted @ 2016-09-25 10:50 disppr 阅读(372) 评论(1) 推荐(0) 编辑

Codeforces Round #373 (Div. 2)

摘要: 岑寂了一个暑假之后终于涨分了,借助了A题的hack大法, c题没有理解好题意,wa就放弃了,后来再样例的帮助下。。终于AC 现在还没搞懂矩阵啊。烦。。抄来别人的代码 A. Vitya in the Countryside 当n = 1时候特判0,15 1 #include <iostream> 2 阅读全文
posted @ 2016-09-24 14:52 disppr 阅读(153) 评论(0) 推荐(0) 编辑

fzu 1759Super A^B mod C 指数循环节

摘要: Problem 1759 Super A^B mod C Time Limit: 1000 mSec Memory Limit : 32768 KB Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description Given A,B 阅读全文
posted @ 2016-09-22 15:09 disppr 阅读(426) 评论(0) 推荐(0) 编辑

数论——欧拉函数

摘要: 简单总结一下最近学习的欧拉函数 欧拉函数定义:在数论,对正整数n,欧拉函数是小于等于n的数中与n互质的数的数目,记作φ(n)。 1、φ(1) = 1; 2、n为质数, φ(n) = n-1; 3、 n是某个质数的幂次 φ(pk) = pk - pk-1 = pk*(1 – 1/p) 证:这是因为只有 阅读全文
posted @ 2016-09-22 13:30 disppr 阅读(423) 评论(0) 推荐(0) 编辑

ural 1343. Fairy Tale打表

摘要: 1343. Fairy Tale Time limit: 1.0 secondMemory limit: 64 MB 12 months to sing and dance in a ring their celestial dance. One after another they hold a 阅读全文
posted @ 2016-09-22 00:20 disppr 阅读(264) 评论(0) 推荐(0) 编辑

ural 1356. Something Easier 哥德巴赫猜想

摘要: 1356. Something Easier Time limit: 1.0 secondMemory limit: 64 MB “How do physicists define prime numbers? Very easily: prime numbers are the number 2 阅读全文
posted @ 2016-09-21 23:23 disppr 阅读(192) 评论(0) 推荐(0) 编辑

ural 1091. Tmutarakan Exams 容斥

摘要: 1091. Tmutarakan Exams Time limit: 1.0 secondMemory limit: 64 MB University of New Tmutarakan trains the first-class specialists in mental arithmetic. 阅读全文
posted @ 2016-09-21 16:56 disppr 阅读(177) 评论(0) 推荐(0) 编辑

ural 1261. Tips

摘要: 1261. Tips Time limit: 1.0 secondMemory limit: 64 MB The favorite resting place of the Ural programmers is Threenland island. There is only one tribul 阅读全文
posted @ 2016-09-21 16:41 disppr 阅读(152) 评论(0) 推荐(0) 编辑

ural 1748. The Most Complex Number

摘要: 1748. The Most Complex Number Time limit: 1.0 secondMemory limit: 64 MB Let us define a complexity of an integer as the number of its divisors. Your t 阅读全文
posted @ 2016-09-21 16:31 disppr 阅读(185) 评论(0) 推荐(0) 编辑

ural 1355. Bald Spot Revisited

摘要: 1355. Bald Spot Revisited Time limit: 1.0 secondMemory limit: 64 MB A student dreamt that he walked along the town where there were lots of pubs. He d 阅读全文
posted @ 2016-09-21 16:23 disppr 阅读(287) 评论(0) 推荐(0) 编辑

ural 1049. Brave Balloonists

摘要: 1049. Brave Balloonists Time limit: 2.0 secondMemory limit: 64 MB Ten mathematicians are flying on a balloon over the Pacific ocean. When they are cro 阅读全文
posted @ 2016-09-21 16:09 disppr 阅读(196) 评论(0) 推荐(0) 编辑

ural 1204. Idempotents

摘要: 1204. Idempotents Time limit: 1.0 secondMemory limit: 64 MB The number x is called an idempotent modulo n if The number x is called an idempotent modu 阅读全文
posted @ 2016-09-21 15:55 disppr 阅读(333) 评论(0) 推荐(0) 编辑

uarl2070. Interesting Numbers

摘要: 2070. Interesting Numbers Time limit: 2.0 secondMemory limit: 64 MB Nikolay and Asya investigate integers together in their spare time. Nikolay thinks 阅读全文
posted @ 2016-09-21 14:44 disppr 阅读(206) 评论(0) 推荐(0) 编辑

ural 1133. Fibonacci Sequence

摘要: 1133. Fibonacci Sequence Time limit: 1.0 secondMemory limit: 64 MB is an infinite sequence of integers that satisfies to Fibonacci condition Fi + 2 =  阅读全文
posted @ 2016-09-21 14:31 disppr 阅读(162) 评论(0) 推荐(0) 编辑

ural 1352. Mersenne Primes 梅森素数(打表~)

摘要: 1352. Mersenne Primes Time limit: 1.0 secondMemory limit: 64 MB Definition. If the number 2N−1 is prime then it is called a Mersenne prime number. Def 阅读全文
posted @ 2016-09-21 14:26 disppr 阅读(281) 评论(0) 推荐(0) 编辑