ผลต่างระหว่างรุ่นของ "Adt lab/Ad hoc problems 1"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
 
(ไม่แสดง 10 รุ่นระหว่างกลางโดยผู้ใช้คนเดียวกัน)
แถว 7: แถว 7:
 
== List of problems ==
 
== List of problems ==
  
−
* [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=36 UVa 100 - The 3n + 1 problem]
+
* Intro problem
−
** See [[adt lab/notes on how to read input|how to read input]].
+
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=36 UVa 100 - The 3n + 1 problem]
−
** ''Hint:'' i may be larger than j.
+
*** See [[adt lab/notes on how to read input|how to read input]].
−
* [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=960 UVa 10019 - Funny Encryption Method]
+
*** ''Hint:'' i may be larger than j.
−
* [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=82 UVa 146 - ID Codes]
+
 
 +
* Easy problems
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=1410 UVa 10469 - To Carry or not to Carry]
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=87 UVa 151 - Power Crisis]
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=17&page=show_problem&problem=1443 UVa 10502 - Counting Rectangles]
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=960 UVa 10019 - Funny Encryption Method] (optional)
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=991 UVa 10050 - Hartals] (optional)
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=1414 UVa 10473 - Simple Base Conversion] (optional)
 +
 
 +
* Harder problems
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=82 UVa 146 - ID Codes]
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=1018 UVa 10077 - The Stern-Brocot Number System] (optional)
 +
** [https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=242&page=show_problem&problem=3173 UVa 12022 - Ordering T-shirts] (optional)
 +
 
 +
== Hints ==
 +
 
 +
* [[Adt lab/Ad hoc problems 1/hints|Hints]]

รุ่นแก้ไขปัจจุบันเมื่อ 21:15, 21 มกราคม 2561

This is part of adt lab

This week, we will practice on problem solving with C++. We will work on UVa Online Judge.

You should register an account at UVa Online Judge and use single account to submit on every task. We will keep track of your work based on that account.

List of problems

Hints

ดึงข้อมูลจาก "http://158.108.32.49/wiki/index.php?title=Adt_lab/Ad_hoc_problems_1&oldid=57870"