Cent Savings: Difference between revisions
		
		
		
		Jump to navigation
		Jump to search
		
imported>Kmk21 No edit summary  | 
				imported>Kmk21 No edit summary  | 
				||
| Line 39: | Line 39: | ||
*[[Dynamic Programming]]  | *[[Dynamic Programming]]  | ||
[[Category:  | [[Category:nwerc2014]]  | ||
[[Category:ICPC Problems]]  | [[Category:ICPC Problems]]  | ||
[[Category:Dynamic Programming]]  | [[Category:Dynamic Programming]]  | ||
[[Category:Dimension Elimination]]  | [[Category:Dimension Elimination]]  | ||
Revision as of 19:47, 31 January 2015
Introduction
This problem asks you to do foo with bar.
Difficulty
Algorithmic
This problem was crazy hard to understand and come up with a solution==
Implementation
This problem was super easy to implement
Solutions
Solution Using foo and X with Bob and alice algorithm
Idea
I had an idea! I thought of using bob and foo because of XYZ.
How to
The code was done this way.
Solution - *Language X*
#include <stdio.h>
int main()
{
    printf ("Hello Word!");
    return 0;
}
Super Epic Fails
It would be really easy to make this mistake or that mistake