/* Author: LukArToDo Created: 15.nov 2017 Description: Answer to the next challenge: [challenge] let's code for reasoning question1.... u have to take some numbers from the user and then has to evaluate as per the below two condition logic 1: the given input contains same difference between adjacent numbers example goes like this : if input 1,3,5 output should be logic is constant difference and next number is 7 logic 2: the given input contains some constant increment in difference between adjacent numbers.example: if input is -5, -4, -2 continued in the code https://code.sololearn.com/ciKMduC4jSzk/?ref=app (by SAKSHI) ************************ ENTER ELEMENTS OF ARRAY SEPARATED BY SPACE (at least 3 elements, but not more than 4-5 elements to avoid time limit exceed) ************************************ */ import java.util.*; public class FindLogic { static double e=0; static int next=0; public static void main(String[] args) { String s = new Scanner(System.in).nextLine().trim(); String[] str=s.split("\\s+"); int []ints = new int[str.length]; if(str.length<3) incorrectInput(); else{ try{ for(int i=0; i1&&d<2) System.out.printf("Logic is found (x0^c=x1, x1^c=x2,...), %nbut the next element is not integer (%.2f) %n",d); else System.out.printf("Logic: x0^c=x1, x1^c=x2,... %nNext element: %.0f %n",d); } else if(isSpecial(arr,len)) System.out.println("Logic: x0^c+a=x1, x1^c+b=x2,... \n(b=a or b=a++)\nNext element: "+next); else if(isGordie(arr,len)) System.out.println("Logic: a*x0+b=x1, a*x1+b=x2,... \nNext element: "+next); else if(findUp(arr,len)) System.out.println("Logic: x0+a+0*b=x1, x1+a+1*b=x2, x2+a+2*b=x3,...\nNext element: "+next); else System.out.println("The logic is not found"); System.out.println(); } static boolean ifPow(int[]arr) { e=0; boolean isPow=true; double pow=0; int i=arr[0]; int j=arr[1]; if(i<0&&j<0) { i=i*(-1); j=j*(-1); } if(j>i) pow=findExp(j,i); if(i>j) pow=(double)1/findExp(i,j); if (pow>0){ for(int a=1; aj){ if (i%j!=0) { exp= -1; break; } exp++; i/=j; } }catch(Exception e){ exp=-1; } } return exp; } static boolean ifFactor(int[] arr){ boolean fac=true; try{ double f=(double)arr[1]/arr[0]; for(int i=2; i0) large=true; if(k==0) return false; } if(i==2) { z=(arr[i]-arr[i-1])-k; k=arr[i]-arr[i-1]; if(k<0&&large) return false; if(len==3) {next=k+z; if(k<0&&next>0) return false; if(k>0&&next<0) return false; } } if(i>2&&i0) return false; if(k>0&&next<0) return false; } } next=next+arr[len-1]; return true; } static boolean isSpecial(int[]arr,int len){ if(ifPow1(arr)){ while (e>0){ if(findRes(e, arr, len)) return true; --e; } } return false; } private static boolean findRes(double e, int[] arr, int len) { int[] ap=new int[len]; for(int i=0;ii&&j!=0&&i!=1) { w++; break; } if(i>j&&i!=0&&j!=1) { w++; break; } } if(w==0) e=1; else{ if(j>i) e=findExp1(j,i); if(i>j) e=(double)1/(findExp1(i,j)); } return isPow; } static int findExp1(int i, int j) { int exp=1; try{ while(i>j){ exp++; i/=j; } }catch(Exception e){ exp=-1; } return exp; } static boolean isGordie(int[]arr, int len){ double m=0; double f1=0, f2=0; int c=0; boolean check=false; for(int i=1;if2) m=f2; if(f1

Challenge FoundLogic