Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Count of factors
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//g++ 7.4.0 #include <bits/stdc++.h> using namespace std; const int N = 100001; int factors[N]; void fun(){ factors[1] = 1; for(int i=2;i<N;i++){ factors[i]=i; } for(int i=4;i<N;i+=2){ factors[i]=2; } for(int i=3;i*i<N;i++){ if(factors[i]==i){ for(int j=2*i;j<N;j+=i){ if(factors[j]==j) factors[j]=i; } } } } int solve(int n){ int ans=1; int cnt=1; int d = factors[n]; int next = n/factors[n]; while(next!=1){ if(factors[next]==d){ cnt++; } else{ ans = ans * (cnt+1); cnt = 1; d = factors[next]; } next = next/factors[next]; } ans = ans * (cnt+1); return ans; } int main() { fun(); cout<<solve(20); }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 1.83 sec, absolute running time: 0.18 sec, cpu time: 0.02 sec, memory peak: 3 Mb, absolute service time: 2,11 sec
edit mode
|
history
|
discussion
6