OJ Board

removed. =) sorry

I have just changed this line and got AC. Now im getting how the judge wants the inputs. thanks =)

I got it, had to remove the last printf("");

Your C program has solved Ok the problem 133 (The Dole Queue) in 0.000 seconds with low memory spent.
Congratulations!


Hope this help somebody.

#include <stdio.h>

typedef struct QUEUE
{
int number;
struct QUEUE *next;
struct QUEUE *prev;

}QUEUE;

QUEUE* CreateQueue(QUEUE *q, int n)
{
QUEUE *temp, *last;
int i;

last = q;

for(i=n; i>=1; i--)
{
temp = malloc(sizeof(QUEUE));

temp->number = i;

if(q == NULL)
{
temp->next ...

Im feeling stupid cause i cant find the answer. Help please?

made and worked! thanks! =D

Your C program has solved Ok the problem 100 (The 3n + 1 problem) in 4.172 seconds using as much as 392 kbytes of virtual memory.
Congratulations!

I know its a easy problem but i cant get less than 10 secons of run time. Could somebody help me please?

#include <stdio.h>

int Cycles(long n)
{
long cycles;

cycles = 1;

if(n <= 0) return 0;

while(n!=1)
{
if(n%2 != 0)
n = (3*n)+1;
else
n /= 2;

cycles++;
}

return cycles;
}

int ...

I know its a easy problem but i cant get less than 10 secons of run time. Could somebody help me please?


#include <stdio.h>

int Cycles(long n)
{
long cycles;

cycles = 1;

if(n <= 0) return 0;

while(n!=1)
{
if(n%2 != 0)
n = (3*n)+1;
else
n /= 2;

cycles++;
}

return cycles;
}

int ...