aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorInigoGutierrez <inigogf.95@gmail.com>2017-12-03 01:54:07 +0100
committerInigoGutierrez <inigogf.95@gmail.com>2017-12-03 01:54:07 +0100
commitd938f6fc299752dd454cc90d928173bed70882f5 (patch)
tree7e08f792e899df7886dec595ef188b1e0a7dd6d7
parent3f7848dc0abda4f164a964cc7ceeac40bd602016 (diff)
downloadAceptaElReto-d938f6fc299752dd454cc90d928173bed70882f5.tar.gz
AceptaElReto-d938f6fc299752dd454cc90d928173bed70882f5.zip
Problema 402 (Dimensiones del puzzle) resuelto.
-rw-r--r--AceptaElReto/src/problemas/Problema402DimensionesDelPuzzle.java62
1 files changed, 31 insertions, 31 deletions
diff --git a/AceptaElReto/src/problemas/Problema402DimensionesDelPuzzle.java b/AceptaElReto/src/problemas/Problema402DimensionesDelPuzzle.java
index 3a68741..fd334ec 100644
--- a/AceptaElReto/src/problemas/Problema402DimensionesDelPuzzle.java
+++ b/AceptaElReto/src/problemas/Problema402DimensionesDelPuzzle.java
@@ -1,31 +1,31 @@
-package problemas;
-
-public class Problema402DimensionesDelPuzzle {
-
- static java.util.Scanner in;
-
- public static void main(String args[]) {
- in = new java.util.Scanner(System.in);
- int caso;
- while ( true ) {
- caso = in.nextInt();
- if ( caso == 0 ) {
- break;
- }
- System.out.println(casoDePrueba(caso));
- }
- }
-
- public static int casoDePrueba(int caso) {
- int lado = (int) Math.sqrt(caso);
- while ( caso % lado != 0 ) {
- lado++;
- }
- return lado;
- }
-
- /*public static int findLowestNextDivisorInRange( int lado, int caso ) {
-
- }*/
-
-}
+package problemas;
+
+public class Problema402DimensionesDelPuzzle {
+
+ static java.util.Scanner in;
+
+ public static void main(String args[]) {
+ in = new java.util.Scanner(System.in);
+ int caso;
+ while ( true ) {
+ caso = in.nextInt();
+ if ( caso == 0 ) {
+ break;
+ }
+ System.out.println(casoDePrueba(caso));
+ }
+ }
+
+ public static int casoDePrueba(int caso) {
+ int lado = (int) Math.sqrt(caso);
+ while ( caso % lado != 0 ) {
+ lado--;
+ }
+ return caso / lado;
+ }
+
+ /*public static int findLowestNextDivisorInRange( int lado, int caso ) {
+
+ }*/
+
+}