You are viewing a single comment's thread. Return to all comments →
can anyone help me out last 3 test cases are not passing
import java.io.*; import java.util.*; public class Solution { public static boolean isprime(String s) { long a=Long.parseLong(s); for(int i=2;i<Math.sqrt(a)+1;i++) { if(a%i==0) { return false; } } return true; } public static void palin(String st,int l,int r,ArrayList<String> arr) { if(l==r) { //System.out.println("here2"+st); arr.add(st); } else { for(int i=l;i<=r;i++) { st=swap(st,l,i); palin(st,l+1,r,arr); st=swap(st,l,i); } } } public static String swap(String s,int i,int j) { char arr[]=s.toCharArray(); char tem=arr[i]; arr[i]=arr[j]; arr[j]=tem; return String.valueOf(arr); } public static void main(String[] args) { Scanner sc= new Scanner(System.in); int num=Integer.parseInt(sc.nextLine()); ArrayList<String> arr=new ArrayList<>(); String st="1234"; palin(st,0,3,arr); st="1234567"; palin(st,0,6,arr); // System.out.println(arr); ArrayList<String> prime= new ArrayList<>(); for(String i:arr) { if(isprime(i)) { // System.out.println("prime"+i); prime.add(i); } } //Collections.sort(prime); //System.out.println(prime); for(int k=0;k<num;k++) { int tem=Integer.parseInt(sc.nextLine()); if(tem<Integer.parseInt(prime.get(0))) { System.out.println("-1"); } else { for(int j=0;j<prime.size();j++) { if(tem<Integer.parseInt(prime.get(j))) { System.out.println(prime.get(j-1)); break; } } } } } }
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #41: Pandigital prime
You are viewing a single comment's thread. Return to all comments →
can anyone help me out last 3 test cases are not passing