Project Euler 11-20练习题希望自己坚持下去

11题

// Pro11.cpp : 定义控制台应用程序的入口点。
//

#include <iostream>

using namespace std;

static int Grid[20][20] = {
    8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8,
    49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0,
    81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65,
    52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91,
    22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80,
    24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50,
    32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70,
    67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21,
    24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72,
    21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95,
    78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92,
    16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57,
    86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58,
    19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40,
    4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66,
    88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69,
    4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36,
    20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16,
    20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54,
    1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48,
};


//传入行列，算出最大值
int GetGreatest(int i, int j)
{
    //计算列乘积
    int col_max = 0;
    for (int row = i; row < i + 4; ++row)
    {
        int num = 1;
        for (int col = 0; col < 4; ++col)
        {
            num *= Grid[row][j+col];
            //cout << row << j+col << num << endl;
        }
        col_max = num > col_max ? num : col_max;
    }
    //计算行乘积
    int row_max = 0;
    for (int col = j; col < j + 4; ++col)
    {
        int num = 1;
        for (int row = 0; row < 4; ++row)
        {
            num *= Grid[i+row][col];
            //cout << i + row << col << num << endl;
        }
        row_max = num > row_max ? num : row_max;
    }
    //计算对角线乘积
    int diagonal1_max = 1;
    int diagonal2_max = 1;
    for (int k = 0; k < 4; ++k)
    {
        diagonal1_max *= Grid[i + k][j + k];
        diagonal2_max *= Grid[i + k][j + 3 - k];
    }
    int max_num = col_max;
    max_num = row_max > max_num ? row_max : max_num;
    max_num = diagonal1_max > max_num ? diagonal1_max : max_num;
    max_num = diagonal2_max > max_num ? diagonal2_max : max_num;
    return max_num;
}

int main(int argc, char* argv[])
{
    int max_num = 0;
    for (int i = 0; i < 20-4; ++i)
    {
        for (int j = 0; j < 20-4; ++j)
        {
            int ret = GetGreatest(i, j);
            if (ret > max_num)
            {
                max_num = ret;
            }
        }
    }
    cout << "Result MaX" << max_num << endl;

	return 0;
}

12题

#include <iostream>

using namespace std;

//返回所有约数和约数的总数  
//1.确立最小质数1  
//2.若可以整除，则返回该质数和整除结果作为输入数的约数  
//3.不能整除则将最小质数+1  
int PrimeFactorization(int n){
    int min = 1;
    int max = (int)floor(sqrt((double)n));
    int sum = 0;
    if (max == sqrt(n)) {
        sum++;
        max--;
    }
    for (int i = min; i <= max; i++) {
        if (n % i == 0)
        {
            sum += 2;
        }
    }
    return sum;
}

int main(int argc, char** argv)
{
    int sum = 0;
    for (int i = 0; i < INT_MAX; ++i)
    {
        sum += i;
        int num = PrimeFactorization(sum);
        if (num >= 500)
        {
            break;
        }
    }
    cout << "Find:" << sum << endl;

    return 0;
}