。。。数论~~数学 - 随笔分类(第2页) - handsomecui

More Divisors(反素数)

摘要：More DivisorsTime Limit: 2 Seconds Memory Limit: 65536 KBEverybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians... 阅读全文

posted @ 2015-12-03 20:40 handsomecui 阅读(277) 评论(0) 推荐(0) 编辑

CodeForces - 27E--Number With The Given Amount Of Divisors（反素数）

摘要：CodeForces - 27ENumber With The Given Amount Of DivisorsSubmitStatusDescriptionGiven the numbern, find the smallest positive integer which has exactly... 阅读全文

posted @ 2015-12-03 20:14 handsomecui 阅读(722) 评论(0) 推荐(0) 编辑

莫比乌斯反演（转）

摘要：http://www.cnblogs.com/AOQNRMGYXLMV/p/4065628.html一、莫比乌斯(Möbius)函数对于每个正整数n(n ≥ 2)，设它的质因数分解式为：根据这个式子定义n的莫比乌斯函数为：也就是如果n有平方因子，则为0. 否则是-1的质因数个数次... 阅读全文

posted @ 2015-11-25 17:02 handsomecui 阅读(395) 评论(0) 推荐(0) 编辑

简单的求和(打表)

摘要：简单的求和Time Limit:1 SecMemory Limit:128 MB Submit:130Solved:20SubmitStatusWeb BoardDescription定义f(i)代表i的所有因子和(包括1和i)，给定一个l,r。求f(l)+f(l+1)+...+f(r)。Input... 阅读全文

posted @ 2015-11-22 14:19 handsomecui 阅读(469) 评论(0) 推荐(0) 编辑

吉哥系列故事——礼尚往来（错排）

摘要：New~ 欢迎参加——计算机学院大学生程序设计竞赛（新生为主）吉哥系列故事——礼尚往来Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1265Ac... 阅读全文

posted @ 2015-11-15 17:58 handsomecui 阅读(620) 评论(0) 推荐(0) 编辑

区域赛系列一多边形划分(卡特兰数)

摘要：区域赛系列一多边形划分时间限制：1000 ms | 内存限制：65535 KB难度：2描述Give you a convex（凸边形）, diagonal n-3 disjoint divided into n-2 triangles(直线), for different number of met... 阅读全文

posted @ 2015-11-13 22:18 handsomecui 阅读(1513) 评论(0) 推荐(0) 编辑

1369 - Answering Queries（规律）

摘要：1369 - Answering QueriesPDF (English)StatisticsForumTime Limit:3 second(s)Memory Limit:32 MBThe problem you need to solve here is pretty simple. You a... 阅读全文

posted @ 2015-11-08 14:04 handsomecui 阅读(613) 评论(0) 推荐(0) 编辑

不容易系列之一(错排公式+容斥)

摘要：不容易系列之一Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17475Accepted Submission(s): 7284 Problem ... 阅读全文

posted @ 2015-11-07 11:14 handsomecui 阅读(534) 评论(0) 推荐(0) 编辑

Pagodas（等差数列）

摘要：PagodasTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 22Problem Descrip... 阅读全文

posted @ 2015-11-01 19:52 handsomecui 阅读(714) 评论(0) 推荐(0) 编辑

Intersecting Lines（数学）

摘要：Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12844Accepted: 5703DescriptionWe all know that a pair of distinct points on... 阅读全文

posted @ 2015-10-30 11:26 handsomecui 阅读(351) 评论(0) 推荐(0) 编辑

C Looooops(扩展欧几里德)

摘要：C LooooopsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 3Problem Desc... 阅读全文

posted @ 2015-10-29 22:01 handsomecui 阅读(1167) 评论(0) 推荐(0) 编辑

Intersection（poj）

摘要：IntersectionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13140Accepted: 3424DescriptionYou are to write a program that has to decide wheth... 阅读全文

posted @ 2015-10-29 19:01 handsomecui 阅读(368) 评论(0) 推荐(0) 编辑

Romantic（裸扩展欧几里德）

摘要：RomanticTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3944Accepted Submission(s): 1638Problem De... 阅读全文

posted @ 2015-10-25 13:34 handsomecui 阅读(300) 评论(0) 推荐(0) 编辑

A/B（扩展欧几里德）

摘要：A/BTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3340Accepted Submission(s): 2534Problem Descrip... 阅读全文

posted @ 2015-10-25 12:59 handsomecui 阅读(298) 评论(0) 推荐(0) 编辑

青蛙的约会(裸扩展欧几里德)

摘要：青蛙的约会Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 99567Accepted: 18976Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约... 阅读全文

posted @ 2015-10-25 11:48 handsomecui 阅读(286) 评论(0) 推荐(0) 编辑

One Person Game（扩展欧几里德求最小步数）

摘要：One Person GameTime Limit: 2 Seconds Memory Limit: 65536 KBThere is an interesting and simple one person game. Suppose there is a number axis under... 阅读全文

posted @ 2015-10-25 11:12 handsomecui 阅读(306) 评论(0) 推荐(0) 编辑

Modular Inverse(模逆元，扩展欧几里德)

摘要：Modular InverseTime Limit: 2 Seconds Memory Limit: 65536 KBThe modular modular multiplicative inverse of an integer a modulo m is an integer x such... 阅读全文

posted @ 2015-10-25 09:32 handsomecui 阅读(3017) 评论(0) 推荐(0) 编辑

B - 楼下水题(扩展欧几里德)

摘要：B - 楼下水题 Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 7CDescriptionA line on the plane is de... 阅读全文

posted @ 2015-10-24 22:00 handsomecui 阅读(294) 评论(0) 推荐(0) 编辑

1148 - Mad Counting（数学）

摘要：1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s)Memory Limit: 32 MBMob was hijacked by the mayor of the Town "TruthTown"... 阅读全文

posted @ 2015-10-24 20:45 handsomecui 阅读(309) 评论(0) 推荐(0) 编辑

扩展欧几里德算法

摘要：连接：http://blog.csdn.net/zhjchengfeng5/article/details/7786595扩展欧几里德算法谁是欧几里德？自己百度去先介绍什么叫做欧几里德算法有两个数 a b，现在，我们要求 a b 的最大公约数，怎么求？枚举他们的因子？不现实，当 a b ... 阅读全文

posted @ 2015-10-24 20:37 handsomecui 阅读(365) 评论(0) 推荐(0) 编辑

handsomecui

随笔分类 - 。。。数论~~数学

公告