Submission #3194017

---

Source Code Expand

var
 a,b,n,m,x:longint;
function gcd(x,y:longint):longint;
begin
 if x mod y=0 then exit(y) else exit(gcd(y,x mod y));
end;
begin
 readln(a,b,n);
 x:=(a*b) div gcd(a,b);
 while m<n do m:=m+x;
 writeln(m);
end.

Submission Info

Compile Error

/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?

Judge Result