Submission #2548842


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<stdio.h>
 
using namespace std;
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define SWAP(a,b) (a += b,b = a - b,a -= b)
#define ll long long

const int MOD = 1e9 + 7;

int main()
{
    int a, b, n;
    cin >> n;
    vector<int> x(n + 1, 0);
    FOR(i, 1, n + 1)
    {
        int rest = i;
        FOR(j, 2, n + 1)
        {
            while(rest % j == 0)
            {
                rest /= j;
                x[j]++;
            }
        }
    }

    ll out = 1;
    FOR(i, 1, n + 1)
    {
        if(x[i] != 0)
        {
            out *= (x[i] + 1);
            out %= MOD;
        }
    }
    cout << out << endl;
}

Submission Info

Submission Time
Task C - Factors of Factorial
User shira
Language C++14 (GCC 5.4.1)
Score 300
Code Size 869 Byte
Status AC
Exec Time 5 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_certain_01.txt, subtask_1_certain_02.txt, subtask_1_certain_03.txt, subtask_1_certain_04.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 5 ms 256 KB
subtask_1_certain_01.txt AC 1 ms 256 KB
subtask_1_certain_02.txt AC 1 ms 256 KB
subtask_1_certain_03.txt AC 4 ms 256 KB
subtask_1_certain_04.txt AC 4 ms 256 KB
subtask_1_rand_01.txt AC 2 ms 256 KB
subtask_1_rand_02.txt AC 2 ms 256 KB
subtask_1_rand_03.txt AC 2 ms 256 KB