public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ int line=1; Scanner sc= new Scanner(System.in); while(sc.hasNextLine()) { System.out.println(line + " " + sc.nextLine()); ...
aws/aws-sdk-java - The official AWS SDK for Java 1.x (In Maintenance Mode, End-of-Life on 12/31/2025). The AWS SDK for Java 2.x is available here: https://github.com/aws/aws-sdk-java-v2/ s4kibs4mi/java-developer-roadmap - Roadmap to becoming a Java developer in 2025 oblac...
languagelines of code Java 70851 C++ 3214 Python 1193 SQL 101This repository contains solutions to various algorithm problems from platforms such as Codeforces, HackerRank, LeetCode, Lintcode, Nowcoder, and UVa. Each solution is organized by problem number and includes the source code, input files...
public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); String a = scan.nextLine(); if(scan.hasNext()) { System.out.println("1 " +a); } String b = scan.nextLine(); if(scan.hasNext()) { System.out.println("2 " +b); } String...
aws/aws-sdk-java - The official AWS SDK for Java 1.x (In Maintenance Mode, End-of-Life on 12/31/2025). The AWS SDK for Java 2.x is available here: https://github.com/aws/aws-sdk-java-v2/ s4kibs4mi/java-developer-roadmap - Roadmap to becoming a Java developer in 2025 qunar...
Java End-of-file import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner scan=new Scanner(System.in); int j=1; while (scan.hasNextLine()) { System.out.println(j...
Baqend/Orestes-Bloomfilter - Library of different Bloom filters in Java with optional Redis-backing, counting and many hashing options. spring-cloud/spring-cloud-consul - Spring Cloud Consul pac4j/play-pac4j - Security library for Play framework 2 in Java and Scala: OAuth, CAS, SAML, OpenID...
public class Solution { public static void main(String[] args) { int i = 0; Scanner scanner = new Scanner(System.in); while(scanner.hasNext()){ System.out.printf("%d %s\n",++i, (String)scanner.nextLine()); } } }
_heap.push(value); // Insert an element to the end of the heap // If it's parent is smaller (max heap) or larger (min heap) It means we have // a heap violation. We should swap the child (newly added value) // with the parent until we restore the heap property this._bubble...
N/A [HackerRank]. Change to Anagram.java Easy [String] Java 211 N/A Implement Queue using Stacks.java Easy [Design, Stack] Java 212 N/A Basic Calculator.java Hard [Binary Tree, Expression Tree, Math, Minimum Binary Tree, Stack] Java 213 N/A Word Squares.java Hard [Backtracking, Trie...