OJ Board

is there any one who is free to reply?

can someone give some in/outputs for this problem.
i assumed the max authors per paper to be 1000 and max characters in author name to be 1000.
and erdos no. for Erdos itself to be 0.

my algo is as follows:

for( paper(i) ) // i goes from 1 to p
if(published by erdos)
erdos no.of all authors =1 ...

with the fo.llowing code i got a compile error which is running perfectly on my comp.


import java.io.*;
import java.util.*;
import java.math.*;
class Main{
private static BufferedReader stdin =
new BufferedReader( new InputStreamReader( System.in ) );
public static void main (String args ...

Can someone plzz explain me why this question is getting accepted by greedy!!!!
for the given test case the shomaker has to pay a fine of 2 cents.
But if he do the jobs in the order
2 3 1 4
he has to pay 0 cents!!

what the output shuld be if we get colinear pts. as input

like..
0 0
1 1
2 2
0 3
0 0
???
what shuld be the hull for this??
shuld (1,1) be included?

MY SIGNATURE
*Helping others wont make u smaller!
*learn frm mistakes.

sry!!my bad!!
Thx rio.

the problem says::
you should print 'NO SOLUTION'. For lexicographic comparison you should consider lines in first place
what does he mean by line in fst place!!
plzz tell wether my outputs are correct or not!!
INPUT::
3
0 6 0 1 0 4 0 5 0
0 0 8 3 0 5 6 0 0
2 0 0 0 0 0 0 0 1
8 0 0 4 0 7 0 0 6
0 0 6 0 ...

U PPL R MONSTERS!

OK i will keep these things in mind ..But please tell me why am i getting signal 11(undefined memry refrence).
code:
*DELETED*After the 29th submission i got AC
this sux.
anyways thx again JAN.
i dont know anything about this bit sieve..i just pasted it from this link
*deleted*
Plzz help!!

why isnt any one replying!!!!!!

I am using Miller's Primality test even then its TLE!!! And when i used sieve its MLE!! I read previous posts but i cant understand how they r managing not to MLE!! some one plzz help!

Thx again dude!
...and I Think u are really a great helper and a very great observer.
Thanks.

they are saying that we have to find recursion depth..
and that 9 has a depth 1.
9-->1.
Now consider
99999...(21 9's)--->189--->18---->9--->1.
the depth shuld be 4.
but they are saying it to b 3.
Also consider 108.
108--->9--->1.
i think it should be 2.
Am i right???

can u plz tell me whats wrong then with this code????
*deleted*
O My God how can b i so stupid
THX A LOT BUDDY!!!*hugs*

hey dude can u tell me if i am missing any no.??
*deleted*
THX THX
U GUYS R REALLY COOL