Submission #2210741


Source Code Expand

#include <bits/stdc++.h>

#define INF 1 << 29
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)

using namespace std;

typedef pair<int,int> pii;
typedef long long int ll;

void gen_sosuu(int sosuu[]){
  REP(i,100010){
    sosuu[i] = true;
  }
  sosuu[0] = false;
  sosuu[1] = false;
  sosuu[2] = true;
  FOR(i,2,100000){
    if(sosuu[i] == false) continue;
    for(int j = 2; i*j<=100000;j++){
      //printf("%d %d %d\n",i*j,i,j);
      sosuu[i*j] =false;
    }
  }
}

int x;
int sosuu[100010] = {0};
int yakusu[1001] = {0};
ll mod = 1000000007;

ll calc(int i,int n){
  ll ans = 1;
  ll tmp = 1;
  while(i>0){
    tmp *= n;
    tmp %= mod;
    if(i%2==1){
      ans *= tmp;
      ans %= mod;
    }
    i/=2;
  }
  return ans;
}


int main(){
  scanf("%d",&x);
  gen_sosuu(sosuu);
  FOR(i,2,x+1){
    REP(j,i+1){
      if(sosuu[j]==true && i%j==0){
        int tmp = i;
        while(tmp%j==0){
          yakusu[j]++;
          tmp/=j;
        }
      }
    }
  }
  ll ans = 1;
  FOR(i,2,x+1){
    ans *= yakusu[i]+1;
    ans %= mod;
  }
  printf("%lld\n",ans);
}

Submission Info

Submission Time
Task C - Factors of Factorial
User kumegon
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1181 Byte
Status AC
Exec Time 3 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:50:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

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 2 ms 640 KB
sample_02.txt AC 2 ms 640 KB
sample_03.txt AC 3 ms 640 KB
subtask_1_certain_01.txt AC 2 ms 640 KB
subtask_1_certain_02.txt AC 2 ms 640 KB
subtask_1_certain_03.txt AC 3 ms 640 KB
subtask_1_certain_04.txt AC 3 ms 640 KB
subtask_1_rand_01.txt AC 2 ms 640 KB
subtask_1_rand_02.txt AC 2 ms 640 KB
subtask_1_rand_03.txt AC 2 ms 640 KB