You are viewing a single comment's thread. Return to all comments →
private static final Scanner scan = new Scanner(System.in); public static void main(String[] args) throws IOException { int n1=scan.nextInt(); int n2=scan.nextInt(); int n3=scan.nextInt(); int a[]=new int[n1]; int b[]=new int[n2]; int c[]=new int[n3]; int temp[]=new int[n1+n2+n3]; for(int i=0;i<n1;i++) { a[i]=scan.nextInt(); } for(int i=0;i<n1;i++) { temp[i]=a[n1-1-i]; } for(int i=0;i<n1;i++) { a[i]=temp[i]; } for(int i=0;i<n1;i++) { if(i==0) { a[i]=a[i]; } else { a[i]=a[i]+a[i-1]; } } for(int i=0;i<n2;i++) { b[i]=scan.nextInt(); } for(int i=0;i<n2;i++) { temp[i]=b[n2-1-i]; } for(int i=0;i<n2;i++) { b[i]=temp[i]; } for(int i=0;i<n2;i++) { if(i==0) { b[i]=b[i]; } else { b[i]=b[i]+b[i-1]; } } for(int i=0;i<n3;i++) { c[i]=scan.nextInt(); } for(int i=0;i<n3;i++) { temp[i]=c[n3-1-i]; } for(int i=0;i<n3;i++) { c[i]=temp[i]; } for(int i=0;i<n3;i++) { if(i==0) { c[i]=c[i]; } else { c[i]=c[i]+c[i-1]; } } int max=Math.min(n1,n2); int min=Math.min(max,n3); if(min==n1) { for(int i=n1-1;i>=0;i--) { int value=a[i]; for(int z=0;z<n2;z++) { if(value==b[z]) { for(int k=0;k<n3;k++) { if(value==c[k]) { System.out.println(value); System.exit(0); } } } } } } if(min==n2) { for(int i=n2-1;i>=0;i--) { int value=b[i]; for(int z=0;z<n3;z++) { if(value==c[z]) { for(int k=0;k<n1;k++) { if(value==a[k]) { System.out.println(value); System.exit(0); } } } } } } if(min==n3) { for(int i=n3-1;i>=0;i--) { int value=c[i]; for(int z=0;z<n1;z++) { if(value==a[z]) { for(int k=0;k<n2;k++) { if(value==b[k]) { System.out.println(value); System.exit(0); } } } } } } System.out.println("0"); }
Seems like cookies are disabled on this browser, please enable them to open this website
Equal Stacks
You are viewing a single comment's thread. Return to all comments →