Program Seeking KPK in C + + and jeliot.

Multiples of the smallest alliance (KPK) is the smallest multiples of a combination of several numbers

#include <cstdlib>

#include <iostream>

using namespace std;

class Kpk{

public:

int kpk(int,int);

private:

int nilai;

};

int Kpk::kpk(int a, int b){

nilai=0;

for(int i=1;i<=b;i++){

nilai=nilai+a;

if(nilai%b==0){

return nilai;

break;}}

int main(int argc, char *argv[])

{

int c, d;

cout<<”Masukkan angka – angkanya: “<<endl;

cin>>c>>d;

Kpk bilangan;

cout<<”Kpk nya adalah : “<<bilangan.kpk(c,d);

cout<<endl;

system(“PAUSE”);

return EXIT_SUCCESS;

}

Versi jeliot

import jeliot.io.*;
class kpk
{public kpk(){ nilai = 0;}
public void masukan()
{ System.out.print(“Masukkan Nilai Bil A : “);
a = Input.readInt();
System.out.print(“Masukkan Nilai Bil B : “);
b = Input.readInt();
for(int x =1;x<=b;x++)
{  nilai =nilai+a;
if(nilai % b ==0)      {
System.out.print(“KPK Antara “);
System.out.print(a);