摘要：
#include"stdio.h"#include"string.h"#include"stdlib.h"#include"math.h"int set[10000000]={0};int p[5000000];void fun(int n){ int t=(int )sqrt(n+1); for(int i=3;i<=t;i+=2) { if(set[i/2]) continue; int k=i*i,p=i+i; for(int j=k;j<=n;j+=p) { set[j/2]=1; } } in 阅读全文
摘要：
#include"stdio.h"#include"string.h"#include"stdlib.h"#include"math.h"#define MAXSIZE 10000000int prim[MAXSIZE+5];void fun(){ memset(prim,0,sizeof(prim)); prim[0]=prim[1]=1; for(int i=4;i<=MAXSIZE;i+=2) { prim[i]=1; } double t=sqrt(MAXSIZE); for(int i=3;i< 阅读全文
摘要：
#include<stdio.h>#include<math.h>#include<iostream.h>#include<stdlib.h>int gcd(int m,int n){ return n==0?m: gcd(n,m%n);}int main(){ int m,n; while(scanf("%d%d",&m,&n)!=EOF) { printf("%d %d\n",gcd(m,n),((m*n)/gcd(m,n))); getchar(); } return 0;} 阅读全文