![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
基础题
defense881
Noting is impossiable!Believe in yourself!
展开
-
poj 1281 MANAGER(简单模拟题)
MANAGERTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2504 Accepted: 899DescriptionOne of the programming paradigm in parallel processing is the prod原创 2014-07-16 20:24:42 · 1436 阅读 · 0 评论 -
反素数深度分析 (转)
反素数深度分析分类: 数论 2014-05-05 20:06 2647人阅读 评论(2)收藏 举报今天要我要讲的是反素数,在ACM中也算是常见的考点,那么对于搞ACM的同学来说,很有必要搞清楚它,所以接下来我会很详细地讲解。 在讲解反素数之前,我们先来看反素数的概念。 反素数的定义:对于任何正整数,其约数个数记为,例如,如果某个正整数满足:对任意转载 2015-09-30 17:36:02 · 619 阅读 · 0 评论 -
poj 2689
Language:Prime Distance点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14583 Accepted: 3880DescriptionThe branch of mathematics called numbe原创 2015-09-29 17:37:50 · 587 阅读 · 0 评论 -
codeforces#322 div2
A. Vasya the Hipstertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Vasya the Hipster decided to count how ma原创 2015-09-29 11:32:43 · 762 阅读 · 0 评论 -
codeforces#316 div2
A. Elections点击打开题目链接time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe country of Byalechinsk is running electio原创 2015-08-17 08:59:32 · 443 阅读 · 0 评论 -
zoj 3705 Applications(粗暴模拟题)
Applications点击打开题目链接Time Limit: 2 Seconds Memory Limit: 65536 KB Recently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen to take part in th原创 2015-05-06 19:38:14 · 781 阅读 · 0 评论 -
SDUT 2605 A^X mod P
A^X mod P点击打开题目链接Time Limit: 5000ms Memory limit: 65536K 有疑问?点这里^_^题目描述It's easy for ACMer to calculate A^X mod P. Now given seven integers n, A, K, a, b, m, P, and a function f(x原创 2015-05-05 20:19:10 · 552 阅读 · 0 评论 -
zoj 3866 Cylinder Candy(积分数学)
Cylinder Candy点击打开题目链接Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Edward the confectioner is making a new batch of chocolate covered candy.Each candy center is s原创 2015-04-13 13:41:43 · 907 阅读 · 0 评论 -
[csu oj]1553: Good subsequence(水题)
1553: Good subsequence点击打开题目链接Time Limit: 2 Sec Memory Limit: 256 MBSubmit: 234 Solved: 59[Submit][Status][Web Board]DescriptionGive you a sequence of n numbers, and a number k y原创 2015-03-30 20:06:47 · 870 阅读 · 0 评论 -
【Light oj】1282 - Leading and Trailing
1282 - Leading and Trailinghttp://www.lightoj.com/volume_showproblem.php?problem=1282PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32原创 2015-03-27 16:54:04 · 769 阅读 · 0 评论 -
[Light oj] 1245 - Harmonic Number (II)
1245 - Harmonic Number (II) PDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MB点击打开题目链接I was trying to solve proble原创 2015-03-27 15:21:50 · 671 阅读 · 0 评论 -
poj 1328 Radar Installation(贪心)
Radar Installation点击打开题目链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55857 Accepted: 12596DescriptionAssume the coasting is an infinite strai原创 2015-01-22 22:21:36 · 464 阅读 · 0 评论 -
codeforces#290 B&&510 B Fox And Two Dots(简单dfs)
B. Fox And Two Dots点击打开题目链接time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a mobile puzzle g原创 2015-02-03 04:25:59 · 885 阅读 · 0 评论 -
codeforces #290 A&&510A Fox And Snake(水题)
A. Fox And Snake点击打开题目链接time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel starts to learn programming. Th原创 2015-02-03 04:20:38 · 661 阅读 · 1 评论 -
uva 10780Again Prime? No Time.(简单数论)
Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne原创 2015-01-27 09:36:51 · 1597 阅读 · 2 评论 -
bestcoder#17 1001&&HDU 5100 Chessboard(数学)
Chessboard Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 85 Accepted原创 2014-11-08 23:23:58 · 888 阅读 · 0 评论 -
YT基础回顾(一)1.9Dirichlet's Theorem on Arithmetic Progressions(素数判断)
I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIf a and d are relatively pr原创 2014-07-14 12:38:31 · 784 阅读 · 0 评论 -
poj 1504 Adding Reversed Numbers(简单字符串的处理)
Adding Reversed NumbersTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionThe Antique Comedians of Malidinesia prefer comedies to tragedies.原创 2014-07-16 17:03:44 · 774 阅读 · 0 评论 -
反素数()
void dfs(int dept,LL nn,LL fnum,int index){ if(fnum>k)return ; ///if(nn>Linf) return ; if(fnum==k&&ans>nn) ans=nn; for(int i=1; i<=index; i++) { if((ansk))转载 2015-10-01 20:44:26 · 974 阅读 · 0 评论