Add files via upload

Author: javaarchive

Code-Forces/bin/StoTConverter.class

@@ -0,0 +1,46 @@
+import java.util.*;
+import java.util.stream.Collectors;
+public class StoTConverter {
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int N = sc.nextInt();sc.nextLine();
+		for(int run = 0; run < N; run++) {
+			
+			String s = sc.nextLine(),t = sc.nextLine(),p = sc.nextLine();
+			ArrayList<Character> needed = new ArrayList<Character>();
+			System.out.println("s:"+s+"\n"+"t:"+t+"\n"+"p:"+p);
+			try {
+			int min = Integer.min(s.length(),t.length());
+			for(int i = 0; i < min; i ++) {
+				if(!(s.charAt(i) == t.charAt(i))) {
+					throw new Exception("SOLUTION REQUIRES REORDER");
+				}
+			}
+			for(int i =0 ; i < t.length(); i ++) {
+				//System.out.println("add "+i);
+				needed.add(t.charAt(i));
+			}
+			System.out.println("End Result: "+needed);
+			for(int i =0 ; i < s.length(); i ++) {
+				needed.remove(needed.indexOf(s.charAt(i)));
+			}
+			System.out.println("Letters needed: "+needed);
+			
+			List<Character> chars = p.chars()  			// IntStream
+					.mapToObj(e -> (char)e) // Stream<Character>
+					.collect(Collectors.toList());
+			//System.out.println("Letters to find: "+needed);
+			System.out.println("Letters to be used before: "+chars);
+			for(char c: needed) {
+				//chars.remove(Character.valueOf(c));
+				chars.remove(chars.indexOf(c));
+			}
+			System.out.println("Letters to be used after: "+chars);
+			System.out.println("YES");
+			}catch(Exception e) {
+				System.out.println("NO "+e.getLocalizedMessage());
+			}
+			
+		}
+	}
+}

Code-Forces/bin/japanese_majhong.class

@@ -0,0 +1,101 @@
+import java.io.*;
+import java.util.*;
+
+import javax.swing.plaf.basic.BasicInternalFrameTitlePane.MaximizeAction;
+public class japanese_majhong {
+	static List<Integer> m,p,s;
+	public static int maxConsect;
+	public static int maxSame;
+	public static int consect_count;
+	public static int same_count;
+	public static void process(List<Integer> l){
+		maxConsect = 0;
+		maxSame = 0;
+		consect_count = 0;
+		same_count = 0;
+		boolean isConsecutive = false;
+		boolean isSame = false;
+		int prev = -1;
+		for(int num:l) {
+		if(isConsecutive == false && isSame == false) {
+				isConsecutive = true;
+				isSame = true;
+				consect_count ++;
+				same_count ++;
+			}else {
+				if(prev == (num - 1)) {
+					isConsecutive = true;
+				}else if(prev == num) {
+					isSame = true;
+				}
+				if(isConsecutive) {
+					if(prev == (num - 1)) {
+						isConsecutive = true;
+						consect_count++;
+					}else {
+						isConsecutive = false;
+					}
+				}
+				if(isSame) {
+					if(prev == num) {
+						isSame = true;
+						same_count++;
+					}
+				}else{
+					isSame = false;
+				}
+				
+			}
+		if(same_count > maxSame){
+			maxSame = same_count;
+		}
+		if(consect_count > maxConsect) {
+			maxConsect = consect_count;
+		}
+			prev = num; // Keep at end
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		m = new ArrayList<Integer>();
+		p = new ArrayList<Integer>();
+		s = new ArrayList<Integer>();
+		//System.out.println(s);
+		for(int i = 0; i < 3; i ++) {
+			String str = sc.next();
+			String suit = str.substring(1);
+			//System.out.println(suit);
+			int num = Integer.parseInt(str.substring(0, 1));
+			if(suit.equals("m")) {
+				m.add(num);
+			}else if(suit.equals("p")) {
+				p.add(num);
+			}else if(suit.equals("s")) {
+				s.add(num);
+			}
+		}
+		m.sort(null);
+		p.sort(null);
+		s.sort(null);
+		int ans;
+		int maxMaxSame = -1;
+		int maxMaxConsect = -1;
+		//System.out.println("m");
+		process(m);
+		maxMaxSame = maxSame;
+		maxMaxConsect = maxConsect;
+		//System.out.println(maxConsect+" "+maxSame);
+		//System.out.println("p");
+		process(p);
+		maxMaxSame = Integer.max(maxSame, maxMaxSame);
+		maxMaxConsect = Integer.max(maxConsect, maxMaxConsect);
+		//System.out.println(maxConsect+" "+maxSame);
+		//System.out.println("s");
+		process(s);
+		maxMaxSame = Integer.max(maxSame, maxMaxSame);
+		maxMaxConsect = Integer.max(maxConsect, maxMaxConsect);
+		//System.out.println(maxConsect+" "+maxSame);
+		System.out.println(Integer.min(3 - maxMaxSame, 3 - maxMaxConsect));
+	}
+
+}

Code-Forces/bin/vus_cossack_strings.class

@@ -19,7 +19,8 @@ public static void main(String[] args) {
 		sc.close();
 		int lenA = a.length();
 		int len = b.length();
-		List<String> substrings = new ArrayList<String>();
+		int count = 0;
+		//List<String> substrings = new ArrayList<String>();
 		/*
 		for(int i = 0 ; i < lenA; i ++) {
 			if(a.charAt(i) == 1) {
@@ -29,19 +30,20 @@ public static void main(String[] args) {
 			}
 		}
 		*/
-		for(int i = 0; i < lenA; i++) {
-			if(i + len > lenA) {
-				break;
-			}
-			substrings.add(a.substring(i, i + len));
-		}
-		int count = 0;
-		//System.out.println(substrings);
-		for(String s:substrings) {
-			if(diff(s,b) % 2 == 0) {
+		int N = lenA - len + 1;
+		for(int i = 0; i < N; i++) {
+			//if(i + len > lenA) {
+			//	break;
+			//}
+			//substrings.add();
+			System.out.println(i+"\n"+(i+len));
+			if(diff(a.substring(i, i + len),b) % 2 == 0) {
 				count++;
 			}
 		}
+		
+		//System.out.println(substrings);
+		
 		System.out.println(count);
 	}