Problems for the September 23-28 week

If you're a go-getter, try to do some of these problems before our Saturday practice.  Whoever does the most gets a prize.

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=10&page=show_problem&problem=823

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=10&page=show_problem&problem=762

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=245&page=show_problem&problem=3480

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=245&page=show_problem&problem=3441

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=245&page=show_problem&problem=3457

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3646

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3650

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3643

^{*prize value may vary}

-Eric

Cycle 3

This weeks problems are much harder than last weeks. As such there are only six. The emphasis this week is on learning a couple of new techniques, revisiting some old techniques, and trying to solve problems that might be beyond your (current) ability to actually solve. I hear you guys are going to compete in some online competitions and the like, so try and get as many of these as you can. If there's an issue with your submission timing out, and you're *sure* it's Java issue, send it to me (Arjun), and I'll grade the submission. There are two problems that I'm sure everyone can get, though it may take a lot of effort.

Good luck, and shoot me an email if you need help. I'll also be in the CS lab from 8th-10th periods. I'm also up very late (check what time this post went online!), so I'll get back to you even at obscene hours. I strongly recommend spending as much time as it takes to get these problems this week.

There's a few that definitely will take a lot of time.

The longest constant gene

Glass Beads

This one is actually a classic problem. See how fast you can get it and time it against grep. There's an interesting email exchange about this problem that I'll show you guys next week.
Longest Match 

I don't think this one is possible to get a successful submission for if you try and brute force it, but we'll see if Seth can prove me wrong!
Prime Time

Skyscraper Floors

And this is probably the hardest problem on today's list. If you learned something (hint hint) the last time around, it won't be impossible, but it is definitely difficult.
Herding Frosh

Resources From Erik

This is the pdf of problems you asked me to e-mail you
http://acm.cs.buap.mx/downloads/Programming_Challenges.pdf

This is the site AJ found with the input/output for the problems and key topics of each problem
http://uvatoolkit.com/problemssolve.php

String to Palindrome

Deli Deli

Athletics Track

Pesky Palindromes

The Fortified Forest

Find the Winning Move

And Seth, this last one is for you. Brute force it, I dare you.
The Closest Pair

Cycle 1 problems

These are mostly simple, I'd like two solutions per credit hour you are taking.

Super Long Sums

Simple calculations

Funny Encryption Method

The ? 1 ? 2 ? ... ? n = k problem

Knuth's Permutation

A hole to catch a man

Division
An Easy Problem!

Week 7 (cycle 4)

Risk (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=116&page=show_problem&problem=508)

The Tourist Guide (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=116&page=show_problem&problem=1040)
(easiest)

Connect the Campus (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=116&page=show_problem&problem=1338)

Dijkstra, Dijkstra (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=116&page=show_problem&problem=1747)
(adv)

8 Queens Chess Problem (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=691)

Another n-Queen Problem (http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2136)
(adv)

Problems suggested by Seth (also for credit):
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=52

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=100

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=102

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=104

Week 5

Longest paths

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=941

Firetruck (brute force might not work)

http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=144

Ananagrams

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=92

don’t get rooked

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=580

division

http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=666

half credit unless freshman:

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1895