11014 - Make a Crystal

All about problems in Volume 110. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

aminallam
New poster
Posts: 39
Joined: Thu Dec 08, 2005 12:51 pm
Location: Suez, Egypt.

Post by aminallam »

[Garbage Deleted]
Last edited by aminallam on Sun Mar 26, 2006 5:45 pm, edited 2 times in total.

QulinXao
New poster
Posts: 29
Joined: Mon Apr 05, 2004 11:12 am

Post by QulinXao »

Cho wrote: 3.5 Compute all A[n] by making use of factor[n], O(n)
I think you compute A[n] and sumA[n] same time
Cho wrote: >> p=s-sum(p[j]| i mod j=0, 0<j<i);
Is this part O(n sqrt(n))?

it depent from implimentation
In my implement not.
cose count action dec(p[j*i],p) i=1,2,3..mn and j=2i,3i,..flor(m/i)j
get for c(100000)=1066750
c(n)=sum(n div i -1, where 0<i<n)
equal around H(mn)*mn times
where H(n)=sum(1/i where 0<i<n)
so that part: >> p=s-sum(p[j]| i mod j=0, 0<j<i);
I think not O(n*sqrt(n)) but O(n*ln(n))

Post Reply

Return to “Volume 110 (11000-11099)”