#include <iostream>
using namespace std;
int GCD( int m, int n ) // greatest common divisor
{
if ( m < n )
{
swap( m, n );
}
int r = m % n;
while ( r != 0 )
{
m = n;
n = r;
r = m % n;
}
return n;
}
int main()
{
int lcm(1); // least common multiple
for ( int i = 2; i <= 20; ++i )
{
lcm = i / GCD( i, lcm ) * lcm;
}
cout << lcm << endl;
return 0;
using namespace std;
int GCD( int m, int n ) // greatest common divisor
{
if ( m < n )
{
swap( m, n );
}
int r = m % n;
while ( r != 0 )
{
m = n;
n = r;
r = m % n;
}
return n;
}
int main()
{
int lcm(1); // least common multiple
for ( int i = 2; i <= 20; ++i )
{
lcm = i / GCD( i, lcm ) * lcm;
}
cout << lcm << endl;
return 0;
}