Search found 6 matches

by Fedaykin
Wed Feb 06, 2013 12:53 am
Forum: General
Topic: UVA -In Judge Queue- Bug
Replies: 4
Views: 10893

Re: UVA -In Judge Queue- Bug

Same happening to me
by Fedaykin
Fri Feb 01, 2013 9:58 pm
Forum: Volume 7 (700-799)
Topic: 706 - LCD Display
Replies: 221
Views: 33059

Re: Solved!

fabiofabris wrote:I finally made it!!!

Some considerations about this problem:
- X 0001 should print 1
- X 0000 should print 0
that you are printing a blank column BETWEEN digits.

I think this input is kinnda trick...
This helped me to get ac
by Fedaykin
Tue Jan 29, 2013 2:09 am
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 50739

Re: 10267 - Graphical Editor

7 WA before AC :oops: . The very last thing I fixed was I had assumed incorrectly that 'X' would be the last input, ie if 'X' was inputted there wouldn't be anything after it, but that was wrong. hope that helps someone
by Fedaykin
Tue Dec 18, 2012 1:18 am
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 18116

Re: 103 longest inc seq question

I had no idea this existed :o
by Fedaykin
Sun Dec 16, 2012 2:22 am
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 18116

103 longest inc seq question

http://en.wikipedia.org/wiki/Longest_increasing_subsequence I understand how the algorithm works with integer values that are either greater or lesser than other values. I don't see how that algorithm works with boxes that can't nest inside others. for example with integers { 3 , 6 , 1 , 2 , 5 , 4} ...
by Fedaykin
Sun Dec 09, 2012 9:30 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 172916

100 Runtime Error

import java.util.*; class Main { public static void main(String[] args){ new Main().solveProblem(); } public void solveProblem(){ final Scanner in = new Scanner(System.in); while(in.hasNextInt()){ int i = in.nextInt(); int j = in.nextInt(); int[] values = new int[j-i+1]; for(int k = i;k <= j;k++){ ...

Go to advanced search