Submission #6857350

---

Source Code Expand

#include<math.h>
#include<map>
#include<iostream>
#include <algorithm>
#include <string>
#include<vector>
#include<array>
#include<tuple>
#include<queue>
#include<stack>
#include<iomanip>
#include<bitset>
#include <list>
#include<numeric>
//AtCoderC++.cpp

using namespace std;

inline int ceiling(int n, int d) {
	return n % d == 0 ? n / d : n / d + 1;
}

int get_gcd(int m, int n) {
	if (m < n)return get_gcd(n, m);
	if (n == 0)return m;
	return get_gcd(n, m%n);
}

int main() {
	int a, b, n; cin >> a >> b >> n;
	auto min = a * b / get_gcd(a, b);
	auto answer = min;
	while (answer < n) answer += min;	
	cout << answer << endl;
}

Submission Info

Judge Result