OJ Board

I would just like to say that the problem is very easy(did it in under a minute). The code I used was (which the CPU time was 0.004 seconds) The following. It works by using the 80386 assembly instruction to byte swap an integer (the instruction is often used to convert big endian numbers to little ...

it means that there is an invaild memory Reference
I not going to find it for u because it would take me weeks to read.
INDENT AND COMMENT and you will find.

Prehaps maybe one of u guy can post some of your code

my code

#include <stdio.h>
char *Format="%d %d";

int main()
{
int i,j;
register unsigned int tmp;
register int current_length,Longest_Length;
while (scanf(Format,&i,&j)!= EOF)
{
Longest_Length = 0;
printf(Format,i,j);
if (i > j)
{
i ^=j;
j ^=i;
i ^=j;
}
if (j > 1000000 ...

I tryed it but it was slower than before

is there a quicker way of working out the cycle length then the standard iteration technique.
I can get the time down to 1.7 seconds but how do you guy get the time down to 0

I'm getting a wrong answer. :(

//3n+1 problem


#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
long i,j;
long tmp,current_length,Longest_Length;
Longest_Length = 0;
cin >> i >> j;
cout << i << " " << j << " ";
if (i > j)
{
i ^= j;
j ^=i;
i ^=j;
}
for (;i ...