OJ Board

This is not a topic of Volume I. So you should submit this type of topics in Algorithm section.

...and if you want classified problems list, then go to: ShyGypsy / Igor’s Tools and use "Search query:" text box at top-left of the page.
This is a rich site for ACM solver. you can use other useful ...

However, there has another problem in your code. Initialize max_rep and min_cost by an out-of-range value for every case.

Problem mentioned: a line naming the proposal (up to 80 characters terminated by end of line). so the proposal name may contain white spaces.
But your code is-
for(i=1;i<=p;i++){
scanf("%s%lf%d",&proposal[i],&cost[i],&met_req[i]);
so use gets().
You can optimize for(i=1;i<=p;i++){
scanf("%lf%d ...

Rushow, you forgot the terms & conditions of the problem
only one operation ( Flip ) is available and that is you can exchange two adjacent terms
but your algorithm didn't perform like this.
think about second sample input-
2 3 1 in your algo, first interchange occurs between 2 and 1, but 2 and 1 ...

Perhaps, problem is in your calcu() function
make the sum of these numbers until it comes in one digit
so while(d>10)
d=add(d); is wrong. beacuse, if d=10 then the loop will stop.

you may change the loop condition by this way-

while(d>=10)
d=add(d); or,
while(d>9)
d=add(d);

the problem description mentioned
Numbers will be at most 200 characters long.
and also the number may contain leading zeroes.
03425 3455
i solved by this way- input in a string
normally we add two number right to left. here add left to right. as a result this add reversely.
the number may ...

the mistake is

int i,j,n,m,er=0,row,col,ec=0;

you need to initialize er,ec for every input set.
so place the initialization here. Be careful about initialization error.

Sohel vai (Bengali word), Thanks for your kind information.
But, is my continuous fraction output of the input correct? Will you post your output?

Obviously (from my ac code)

Thanks Wei-Ming Chen.
my code would fail in your this test case -3 -1 -1 1 1 3 for improper checking.

Now ac in 244 millisec.

Wow! though this is a big mistake, but not all.
the highest input is less than 10^20 i.e 99,999,999,999,999,999,999 [20 digit]. but unsigned long long can hold only
(2^64)-1=18446744073709551615 [20 digit]. but less than the 81553255926290448384 from the highest input. so, if the input is ...

and my code fell on these
-10 -5 3
-10 -5 -3 3 5 10 11



Wei-Ming Chen, i can understand the problem of your code.
you think the line of input as stack. when a positive number(let x) is inputed, then check that-
if(stack_size!=0 && top_of_stack == x ) pop the top num;
else print "try again ...

For this problem, I used

To clear more , consider the following input:
-10 -8 8 -5 5 10
this is a invalid input; -8 8 -5 5 is surrounded by -10 10 and 8+5=13 sized box cannot be allocated in a 10 sized box. but above input can be validated in this way-
-10 -8 -5 5 8 10
Now it is possible. because, if the 5 sized box is ...

Oh ho! what a great mistake.

I forgot to store the highest proposal's price in low_price.

that's the wrong. Sorry.

Now AC (Air Conditioning).