zoukankan      html  css  js  c++  java
  • 【Difference Between Primes HDU

    这道题很坑,注意在G++下提交,否则会WA,还有就是a或b中较大的那个数的范围。。

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std; 
    const int maxn = 1e6 + 10;
    int prime[maxn];
    bool isprime[maxn];
    int init()
    {
        memset(prime, 0, sizeof(prime));
        isprime[0] = isprime[1] = false;
        for(int i = 2; i <= maxn; i++)
            isprime[i] = true;
        int cnt = 0;
        for(int i = 2; i <= maxn; i++)
        {
            if(isprime[i])
            {
                for(int j = i * 2; j <= maxn; j += i)
                    isprime[j] = false;
                prime[cnt++] = i;
            }
        }
        return cnt;
    }
    
    int T, n;
    int main()
    {
        // freopen("input.txt", "r", stdin);
        // freopen("output.txt", "w", stdout);
        int cnt = init();
        scanf("%d", &T);
        while(T--)
        {
            scanf("%d", &n);
            int sign = 0, flag = 0;
            if(n < 0)
            {
                n = -n;
                sign = 1;
            }
            for(int i = 0; i < cnt; i++)
            {
                if(n + prime[i] < maxn - 10 && isprime[n + prime[i]])
                {
                    flag = 1;
                    if(sign)
                        printf("%d %d
    ", prime[i], n + prime[i]);
                    else 
                        printf("%d %d
    ", prime[i] + n, prime[i]);
                    break;
                }
            }
            if(!flag)
                printf("FAIL
    ");
        }
    }
    
  • 相关阅读:
    huffman压缩解压文件
    C++ fstream 详解
    huffman编码
    ios cocoapods
    POI2Vec: Geographical Latent Representation for Predicting Future Visitors
    latex生成pdf 出现missing$ inserted
    矩阵、向量求导法则

    矩阵范数求导
    hive
  • 原文地址:https://www.cnblogs.com/KeepZ/p/11553774.html
Copyright © 2011-2022 走看看