Submission #1572466

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <limits>
using namespace std;

double inf = numeric_limits<double>::infinity();

int cnt[168];

int main() {
    int num = 168;
    int primes[] = {
        2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
        31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
        73, 79, 83, 89, 97,
        
        101, 103, 107, 109, 113, 127, 131, 137, 139, 149,
        151, 157, 163, 167, 173, 179, 181, 191, 193, 197,
        199,
        
        211, 223, 227, 229, 233, 239, 241, 251, 257, 263,
        269, 271, 277, 281, 283, 293,
        
        307, 311, 313, 317, 331, 337, 347, 349, 353, 359,
        367, 373, 379, 383, 389, 397,
        
        401, 409, 419, 421, 431, 433, 439, 443, 449, 457,
        461, 463, 467, 479, 487, 491, 499,
        
        503, 509, 521, 523, 541, 547, 557, 563, 569, 571,
        577, 587, 593, 599,
        
        601, 607, 613, 617, 619, 631, 641, 643, 647, 653,
        659, 661, 673, 677, 683, 691,
        
        701, 709, 719, 727, 733, 739, 743, 751, 757, 761,
        769, 773, 787, 797,
        
        809, 811, 821, 823, 827, 829, 839, 853, 857, 859,
        863, 877, 881, 883, 887,
        
        907, 911, 919, 929, 937, 941, 947, 953, 967, 971,
        977, 983, 991, 997
    };
    
    int i;
    cin >> i;
    
    for (int j = 0; j < 168; j++) {
        cnt[j] += i / primes[j]
        + i / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j]
        + i / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j] / primes[j];
    }
    
    long MOD = 1e9 + 7;
    long ans = 1;
    
    for (int i = 0; i < 168; i++) {
        ans *= 1 + cnt[i];
        ans %= MOD;
    }
    cout << ans << endl;
    
}

Submission Info

Submission Time
Task C - Factors of Factorial
User xuzijian629
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2416 Byte
Status AC
Exec Time 1 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 1 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 1 ms 256 KB
subtask_1_certain_04.txt AC 1 ms 256 KB
subtask_1_rand_01.txt AC 1 ms 256 KB
subtask_1_rand_02.txt AC 1 ms 256 KB
subtask_1_rand_03.txt AC 1 ms 256 KB