zoukankan      html  css  js  c++  java
  • poj3006

    普通的n^2的筛法居然比线性筛法快,不知道以后该用哪个了……

    View Code
    #include <iostream>
    #include
    <cstdio>
    #include
    <cstdlib>
    #include
    <cstring>
    using namespace std;

    #define maxn 1000000

    bool prime[maxn];

    int main()
    {
    //freopen("D:\\t.txt", "r", stdin);
    memset(prime, true, sizeof(prime));
    for (int i = 3; i <= 1000; i += 2)
    for (int j = 3; j <= maxn / i; j += 2)
    if (prime[i])
    prime[i
    * j] = false;
    for (int i = 4; i <= maxn; i += 2)
    prime[i]
    = false;
    prime[
    1] = prime[0] = false;

    int a, d, n;
    while (scanf("%d%d%d", &a, &d, &n) != EOF && !(a == 0 && d == 0 && n == 0))
    {
    int p;
    for (p = a; n > 0; p += d)
    {
    if (prime[p])
    n
    --;
    }
    printf(
    "%d\n", p - d);
    }
    return 0;
    }
  • 相关阅读:
    结构体比较
    不定长参数列表用法
    接口
    字符串数据类型
    *和**的打包和解包
    python类常用装饰器
    继承的实现
    map用法
    包的导入和init函数
    协程
  • 原文地址:https://www.cnblogs.com/rainydays/p/1967658.html
Copyright © 2011-2022 走看看