Submission #6436297
Source Code Expand
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String args[]) { Scanner scan=new Scanner(System.in); int a=scan.nextInt(); int b=scan.nextInt(); int c=scan.nextInt(); int ar[]=new int[3]; ar[0]=a;ar[1]=b;ar[2]=c; Arrays.sort(ar); int aa=ar[2]-ar[0]; int two=ar[2]-ar[1]; int min=Math.min(aa, two); int max=Math.max(aa, two); // aa=Math.min(aa, two); ar[0]=aa; ar[1]=two; // System.out.println(ar[0]+" "+ar[1]); if(ar[0]%2==0 && ar[1]%2==0) { System.out.println(ar[0]/2+ar[1]/2); }else if(ar[0]%2==1 && ar[1]%2==1) { System.out.println((ar[0]/2)+(ar[1]/2)+1); }else { System.out.println(((ar[0]+1)/2)+((ar[1]+1)/2)+1); } // System.out.println(operations); } }
Submission Info
Submission Time | |
---|---|
Task | C - Same Integers |
User | Leks360 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 809 Byte |
Status | AC |
Exec Time | 95 ms |
Memory | 25172 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 94 ms | 19284 KB |
02.txt | AC | 95 ms | 19284 KB |
03.txt | AC | 93 ms | 19796 KB |
04.txt | AC | 93 ms | 19668 KB |
05.txt | AC | 92 ms | 19924 KB |
06.txt | AC | 94 ms | 19412 KB |
07.txt | AC | 93 ms | 21972 KB |
08.txt | AC | 94 ms | 19156 KB |
09.txt | AC | 93 ms | 19156 KB |
10.txt | AC | 93 ms | 25172 KB |
11.txt | AC | 94 ms | 19668 KB |
12.txt | AC | 93 ms | 18644 KB |
13.txt | AC | 92 ms | 19924 KB |
s1.txt | AC | 93 ms | 18644 KB |
s2.txt | AC | 91 ms | 19796 KB |
s3.txt | AC | 93 ms | 20820 KB |