Created
June 5, 2019 18:34
-
-
Save nosrednawall/c78fcd39073b4806b5ba96304773948f to your computer and use it in GitHub Desktop.
Resolução questão A Very Big Sum
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.io.*; | |
import java.math.*; | |
import java.security.*; | |
import java.text.*; | |
import java.util.*; | |
import java.util.concurrent.*; | |
import java.util.regex.*; | |
public class Solution { | |
// Complete the aVeryBigSum function below. | |
static long aVeryBigSum(long[] ar) { | |
long result = 0; | |
for( long a : ar){ | |
if(new Long(a).toString().matches("\\d{10}")) { | |
result = a + result; | |
} | |
} | |
return result; | |
} | |
private static final Scanner scanner = new Scanner(System.in); | |
public static void main(String[] args) throws IOException { | |
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH"))); | |
int arCount = scanner.nextInt(); | |
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); | |
long[] ar = new long[arCount]; | |
String[] arItems = scanner.nextLine().split(" "); | |
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); | |
for (int i = 0; i < arCount; i++) { | |
long arItem = Long.parseLong(arItems[i]); | |
ar[i] = arItem; | |
} | |
long result = aVeryBigSum(ar); | |
bufferedWriter.write(String.valueOf(result)); | |
bufferedWriter.newLine(); | |
bufferedWriter.close(); | |
scanner.close(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment