- 4
- 0
- 约1.02万字
- 约 50页
- 2015-10-06 发布于河南
- 举报
无题 acmer 必知必会
理论篇 Prime Count (NOJ 1004/1108) Description Given two nonnegative integers a, b (=1000000), calculate how many primes between a and b (include a, b ); Input Input will consist of multiple input sets. Each set include two integers; Output For each input set, output a single integer consisting of the number of prime numbers between a and b; Sample Input 3 9 Sample Output 3 理论篇 bool isPrime(int a) { if (a 2) return false; if (a == 2) return true; for(int i = 2; i = sqrt(a); i++) if (a % i == 0)return false; return true; } int main() { int a, b, count; while(scanf(%d%d, a, b
您可能关注的文档
最近下载
- iPSE 662防孤岛保护装置说明书 20210618.pdf VIP
- Finris 菲尼瑞斯 二合一数字示波器 FNIRSI-1014D 用户手册.pdf
- CLSI M45-ED3-2016少见菌和苛养菌稀释法和纸片法方法 (1).pdf VIP
- 淹溺的护理诊断.doc VIP
- 小区垃圾分类点施工方案.docx VIP
- 浙江省建设工程质量检测专项及检测能力表.pdf VIP
- GBT 46656-2025低温容器用阀门学习与解读PPT课件.pptx VIP
- 新《生态环境法典》解读课件PPT.pptx VIP
- 建市[2007]86号 工程设计资质标准.pdf VIP
- Unit 1 Amazing landmarks Part A Let's talk 课件2026秋人教PEP版英语六年级上册.ppt
原创力文档

文档评论(0)