13226번 Divisors Again

약수의 개수를 응용한 문제이다.

https://www.acmicpc.net/problem/13226

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
 
using namespace std;
 
#define MAX 10000000
 
int C = 0;
 
int Divisors[MAX + 1] = { 0, };
 
void getFactorsBrute()
{
    memset(Divisors, 0, sizeof(Divisors));
 
    for (int i = 1; i <= MAX; i++)
    {
        for (int j = i; j <= MAX; j += i)
        {
            ++Divisors[j];
        }
    }
}
 
int main(void)
{
    scanf("%d", &C);
 
    getFactorsBrute();
 
    for (int tc = 1; tc <= C; tc++)
    {
        int L = 0, U = 0;
 
        scanf("%d %d", &L, &U);
 
        int result = -1;
 
        for (int i = L; i <= U; i++)
        {
            if (result < Divisors[i]) result = Divisors[i];
        }
 
        printf("%d\n", result);
    }
 
    return 0;
}