01204212/id request - ประวัติรุ่นแก้ไข

Jittat: /* Code for static version (using binary search) */

2016-10-06T03:07:59Z

Code for static version (using binary search)

2016-10-06T03:00:53Z

Code

2016-09-22T02:16:44Z

Main method

2016-09-21T21:04:23Z

Test data

2016-09-21T20:53:03Z

Code

2016-09-21T20:30:09Z

Collection choices

2016-09-21T20:29:42Z

Code

2016-09-21T20:27:07Z

Code

2016-09-21T19:56:17Z

Example

2016-09-21T19:50:23Z

Code

@@ แถว 131: / แถว 131: @@
 </syntaxhighlight>
-== Code for static version (using binary search) ==
+== Code for the static version (using binary search) ==
 <syntaxhighlight lang="java">
 import java.io.BufferedReader;
@@ แถว 155: / แถว 155: @@
          m.readInput();
-         for(int i=0; i<10; i++) {
+         m.process();
+     }

@@ แถว 127: / แถว 127: @@
+         }
+     }
+}

@@ แถว 99: / แถว 99: @@
 import java.io.BufferedReader;
 import java.io.InputStreamReader;
 public class Main {

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 21:04, 21 กันยายน 2559
แถว 46:		แถว 46:

	== Test data ==		== Test data ==
		+
		+	Download at: [http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/id-requests/ here]
		+
		+	Solution to <tt>n10.in</tt>
		+
		+	<pre>
		+	N
		+	N
		+	N
		+	N
		+	N
		+	N
		+	N
		+	Y
		+	N
		+	Y
		+	</pre>
		+
		+	Solution to <tt>n1000.in</tt> (first 20 lines)
		+
		+	<pre>
		+	N
		+	N
		+	N
		+	N
		+	N
		+	Y
		+	N
		+	N
		+	N
		+	N
		+	N
		+	Y
		+	Y
		+	N
		+	Y
		+	N
		+	Y
		+	Y
		+	N
		+	N
		+	</pre>

	== Code ==		== Code ==

@@ แถว 57: / แถว 57: @@
 import java.io.BufferedReader;
 import java.io.InputStreamReader;
 public class Main {
      public static void main(String[] args) throws Exception {
          BufferedReader reader = new BufferedReader(
                     new InputStreamReader(System.in) );
-         int n = Integer.parseInt(reader.readLine());
+         n = Integer.parseInt(reader.readLine());
+        xs = new int[n];
          for(int i=0; i<n; i++) {
-             int x = Integer.parseInt(reader.readLine());
+             xs[i] = Integer.parseInt(reader.readLine());
+         }
+     }
+}

@@ แถว 51: / แถว 51: @@
 * [https://docs.oracle.com/javase/7/docs/api/java/util/TreeSet.html TreeSet]
 * [https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html HashSet]
-* Static implementation of set with binary search
+* Implementation of "static" sets with binary search
 === Main method ===

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 20:27, 21 กันยายน 2559
แถว 48:		แถว 48:

	== Code ==		== Code ==
		+	<syntaxhighlight lang="java">
		+	import java.io.BufferedReader;
		+	import java.io.InputStreamReader;
		+
		+	public class Main {
		+
		+	public static void main(String[] args) throws Exception {
		+	BufferedReader reader = new BufferedReader(
		+	new InputStreamReader(System.in) );
		+
		+	int n = Integer.parseInt(reader.readLine());
		+
		+	for(int i=0; i<n; i++) {
		+	int x = Integer.parseInt(reader.readLine());
		+	// do something
		+	}
		+	}
		+	}
		+	</syntaxhighlight>

	== Performance comparison ==		== Performance comparison ==