ผลต่างระหว่างรุ่นของ "Jittat/icpc-tasks"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 1: แถว 1:
 
== Greedy ==
 
== Greedy ==
  
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=315&page=show_problem&problem=961 10020  Minimal coverage]
+
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=315&page=show_problem&problem=961 UVa 10020 - Minimal coverage]
 +
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=315&page=show_problem&problem=967 UVa 10026 - Shoemaker's Problem]
 +
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=315&page=show_problem&problem=1281 UVa 10340 - All in All]
 +
 
 +
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=315&page=show_problem&problem=1093 UVa 10152 - ShellSort]
  
 
== Geometry ==
 
== Geometry ==
  
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=5&page=show_problem&problem=314 UVa 378 Intersecting Lines]
+
* [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=5&page=show_problem&problem=314 UVa 378 - Intersecting Lines]
  
  
 
== Dynamic programming ==
 
== Dynamic programming ==

รุ่นแก้ไขเมื่อ 14:10, 12 กรกฎาคม 2555