Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

RGB7316 - Гурван тооны ХБЕХ

Өгөгдсөн 3 натурал тооны хамгийн бага ерөнхий хуваагдагчийг (ХБЕХ) ол.

Input

Нэг мөрөнд 3 натурал тоо зайгаар тусгаарлагдан өгөгдөнө. Тоонууд 1200-аас ихгүй.

Output

ХБЕХ

Example

Input:

4 6 18

Output:

36


Нэмсэн:Bataa
Огноо:2013-01-14
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 BASH BF C NCSHARP CSHARP C++ 4.3.2 CPP C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO JULIA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON PYPY3 PYTHON3 RUBY SCALA SCM guile ST TCL WHITESPACE

hide comments
2023-08-19 22:46:23
hope someone willl publish it >:)

Last edit: 2023-08-19 22:47:25
2023-05-10 11:48:04
hi no code here >:)
































































































































bro i said no code here











































































































































BRO STOP SCROLLING




































































































































I SAID STOP









































































































































ALR HERE IS THE CODE


















































































































































HAHA SIKE L BOZO
2023-05-09 03:01:15
mr bombastic bomba fantasta Telmuun.B
2023-05-02 08:09:24
mr boombastic
2023-05-02 08:09:24
mr boombastic
2023-03-14 03:14:59
hugatsaanii hyzgaarlalt hetersen geed avdggue arai gej bodsiimsan, durgui hurchle yrshig huul2 hha

#include <stdio.h>
int main(){
int num1, num2, num3, max, lcm;
num1 <= 1200;
num2 <= 1200;
num3 <= 1200;
scanf("%d %d %d", &num1, &num2, &num3);
max = (num1 > num2) ? ((num1 > num3) ? num1 : num3) : ((num2 > num3) ? num2 : num3);
while(1) {
if(max % num1 == 0 && max % num2 == 0 && max % num3 == 0) {
lcm = max;
break;
}
max++;
}
printf("%d", lcm);
return 0;
}
2023-03-07 07:30:17
#include <iostream>

using namespace std;

int main()
{
int a,b,c,n=0,hariu=0;
cin>>a>>b>>c;
for(int i=0; i<b; i++){
n+=a;
if(n%b==0) break;
}
for(int i=0; i<c; i++){
hariu+=n;
if(hariu%c==0) break;
}
cout<<hariu;
return 0;
}
2023-02-09 11:52:10
bty huulaad bai huurnuudee
2023-01-31 06:51:50
bitgii huulaad bai deeshee har
2022-12-31 15:27:12
#include<stdio.h>
main()
{
int a,b,c,d;
scanf("%d %d %d",&a,&b,&c);
if(a>b && a>c) d=a;
else if(b>a && b>c) d=b;
else if(c>a && c>b) d=c;
while(1)
{
if(d%a==0 && d%b==0 && d%c==0){
printf("%d",d);
break;
}
d++;
}
return 0;
}

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.