Search found 1 match

by tudalex
Sun Mar 20, 2005 10:33 pm
Forum: Volume 5 (500-599)
Topic: 543 - Goldbach's Conjecture
Replies: 109
Views: 41594

I have the same problem!?! Can someone help me??? Please!!
var i,n,p:longint;
f:text;
a:array[1..2,1..1000] of longint;
function prim(x:longint):boolean;
var i:longint;
begin
prim:=true;
for i:=2 to trunc(sqrt(x)) do if x mod i=0 then begin prim:=false; break; end;
end;
begin
readln(n);
while ...

Go to advanced search