zoukankan      html  css  js  c++  java
  • 素数筛 uva 543

    给你一个n求出n由2个奇质因子的和  这2个因子差最大

    没有就输出‘Goldbach's conjecture is wrong.

    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #include<vector>
    #include<math.h>
    
    using namespace std;
    #define MAXN 1000010
    bool pri[MAXN];
    
    int main()
    {
        memset(pri,0,sizeof(pri));
    
        for(int i=2;i<=1000;i++)
        {
            if(!pri[i])
                for(int j=i*i;j<=MAXN;j=j+i)
                    pri[j]=1;
        }
        int n;
    
        while(scanf("%d",&n)!=EOF&&n)
        {
            int a=n/2,i;
            for(i=3;i<=a;i++)
                if(!pri[i]&&!pri[n-i])
                {
                    printf("%d = %d + %d
    ",n,i,n-i);
                    break;
                }
            if(i>a)
                printf("‘Goldbach's conjecture is wrong.
    ");
        }
    
        return 0;
    }
  • 相关阅读:
    API
    API
    for in
    event flow
    object
    Report of program history
    正则表达式
    伪类与伪元素
    Position
    js学习之原型(补充)
  • 原文地址:https://www.cnblogs.com/cherryMJY/p/6170964.html
Copyright © 2011-2022 走看看