Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Building squares using smallest amount of matches
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
#include <iostream> #include <cmath> /* Problem: * what is the smallest number of matches needed to make n squares * with side=1 match? n is given by user through stdin. */ //Rewrote this code in c89, but it doesn't work on Rextester int main(){ unsigned input; std::cin>>input; unsigned root=sqrt(input), squared_root=root*root; register unsigned sum=2*(squared_root+root); input-=squared_root; if(input>0) sum+=1+2*input+input/root; std::cout<<sum<<'\n'; }
g++
21
Show compiler warnings
[
+
] Compiler args
[
-
]
Show input
Compilation time: 0.42 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.57 sec
edit mode
|
history
|
discussion
52