ACM_数论
kewlgrl
好大一只咸鱼哇
展开
-
POJ 2689-Prime Distance(区间素数)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15901 Accepted: 4227DescriptionThe branch of mathematics called number theory is about pro原创 2016-06-02 19:26:30 · 929 阅读 · 0 评论 -
HDU-中国剩余定理-求最小公倍数
问题及代码:Problem A 中国剩余定理Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Font: Times New Roman | Verd原创 2015-03-02 15:04:22 · 1221 阅读 · 0 评论 -
POJ 1006-Biorhythms-生理周期峰值(中国剩余问题)
问题及代码:/* *Copyright (c)2014,烟台大学计算机与控制工程学院 *All rights reserved. *文件名称:HDU.cpp *作 者:单昕昕 *完成日期:2015年1月27日 *版 本 号:v1.0 *问题描述:Some people believe that there are three cycles in a perso原创 2015-01-27 21:58:23 · 890 阅读 · 0 评论 -
POJ 3233-Matrix Power Series( S = A + A^2 + A^3 + … + A^k 矩阵快速幂取模)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 20309 Accepted: 8524DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2016-08-03 13:42:13 · 1471 阅读 · 0 评论 -
HDU 5873-Football Games(分情况/Landau定理)
Football GamesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 729 Accepted Submission(s): 275Problem DescriptionA mysterious原创 2016-09-11 15:53:17 · 646 阅读 · 0 评论 -
HDU 5874-Friends and Enemies(n个结点的无三元环的图的最大边数)
Friends and EnemiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 292 Accepted Submission(s): 161Problem DescriptionOn an is原创 2016-09-11 16:44:35 · 938 阅读 · 0 评论 -
HDU 1402及51 nod1028 大数乘法 V2(FFT 快速傅里叶变换)
1028 大数乘法 V2基准时间限制:2 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 收藏 关注给出2个大整数A,B,计算A*B的结果。Input第1行:大数A第2行:大数B(A,B的长度 = 0)Output输出A * BInput示例123456234原创 2016-08-11 18:25:14 · 1157 阅读 · 0 评论 -
HDU 5884-Sort(队列+二分)
SortTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1631 Accepted Submission(s): 418Problem DescriptionRecently, Bob has just原创 2016-09-23 21:29:57 · 530 阅读 · 0 评论 -
HDU 5901-Count primes(1e11以内素数的个数)
Count primesTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 971 Accepted Submission(s): 520Problem DescriptionEasy question!原创 2016-09-21 13:06:40 · 822 阅读 · 0 评论 -
HDU 5878-I Count Two Three(可被2 3 5 7整除的数)
I Count Two ThreeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3582 Accepted Submission(s): 1094Problem DescriptionI will s原创 2016-09-21 13:17:09 · 856 阅读 · 0 评论 -
HDU 5879-Cure(1/n^2之和)
CureTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1274 Accepted Submission(s): 429Problem DescriptionGiven an integer n,原创 2016-09-21 13:33:30 · 571 阅读 · 0 评论 -
POJ 1995-Raising Modulo Numbers-整数快速幂
Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6012 Accepted: 3515DescriptionPeople are different. Some secretly read magazines f原创 2016-03-09 20:39:09 · 502 阅读 · 0 评论 -
HDU 1576-A/B(拓展欧几里得算法)
问题及代码:Problem ETime Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Font: Times New Roman | Verdana |原创 2015-03-02 11:51:54 · 951 阅读 · 0 评论 -
POJ 2115-C Looooops-扩展欧几里德算法
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21526 Accepted: 5868DescriptionA Compiler Mystery: We are given a C-language style for loop of原创 2016-03-09 10:20:27 · 1020 阅读 · 0 评论 -
山东省第七届ACM大学生程序设计竞赛-Fibonacci
FibonacciTime Limit: 2000ms Memory limit: 131072K 有疑问?点这里^_^题目描述Fibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as原创 2016-06-19 11:05:41 · 978 阅读 · 0 评论 -
POJ 1305-Fermat vs. Pythagoras(本原的毕达哥拉斯三元组+枚举)
Fermat vs. PythagorasTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 1555 Accepted: 908DescriptionComputer generated and assisted proofs and verificatio原创 2016-08-04 08:33:45 · 810 阅读 · 0 评论 -
POJ 1320-Street Numbers(解佩尔方程)
Street NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2908 Accepted: 1621DescriptionA computer programmer lives in a street with houses numbered原创 2016-08-04 09:15:24 · 726 阅读 · 0 评论 -
斐波那契数列的第N项(1≤n≤10^18 矩阵快速幂)
1242 斐波那契数列的第N项基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题斐波那契数列的定义如下:F(0) = 0F(1) = 1F(n) = F(n - 1) + F(n - 2) (n >= 2)(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 3原创 2016-08-01 18:08:04 · 2473 阅读 · 0 评论 -
POJ 2478-Farey Sequence(欧拉函数)
Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14071 Accepted: 5567DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the原创 2016-03-09 20:30:44 · 846 阅读 · 0 评论 -
POJ 2407-Relatives-欧拉函数
RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12903 Accepted: 6379DescriptionGiven n, a positive integer, how many positive integers less tha原创 2016-03-09 20:17:13 · 744 阅读 · 0 评论 -
【POJ 3243-Clever Y】 与【POJ 2417-Discrete Logging】(解高次同余方程 Baby-Step-Gaint-Step)
Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7969 Accepted: 1986DescriptionLittle Y finds there is a very interesting formula in mathematics:原创 2016-08-03 11:06:37 · 633 阅读 · 0 评论 -
POJ 2891-trange Way to Express Integers(解线性同余方程组)
Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 13819 Accepted: 4451DescriptionElina is reading a book written by Ruji原创 2016-08-03 09:49:27 · 602 阅读 · 0 评论 -
拓展欧几里得-求AX+BY=C中X和Y的值
代码:/** Copyright (c) 2016, 烟台大学计算机与控制工程学院* All rights reserved.* 文件名称:exgcd.cpp* 作 者:单昕昕* 完成日期:2016年4月2日* 版 本 号:v1.0*/#include#include#include#includeusing namespace std;typedef long原创 2016-04-06 10:39:27 · 2572 阅读 · 0 评论 -
POJ 1061-青蛙的约会(拓展欧几里得)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 102786 Accepted: 19915Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰原创 2016-04-02 09:30:18 · 446 阅读 · 0 评论 -
POJ 3292-Semi-prime H-numbers(H半素数)
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9289 Accepted: 4124DescriptionThis problem is based on an exercise of David Hilbert,原创 2017-02-25 17:32:06 · 989 阅读 · 0 评论