Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Get smallest dividers
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
//Title of this code #include <iostream> #include <cmath> using namespace std; /* IDEA: Get biggest dividers and put togethet in sorted order */ int getSmallestDividers(int num) { if (num < 1) return -1; if (num == 1) return 1; int out = 0; int j = 0; for (int i = 9; i > 1; --i) { while (num % i == 0) { num /= i; out += pow(10, j) * i; ++j; } } if (num > 1) return -1; return out; } int main() { cout << getSmallestDividers(14) << endl; cout << getSmallestDividers(36) << endl; cout << getSmallestDividers(80) << endl; cout << getSmallestDividers(810) << endl; }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 0.42 sec, absolute running time: 0.15 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.57 sec
fork mode
|
history
|
discussion
27 49 258 2599