OJ Board

I've compared the output using FC with some other's output and they match, can anybody tell what's going on?

#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstdlib>
using namespace std;
bool cubes[80000001]={false};
struct lc
{
int num;
int i, j, k;
} list[500]={0,0,0,0};
int ...

I've been gulping loads of WAs on this. I've read about negative numbers and have handled them in both the ways that I've seen on uvatookit.com and another blog. But still can't figure the problem out.
I do a sieve till 10000000 then store all primes. Keep on dividing the given number the list ends ...

If you're talking about bsearching on an array of structs then you need to have your query in the same kind of struct. Then just customize the compare function for strcmp(), if that's what u r asking.

You're printing the two numbers on separate lines. They should be on the same line. See the problem's output sample. I don't think there is any other fault.

The memory limits are enough why use so small limits on arrays. Use 1000.

UVA OJ doesn't provide answers it is getting from your program. It's done partially in USACO but not even a bit in UVA. If you're stuck at some prob, just browse the forum for it. People usually provide a lot of help.

I got WA with my code.
It has been a very frustrating experience.


Tip 1: Test these

ir is there something wrong?
ar ar
falar what is this
namer coder
jubir jubir

Outputs

ir (to is there something wrong?)
eu o
tu es
ele/ela e
nós imos
vós is
eles/elas em

ar (to ar)
eu o
tu as
ele/ela a
nós ...

You can't use the "nos" and "vos" as copy-paste strings in the array. For them you have to use 243 explicitly.


Like this:

for (i=0 ; i<6 ; i++) {
if (i==3) {
putchar('n'); putchar(243); putchar('s');
} else if (i==4) {
putchar('v'); putchar(243); putchar('s');
} else
printf("%s",t_rep[i ...

Can anyone please tell me about the fast I/O? I know fread() fwrite() is what it is. But can u give me an example of it being done?

I spent a lot of time with TLE, then RTE now WA. Please someone suggest me something:
:evil:
Concept:
1 Generate sieve upto 60000
2 Then while the number stays the division is done from the primes[] array.

EDIT: Sorry, I had left some RUNTIME CHECK statement in. Got AC. You guys are doing a ...

One of the craziest hard-to-get-AC experience

To get AC you need three things.

1. Check Jan's Sample I/O in this thread and correct it.
2. Check these Sample I/0 and correct it.
Input
2
Fat Dude
Fat 1000 0
Dude 100 1 Fat

Output
Fat 100
Dude -100

3. Print a blank line after each case except ...

@aliahmed
Just don't reset k for k>=(n/2). It works.