2016 年 9月随笔档案 - disppr

poj3468 A Simple Problem with Integers 线段树区间更新

摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 97722 Accepted: 30543 Case Time Limit: 2000MS Description Y 阅读全文

posted @ 2016-09-30 21:46 disppr 阅读(178) 评论(0) 推荐(0)

FFT A*B模板

摘要：从卿学姐那里偷了份FFT大数相乘的模板。。。果断交了一发HDU 1402 还不孬阅读全文

posted @ 2016-09-29 13:20 disppr 阅读(544) 评论(0) 推荐(0)

hdoj 1575 Tr A 矩阵快速幂

摘要：Tr A Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%99 阅读全文

posted @ 2016-09-29 09:35 disppr 阅读(263) 评论(0) 推荐(0)

hdoj 1757 A Simple Math Problem

摘要：A Simple Math Problem Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Lele now is thinking about 阅读全文

posted @ 2016-09-28 23:18 disppr 阅读(196) 评论(0) 推荐(0)

51nod 1537 分解

摘要：1537 分解基准时间限制：0.5 秒空间限制：131072 KB 分值: 80 难度：5级算法题问(1+sqrt(2)) ^n 能否分解成 sqrt(m) +sqrt(m-1)的形式如果可以输出 m%1e9+7 否则输出no 问(1+sqrt(2)) ^n 能否分解成 sqrt(m) 阅读全文

posted @ 2016-09-28 22:38 disppr 阅读(327) 评论(0) 推荐(0)

poj3070 矩阵快速幂

摘要：Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13438 Accepted: 9562 Description In the Fibonacci integer sequence, F0 = 0, F1 = 阅读全文

posted @ 2016-09-28 13:41 disppr 阅读(174) 评论(0) 推荐(0)

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 阅读(383) 评论(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 阅读(160) 评论(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 阅读(444) 评论(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 阅读(453) 评论(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 阅读(267) 评论(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 阅读(198) 评论(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 阅读(184) 评论(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 阅读(153) 评论(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 阅读(188) 评论(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 阅读(302) 评论(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 阅读(202) 评论(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 阅读(352) 评论(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 阅读(211) 评论(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 阅读(171) 评论(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 阅读(301) 评论(0) 推荐(0)

ural1086. Cryptography

摘要：1086. Cryptography Time limit: 2.0 secondMemory limit: 64 MB While preparing this problem set the jury has run into the following problem: it was nece 阅读全文

posted @ 2016-09-21 14:22 disppr 阅读(260) 评论(0) 推荐(0)

ural 1118. Nontrivial Numbers

摘要：1118. Nontrivial Numbers Time limit: 2.0 secondMemory limit: 64 MB Specialists of SKB Kontur have developed a unique cryptographic algorithm for needs 阅读全文

posted @ 2016-09-21 14:04 disppr 阅读(323) 评论(0) 推荐(0)

ural 1104. Don’t Ask Woman about Her Age暴力

摘要：1104. Don’t Ask Woman about Her Age Time limit: 1.0 secondMemory limit: 64 MB Mrs Little likes digits most of all. Every year she tries to make the be 阅读全文

posted @ 2016-09-21 13:51 disppr 阅读(257) 评论(0) 推荐(0)

ural 1141. RSA Attack RSA算法

摘要：1141. RSA Attack Time limit: 1.0 secondMemory limit: 64 MB The RSA problem is the following: given a positive integer n that is a product of two disti 阅读全文

posted @ 2016-09-21 13:40 disppr 阅读(212) 评论(0) 推荐(0)

51nod 1119 机器人走方格 V2组合数

摘要：1119 机器人走方格 V2 基准时间限制：1 秒空间限制：131072 KB 分值: 10 难度：2级算法题 1119 机器人走方格 V2 基准时间限制：1 秒空间限制：131072 KB 分值: 10 难度：2级算法题 1119 机器人走方格 V2 基准时间限制：1 秒空间限制：13107 阅读全文

posted @ 2016-09-20 19:29 disppr 阅读(595) 评论(0) 推荐(0)

2016 ACM/ICPC Asia Regional Qingdao Online1001 &&hdoj 5878 I Count Two Three

摘要：题目链接打表二分。。后来发现这是51nod中的一个原题阅读全文

posted @ 2016-09-20 18:46 disppr 阅读(170) 评论(0) 推荐(0)

51nod 1010 只包含因子2 3 5的数打表二分

摘要：1010 只包含因子2 3 5的数基准时间限制：1 秒空间限制：131072 KB 分值: 10 难度：2级算法题 K的因子中只包含2 3 5。满足条件的前10个数是：2,3,4,5,6,8,9,10,12,15。所有这样的K组成了一个序列S，现在给出一个数n，求S中 >= 给定数的最小的数。阅读全文

posted @ 2016-09-20 18:39 disppr 阅读(288) 评论(0) 推荐(0)

2016 ACM/ICPC Asia Regional Shenyang Online && hdoj5901 Count primes Lehmer

摘要：Count primes Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Easy question! Calculate how many p 阅读全文

posted @ 2016-09-20 13:05 disppr 阅读(358) 评论(0) 推荐(0)

51nod 1256 乘法逆元拓展欧几里得求逆元

摘要：1256 乘法逆元基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题给出2个数M和N(M < N)，且M与N互质，找出一个数K满足0 < K < N且K * M % N = 1，如果有多个满足条件的，输出最小的。给出2个数M和N(M < N)，且M与N互质，找出一个数阅读全文

posted @ 2016-09-20 11:24 disppr 阅读(897) 评论(0) 推荐(0)

icpc2016沈阳网络赛1003hannnnah_j’s Biological Test组合数模板题

摘要：hannnnah_j’s Biological Test Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description hannnnah_j is a te 阅读全文

posted @ 2016-09-20 00:39 disppr 阅读(306) 评论(2) 推荐(1)

51nod 1434 区间LCM 素数

摘要：1434 区间LCM 题目来源： TopCoder 基准时间限制：1 秒空间限制：131072 KB 分值: 40 难度：4级算法题 1434 区间LCM 题目来源： TopCoder 基准时间限制：1 秒空间限制：131072 KB 分值: 40 难度：4级算法题 1434 区间LCM 题目来阅读全文

posted @ 2016-09-19 23:52 disppr 阅读(657) 评论(0) 推荐(0)

09 2016 档案