Finished several Codeforces and CSES problems.

Author: Anksharskarp

.idea/modules.xml

@@ -0,0 +1,32 @@
+//FAILURE
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class MissingNumber {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ long numberOfValues = s.nextLong();
+ long[] a = new long[(int) numberOfValues];
+ for(int i = 0; i < a.length; i++) {
+ a[i] = s.nextLong();
+ }
+
+ Arrays.sort(a);
+
+ long[] total = new long[(int) (numberOfValues + 1)];
+ Arrays.parallelSetAll(total, i -> i + 1);
+
+ for(int i = 0; i < total.length; i++) {
+ total[i] += (a[0] - 1);
+ }
+
+ for(int i = 0; i < a.length; i++) {
+ if(a[i] == total[i]) {
+ continue;
+ } else {
+ System.out.println(total[i]);
+ break;
+ }
+ }
+ }
+}

CSES/MissingNumber.java

@@ -0,0 +1,24 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class WeirdAlgorithm {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ long n = s.nextLong();
+ weirdAlgorithm(n);
+ }
+
+ public static void weirdAlgorithm(long number) {
+ System.out.print(number + " ");
+ while(number != 1) {
+ if(number % 2 == 0) {
+ number /= 2;
+ } else {
+ number *= 3;
+ number++;
+ }
+ System.out.print(number + " ");
+ }
+ }
+
+}

CSES/WeirdAlgorithm.java

@@ -0,0 +1,24 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class BeautifulMatrix {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ char[][] matrix = new char[5][5];
+ for (int i = 0; i < 5; i++)
+ matrix[i] = s.nextLine().replaceAll(" ", "").toCharArray();
+ int row = -1;
+ int column = -1;
+ for (int i = 0; i < 5; i++) {
+ for (int j = 0; j < 5; j++) {
+ if (matrix[i][j] == '1') {
+ row = i;
+ column = j;
+ break;
+ }
+ }
+ }
+ int numberOfMoves = Math.abs(row - 2) + Math.abs(column - 2);
+ System.out.println(numberOfMoves);
+ }
+}

Codeforces/BeautifulMatrix.java

@@ -0,0 +1,25 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class BitPlusPlus {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int numberOfInputs = s.nextInt();
+ int x = 0;
+ String a = "X++";
+ String b = "++X";
+ String[] expressions = new String[numberOfInputs];
+ for(int i = 0; i < numberOfInputs; i++) {
+ String y = s.next();
+ expressions[i] = y;
+ }
+ for(int i = 0; i < numberOfInputs; i++) {
+ if(expressions[i].equals(a) || expressions[i].equals(b)) {
+ x++;
+ } else {
+ x--;
+ }
+ }
+ System.out.println(x);
+ }
+}

Codeforces/BitPlusPlus.java

@@ -0,0 +1,16 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class DominoPiling {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int m = s.nextInt();
+ int n = s.nextInt();
+ int area = m * n;
+ if(area % 2 == 0) {
+ System.out.println(area / 2);
+ } else {
+ System.out.println((area - 1) / 2);
+ }
+ }
+}

Codeforces/DominoPiling.java

@@ -0,0 +1,24 @@
+//SUCCESS
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class NextRound {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int numberOfParticipants = s.nextInt();
+ int baseline = s.nextInt();
+ int numberAdvancing = 0;
+ ArrayList<Integer> scores = new ArrayList<>();
+ for(int i = 0; i < numberOfParticipants; i++) {
+ scores.add(s.nextInt());
+ }
+ int minimumScore = scores.get(baseline - 1);
+ for(int element : scores) {
+ if((element >= minimumScore) && (element > 0)) {
+ numberAdvancing++;
+ }
+ }
+ System.out.println(numberAdvancing);
+
+ }
+}

Codeforces/NextRound.java

@@ -0,0 +1,25 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class Team {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int numberOfProblems = s.nextInt();
+ int a;
+ int b;
+ int c;
+ int numberImplemented = 0;
+ int placeHolder;
+ for(int i = 0; i < numberOfProblems; i++) {
+ a = s.nextInt();
+ b = s.nextInt();
+ c = s.nextInt();
+ placeHolder = a + b + c;
+ if(placeHolder >= 2) {
+ numberImplemented++;
+ }
+ placeHolder = 0;
+ }
+ System.out.println(numberImplemented);
+ }
+}

Codeforces/Team.java

@@ -0,0 +1,18 @@
+//SUCCESS
+import java.util.Scanner;
+
+public class Watermelon {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int n = s.nextInt();
+ if(n > 2) {
+ if (n % 2 == 0) {
+ System.out.println("YES");
+ } else {
+ System.out.println("NO");
+ }
+ } else {
+ System.out.println("NO");
+ }
+ }
+}

Codeforces/Watermelon.java

@@ -0,0 +1,25 @@
+//SUCCESS
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class WayTooLongWords {
+ public static void main(String[] args) {
+ Scanner s = new Scanner(System.in);
+ int amount = s.nextInt();
+ ArrayList<String> strings = new ArrayList<String>();
+ while(amount >= 0) {
+ strings.add(s.nextLine());
+ amount--;
+ }
+ String input;
+ for(int i = 0; i < strings.size(); i++) {
+ input = strings.get(i);
+ if (input.length() > 10) {
+ System.out.println(Character.toString(input.charAt(0)) + (input.length() - 2) +
+ Character.toString(input.charAt(input.length() - 1)));
+ } else {
+ System.out.println(input);
+ }
+ }
+ }
+}