OJ Board

The Timus board is much more active.

Hye, I have a problem (time limit exedeed). I used a O^6 algoritm and I need help In makeing a faster algoritm.
Here is my code:
var n,i,j,k,r,suma,yes,max:longint;
nr:array[1..110,1..110] of longint;

function sumarit(i1,j1,i2,j2:longint):longint;
var i,j,suma:longint;
begin
suma:=0;
for i:=i1 ...

Hi all,

I really got nervous about this problem! It's not deficult! I tested for all inputs on board, but still WA. There shouldn't be any special traps, or sth...
Please, HELP

My code:
const
max = 500;

type
cat = record
k,r:boolean;
end;

var
a,i,j,n,wyn:longint;
t:array[1..max,1..max]of ...

Please! PLS! I need help!

Trie this source, try not to use iostream.h but fstream.h

#include <fstream>

using namespace std;

unsigned long primeTable[25]={2,3,5,7,
11,13,17,19,
23,29,
31,37,
41,43,47,
53,59,
61,67,
71,73,79,
83,89,
97};
unsigned long func(unsigned long n,unsigned long p)
{
unsigned long i=0 ...

This problem is really tuff, even if it is the first one, anyway here is a source code, it got AC.

var
i, j: integer;

function getCL(N: integer): integer;
var k: integer;
begin
k := 1;
while N <> 1 do begin
if odd(N) then N := 3*N + 1
else N := N div 2;
k := k + 1;
end;
getCL := k;
end ...

type vec=array[1..3000] of byte;
var a,rez,poz,i,m,r:longint;
code:integer;
b:vec;
x,y,z:string;

function rest(a:vec; x:longint):longint;
var i:integer;

begin
r:=0;
for i:=m downto 1 do
r:=(10*r+a ) mod x;
rest:=r;
end;

begin
while not eof do
begin
readln(z);
if (z='0 0') then halt ...