2. C++ :
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n, m, kpk;
cout <<"masukan angka pertama : ";
cin >> m;
cout <<"masukan angka kedua : ";
cin >> n;
kpk =0;
while (1)
{
kpk =kpk+m;
if (kpk % n==0) break;
}
cout << kpk << endl;
return 0;
}
3. JELIOT :
import jeliot.io.*;
public class MyClass {public static void kpk (int x, int y){
int kpk = 0;
while (true)
{
kpk = kpk + x;
if (kpk % y == 0)
break;
}
System.out.print(kpk);
System.out.print("\n");
}
public static void main() {
int n;
int m;
System.out.print("masukan angka pertama : ");
m=Input.readInt();
System.out.print("masukan angka kedua : ");
n=Input.readInt();
kpk(m,n);
// Your algorithm goes here.
}
}
0 komentar:
Posting Komentar