#208965 (C++11) No.442 和と積

• 問題: No.442 和と積
• ユーザー: komori3
• 提出日時: 2017-10-11 17:45:25
• 言語: C++11 (gcc 11.4.0)
• 結果: TLE
• 実行時間: -
• コード長: 2,716 bytes
• コンパイル時間: 795 ms
• コンパイル使用メモリ: 87,084 KB
• 実行使用メモリ: 10,496 KB
• 最終ジャッジ日時: 2024-11-17 09:43:46
• 合計ジャッジ時間: 3,694 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	13 ms; 10,496 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	4 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	4 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	12 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	1 ms; 5,248 KB
testcase_12	AC	1 ms; 5,248 KB
testcase_13	AC	1 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	3 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	2 ms; 5,248 KB
testcase_19	AC	4 ms; 5,248 KB
testcase_20	TLE	-

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



map<lint, lint> Factorization(lint n)
{
	map<lint, lint> res;
	lint i;

	for (i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			res[i]++;
			n /= i;
		}
	}

	if (n > 1) res[n]++;

	return res;
}

lint ipow(lint x, lint n)
{
	lint i, ret = 1;
	for (i = 0; i < n; i++)
		ret *= x;
	return ret;
}

int yuki0442()
{
	lint A, B;
	cin >> A >> B;

	map<lint, lint> a, b, sum, prod;
	
	sum = Factorization(A + B);

	a = Factorization(A);
	b = Factorization(B);

	for (auto itr = a.begin(); itr != a.end(); itr++) {
		prod[itr->first] += itr->second;
	}
	for (auto itr = b.begin(); itr != b.end(); itr++) {
		prod[itr->first] += itr->second;
	}

	lint ans = 1;
	for (auto itr = sum.begin(); itr != sum.end(); itr++) {
		lint e = min(itr->second, prod[itr->first]);
		ans *= ipow(itr->first, e);
	}

	cout << ans << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0442();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}