#include <stdio.h>
 
int GCD(int x, int y);//最大公約数を求める
int KEISAN(int x, int y);//最小公倍数に変換する
 
int main(){
    int x,y,LCM_num;
    puts("xの値を入力");
    scanf("%d",&x);
    puts("yの値を入力");
    scanf("%d",&y);
 
    LCM_num = KEISAN(x,y);
    printf("%dと、%dから%dまでの最小公倍数は%dです",x,y,y+9,LCM_num);
 
    return 0;
}
 
int GCD(int x, int y){
    int r;
    while((r = x%y) =! 0){//ユークリッドの互除法
        x = y;
        y = r;
    }
    return y;
}
 
int KEISAN(int x, int y){
    int i;
    for(i=y;i<y+10;y++){
        y = i;
        x = x*y / GCD(x,y);
    }
    return x;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiAKaW50IEdDRChpbnQgeCwgaW50IHkpOy8v5pyA5aSn5YWs57SE5pWw44KS5rGC44KB44KLCmludCBLRUlTQU4oaW50IHgsIGludCB5KTsvL+acgOWwj+WFrOWAjeaVsOOBq+WkieaPm+OBmeOCiwogCmludCBtYWluKCl7CiAgICBpbnQgeCx5LExDTV9udW07CiAgICBwdXRzKCJ444Gu5YCk44KS5YWl5YqbIik7CiAgICBzY2FuZigiJWQiLCZ4KTsKICAgIHB1dHMoInnjga7lgKTjgpLlhaXlipsiKTsKICAgIHNjYW5mKCIlZCIsJnkpOwogCiAgICBMQ01fbnVtID0gS0VJU0FOKHgseSk7CiAgICBwcmludGYoIiVk44Go44CBJWTjgYvjgoklZOOBvuOBp+OBruacgOWwj+WFrOWAjeaVsOOBryVk44Gn44GZIix4LHkseSs5LExDTV9udW0pOwogCiAgICByZXR1cm4gMDsKfQogCmludCBHQ0QoaW50IHgsIGludCB5KXsKICAgIGludCByOwogICAgd2hpbGUoKHIgPSB4JXkpID0hIDApey8v44Om44O844Kv44Oq44OD44OJ44Gu5LqS6Zmk5rOVCiAgICAgICAgeCA9IHk7CiAgICAgICAgeSA9IHI7CiAgICB9CiAgICByZXR1cm4geTsKfQogCmludCBLRUlTQU4oaW50IHgsIGludCB5KXsKICAgIGludCBpOwogICAgZm9yKGk9eTtpPHkrMTA7eSsrKXsKICAgICAgICB5ID0gaTsKICAgICAgICB4ID0geCp5IC8gR0NEKHgseSk7CiAgICB9CiAgICByZXR1cm4geDsKfQ==

MiAx

2 1