Submission #605947

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is >> a.first >> a.second; }
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os << a.first << " "<<a.second; }
template<typename T> istream& operator>>(istream& is, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) is >> vc[i]; return is; }
template<typename T> ostream& operator<<(ostream& os, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) os << vc[i] << endl; return os; }

#define reps(i, j, n) for(int i = j; i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define UNQ(s) { sort(ALL(s)); (s).erase(unique( ALL(s)), (s).end());}

typedef long long int64;
const int INF = 1 << 30;
typedef pair< int , int > Pi;
typedef pair< int , Pi > Pii;

int main()
{
  int a, b, n;
  cin >> a >> b >> n;
  while(true) {
    if(n % a == 0 && n % b == 0) {
      cout << n << endl;
      exit(0);
    }
    ++n;
  }
}

Submission Info

Judge Result