素數---小修改2

來源:互聯網
上載者:User

標籤:style   blog   http   color   os   io   for   2014   

 

 

 

 

#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("\n");    }}
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("\n");
}
}

 

 

 

 

 

 

 

 

 

 

 

 

 

 

#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("\n");    }}
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("\n");
}
}

 

 

 

 

 

 

 

 

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

 

 

#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\n",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\n",s);
}
return 0;
}

 

 

 

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.