OJ Board

To implement the following algorithm using balance(height) search tree,each operation should take O(logn) time.(n is the number of elements in the queue,
described later)

1)You have a set of programs that r to be run in an O.S.
say P_1,P_2,P_3,......,P_n.
each program has a memory requirement m_1 ...

Hey,
Can nbody who got any AC give me some output he got for numbers around 10^7. or may be 10 outputs from 10^7 - 1 to 10^7. :)
Well my C++ basics r also not strong in certain cases so plz could you tell me
"The input list contains a single number per line and will be terminated by end-of-file ...

can u be a little more explicit about how to use horner's rule
Thankyou

can any body give an algorithm to compute the composite of 2 polynomials,
for e.g p(x)=x^2 +1
q(x)=x^2
=> p(q(x))=x^4 + 1.

(2) p(x)=x^2 - x + 4
q(x)=x^4 - x^2
p(q(x))=x^8 - 2*x^6 + x^2 + 4. )

thankx a lot,but my question was about the logic that i am using in the function dollars.I am not convinced that i am handling all the possible cases ,for eg. take input as .5 and just manually go thru it ,if u can find the missing link that would be great.

hi
Plz tell me what is the logic that is wrong orwhat cases am i missing for the prob 147 ,here is my code: :(

#include<iostream>
using namespace std;

int a[]={10000,5000,2000,1000,500,200,100,50,20,10,5};



int dollars(int i,int n)
{
int chng=0;
if(i<11&&n>0)
{
if(n%a[i]==0)
{
chng ...

thankyou

i am getting the correct answer on my comp but the judge said it gave a WA ,why?
here's my code:
#include<iostream>
#include<queue>

using namespace std;

void gen_prime(queue<int> &p,int n)
{
int i=2,j;
while(i<=n)
{
for(j=2;j<i;j++)
{
if(i%j==0) break;
}
if(i==j) p.push(i);
i ...