OJ Board

Keep getting wrong answer, any test data? I have ran it on several things and works for each case.

I have figured out how to do this using stdio.h, but I am not sure how to do this with iostream/fstream. Here is the example code that is working:

[cpp]
#include <stdio.h>

#ifndef ONLINE_JUDGE
FILE *fin = fopen("myprog.in", "r");
FILE *fout = fopen("myprog.out", "w");
#else
FILE *fin = stdin ...

I am one of the people that is assisting with the rejudging of many of the problems on the board. However, so far, I am only responsible for solving one of the "unsubmittable" problems and then building a data set for it.

When it comes to rejudging problems, I don't think that a person who solved ...

How is it that I can get a segmentation fault from the judge and not when running the test data? Does the judge have bad input? Here is what I have in terms of the input mode if someone has suggestions (I have done this portion in 4 or 5 different ways):

[cpp]
char cards[30];
while (gets(cards ...

I understand the idea of backtracking for this problem, in general. However, I am having trouble deciding whether I should use the size of the squares as my "nodes", or the rows, or both...

I used a 700K array of ints and it ran in 0.217 s. So, I am happy. I like the other way with the double for loops. Not sure how you are only using 64K, though.

How to do it in time 0.000 s, don't know...seems impossible, unless there is a very quick formula. But using phi/tau, I couldn't get the ...

I am trying to use the avatar and set it under my profile. Whether I try to use the gallery or upload my own, it shows the "image not found box" where the image should be. Any ideas?

Yes, but if using the correct formula, wouldn't you need to generate 2 billion elements in the array? I don't see how only the first 700,000 will help.

Am I missing something with this problem? Or is it ridiculously easy?

Can you be more specific with the question? If you are speaking of graph theory, where a graph G = (V,E), then there are several ways to handle this. One way is to use a <map>, from the STL. This is a nice type that maps pairs of type <T>. So, if you have a graph that has three nodes and 1 and 2 are ...

Isn't this problem somewhat related to the magic multiplication square? I was looking for a pattern to the placements of the numbers, but haven't come up with anything so far. Another method I was thinking of is the divisors of each of the words flagged in an array and then try to do a comparison ...

A converse to this would be to start p = 1, then alternately multiplying it by 9, 2, 9, etc. Once p >= n, the problem is solved.

Cheers

We never solved it during the online contest, but we used <map>. It was indexed on X, and the value at X was Y. So, we would go through each of the X's, and then try to follow a rectangle. If we couldn't do that, then there wasn't a rectangle. Didn't get it to work though.

I am wondering about the doublets. Do they have to be the same length? Or, can something like

coastal
costal
postal

be a legitimate path? What is the purpose of keeping track of the node being visited or not? My method uses a <set> for the dictionary, and <queue> to keep track of the paths for ...

Well, the judge claims that I have a wrong answer, but I can't see it :roll:. If anyone else can, let me know.

[cpp]
#include <stdlib.h>
#include <string.h>
#include <iostream.h>

#define MAX_SIZE 256

char inLine[MAX_SIZE];

bool isVowel(char c) {
return ((c == 'a') || (c == 'e') || (c == 'i ...