69,369
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#include <math.h>
#include <string.h>
#define N 1000
int prim[N];
void init()
{
int i,j,k,flag;
memset(prim,0,sizeof(prim));
prim[1] = 1;
prim[2] = 2;
prim[3] = 3;
for(i = 4,k =4; i<N; ++i)
{
for(flag=0,j = 2; j*j<i; ++j)
if(i%j == 0)
{
flag = 1;
break;
}
if(!flag) prim[k++] = i;
}
}
int main(){
init();
int i,j,sum,k,t;
int tmp[100];
for(i = 6; i<N; ++i)
{
for(j = 1,sum = 0, k = 0; j < N; ++j)
{
sum += prim[j];
tmp[k++] = prim[j];
if(sum == i)
{
printf("%d",tmp[0]);
for(t = 1; t < k; ++t)
printf("+%d",tmp[t]);
printf("=%d\n",i);
}
else if(sum > i)
break;
}
}
return 0;
}
#include <stdio.h>
#include <math.h>
int main(){
int n,a,i;
long b,sum=0;
//system("cls");
printf("input a=:\n");
scanf("%d",&a);
printf("input n=:\n");
scanf("%d",&n);
for(i=n; i>=1; i--)
{
sum += sum*10 + a;
}
printf("\n%d",sum1);
//getch();
return 0;
}
#include <stdio.h>
int gcd(int a, int b) //返回最大公约数
{
return b != 0 ? gcd(b,a%b) : a;
}
int main(){
int m,n;
scanf("%d %d",&m,&n);
int v = gcd(m,n);
printf("%d %d\n",v,m*n/v);//最小公倍数=m*n/最大公约数
return 0;
}