HDU 2012 FZU 1756关于素数的一些水题

【HDU 2012 FZU 1756关于素数的一些水题】的更多相关文章

HDU 2012 FZU 1756关于素数的一些水题

HDU 2012 素数判定 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 72727 Accepted Submission(s): 25323 Problem Description 对于表达式n^2+n+41,当n在(x,y)范围内取整数值时(包括x,y)(-39<=x<y<=50),判定该表达式的值是否都为素数.…

HDU 5832 A water problem （带坑水题）

A water problem 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5832 Description Two planets named Haha and Xixi in the universe and they were created with the universe beginning. There is 73 days in Xixi a year and 137 days in Haha a year. Now you k…

HDU 5889 Barricade（最短路+最小割水题）

Barricade Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1418 Accepted Submission(s): 417 Problem Description The empire is under attack again. The general of empire is planning to defend h…

hdu 5104 素数打表水题

http://acm.hdu.edu.cn/showproblem.php?pid=5104 找元组数量,满足p1<=p2<=p3且p1+p2+p3=n且都是素数不用素数打表都能过,数据弱的一比 #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #include <string> #include <queue> #inclu…

POJ1595_Prime Cuts【素数】【水题】

Prime Cuts Time Limit: 1000MSMemory Limit: 10000K Total Submissions: 10464Accepted: 3994 Description A prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that wil…

POJ 1595 素数打表水题

[题意简述]:给出N和C,让我们求出N以内的包含N的素数,然后依据若N以内的素数为奇数个,就将中间2*c-1个素数输出:若为偶数个.就将中间2*c个素数输出. [分析]:仅仅要题意理解就简单了. 详见代码: // 224K 16Ms #include<iostream> using namespace std; #define N 2000 bool isprime[N]; int prime[N],nprime; void doprime(int n) { int i,j; nprime =…

hdu 5742 It's All In The Mind 水题

It's All In The Mind 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5742 Description Professor Zhang has a number sequence a1,a2,...,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some…