摘要：
#include#include#include#includeint 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;} 阅读全文
摘要：
#include"stdio.h"#define N 13#define M 100005int a[N][M];int b[N][M];int main(){ int i,j; int n; int k; int hl,hm,hr; int max; while(scanf("%d",&n)!=EOF) { if(n==0) return 0; k=0; for(i=0;ihm?hl:hm; max=max>hr?max:hr; a[i][j]=max; } } max=0; for(i=1,j=k;imax) { max=a[i][j] 阅读全文
摘要：
#include"stdio.h"#include"iostream"#include"algorithm"#include"map"using namespace std;int n,k,M;struct Matrix{ void init() { memset(m,0,sizeof(m)); } Matrix operator *(Matrix t) { Matrix t1; t1.init(); for(int i=0;i<n;++i) for(int j=0;j<n;++j) { for(int 阅读全文