#include<stdio.h>intmain(){int a ,b;scanf("%d%d",&a,&b);int max =(a>b)?a:b;int i=0;for( i = max;i <= a*b; i++){if((i%a ==0)&&(i%b ==0)){printf("%d",i);break;}}return0;}
一、正整数A和正整数B 的最小公倍数是指 能被A和B整除的最小的正整数值,设计一个算法,求输入A和B的最小公倍数。```代码如下(示例):#include<stdio.h>int main(){ int a ,b; scanf("%d%d",&a,&b); int max = (a>b)?a:b; int i= 0; for( i = max;i <= a*b; i++) { .