poj 2545 Hamming Problem

最新推荐文章于 2024-09-28 22:47:40 发布

yzl_rex

最新推荐文章于 2024-09-28 22:47:40 发布

阅读量664

点赞数

分类专栏： POJ 文章标签： n2 numbers output less system input

本文链接：https://blog.csdn.net/yzl_rex/article/details/7636806

版权

POJ 专栏收录该内容

191 篇文章 0 订阅

订阅专栏

//就开始被 All numbers in input and output are less than 10^18吓到了！原来用long long轻松解决了！ 
//同2247 1338是同一类型的题目！ 
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    long long i, n1, n2, n3, num, primer1, primer2, primer3, ans;
    cin >> primer1 >> primer2 >> primer3 >> num;
    long long *hamming = new long long[num+10];
    hamming[1] = 1;
    n1 = 1;
    n2 = 1;
    n3 = 1;
    for (i = 2; i <= num+1; i++)
    {
        hamming[i] = min(hamming[n1]*primer1, min(hamming[n2]*primer2, hamming[n3]*primer3));
        if (hamming[i] == hamming[n1]*primer1)
           n1++;
        if (hamming[i] == hamming[n2]*primer2)
           n2++;
        if (hamming[i] == hamming[n3]*primer3)
           n3++;
    }
    cout << hamming[num+1] << endl;
    system("pause");
}