zoukankan      html  css  js  c++  java
  • 素数---小修改2

    #include<stdio.h>
    int main()
    {
        int n,a,b,i;
        int sum=0   ;
    
        scanf("%d%d",&a,&b);
        {
            for (n=a;n<=b;n++)
            {
                for (i=2;i<=n-1;i++)
                    if (n%i==0) break;
                if (i>=n)
    
    
                    sum+=n;
            }
            printf("%d",sum);
            printf("
    ");
        }
    }
    View Code

    #include<stdio.h>
    int main()
    {
    int n,a,b,i;
    int sum=0 ;

    scanf("%d%d",&a,&b);
    {
    for (n=a;n<=b;n++)
    {
    for (i=2;i<=n-1;i++)
    if (n%i==0) break;
    if (i>=n)


    sum+=n;
    }
    printf("%d",sum);
    printf(" ");
    }
    }

    #include<stdio.h>
    int main()
    {
        int n,a,b,i;
        int sum=0   ;
    
        while ( scanf("%d%d",&a,&b)==2)
        {
            for (n=a;n<=b;n++)
            {
                for (i=2;i<=n-1;i++)
                    if (n%i==0) break;
                if (i>=n)
    
    
                    sum+=n;
            }
            printf("%d",sum);
            printf("
    ");
        }
    }
    View Code

    #include<stdio.h>
    int main()
    {
    int n,a,b,i;
    int sum=0 ;

    while ( scanf("%d%d",&a,&b)==2)
    {
    for (n=a;n<=b;n++)
    {
    for (i=2;i<=n-1;i++)
    if (n%i==0) break;
    if (i>=n)


    sum+=n;
    }
    printf("%d",sum);
    printf(" ");
    }
    }

     

    ****************************************************************************************************************************************

    #include<stdio.h>
    int main()
    {
        int n,a,b,i;
        int j,s;
        int c[1000];
      while ( scanf("%d%d",&a,&b)==2)
        {
            j=0;
            for (n=a;n<=b;n++)
            {
                for (i=2;i<=n-1;i++)
                    if (n%i==0) break;
                if (i>=n)
                
                    c[j++]=n;
               
            }
           
            
             s=0;
            for (i=0;i<j;i++)
                s=s+c[i];
            printf("%d
    ",s);
        }
        return 0;
    }
    View Code

    #include<stdio.h>
    int main()
    {
    int n,a,b,i;
    int j,s;
    int c[1000];
    while ( scanf("%d%d",&a,&b)==2)
    {
    j=0;
    for (n=a;n<=b;n++)
    {
    for (i=2;i<=n-1;i++)
    if (n%i==0) break;
    if (i>=n)

    c[j++]=n;

    }


    s=0;
    for (i=0;i<j;i++)
    s=s+c[i];
    printf("%d ",s);
    }
    return 0;
    }

  • 相关阅读:
    POJ2001Shortest Prefixes[Trie]
    UVA
    POJ2528Mayor's posters[线段树 离散化]
    COGS130. [USACO Mar08] 游荡的奶牛[DP]
    POJ1962Corporative Network[带权并查集]
    BZOJ1798: [Ahoi2009]Seq 维护序列seq[线段树]
    洛谷U4859matrix[单调栈]
    COGS247. 售票系统[线段树 RMQ]
    COGS1008. 贪婪大陆[树状数组 模型转换]
    COGS182 [USACO Jan07] 均衡队形[RMQ]
  • 原文地址:https://www.cnblogs.com/2014acm/p/3901206.html
Copyright © 2011-2022 走看看