OJ Board

Indeed, that's what I got for the sample input, but my output is different from the sample output:

Get wrong answer, really don't know where the code fails for which special cases? :oops:


/* 1590 - IP Networks
Author: Peter Lee
Contact: leestime.com <at> gmail.com
Algorithm: bitwise
Notes:
*/
#include <cstdio>
#include <iostream>
#include <vector>
#include <bitset>
#define N 32
using ...

If you guys think this problem from a different perspective, it's super easy:

/* 11150 - Cola
Author: Peter Lee
Contact: leestime.com <at> gmail.com
Algorithm: ad-hoc
Notes: 1. Let:
x = The price of an empty bottle
y = The price of the drink only in a bottle
Then:
x + y = 3*x => y = 2*x
2 ...

tenshi wrote:check this case:

1

4
0 9
0 9
0 9
1 9

This is an invalid input, because

Each of the two given integers is not less than 1, and the length of their sum does not exceed M.

OK. I switched to use the native C function strstr, and it got accepted, which does NOT make too much sense!

http://stackoverflow.com/questions/19506571

There's Knuth-Morris-Pratt algorithm. Find using it position of the first occurrence of s in string s*s.

I used the same strategy, but still got TLE, I believe my algorithm is O(n):

inline int GetLargestN(const char* cs)
{
string s(cs);
string ss(s, 1); ss += s; ss += s[0];

int len = s ...

NO. they should NOT be counted multiple times in the output. because the problem description clearly states

number of DIFFERENT words

In the problem description, it states very clearly:

For each puzzle line in the input, a single line of output should be produced, containing the number of DIFFERENT words in the dictionary that can be formed using the letters in the puzzle line.

My code runs with the following input:
ant
bee ...

sample
hello
this
hiso
csedu
dhaka
niceprob
rivers
cricket
acm
acm
this
string
c
you
#
a c c c h i m
s r w d d g d
h s a i o c m
c a q r t r r
h l l y o o u
#

output:
3
0
4
1
1

I think it should be:
2
0
3
1
1

Because in the problem description, it states very clearly:

For each puzzle ...

Do you consider the case that same word may appear more than once
in the dictionary ?


You mean the dictionary can contain the same word twice.

For example :

cat
cat
dog
lion
#
c a t
#

will output 2.

I applied the method that .. mentioned and got AC.. but still can't figure out why the ...

I am having the same problem. It's always submission error.

I also tried to submit a different problem and then came back to submit 755, but I still got the same problem.

Please take a look at it.

0 should not be in the test data;
The maximum input: 4786 (f(4786) has 1000 digits, while f(4787) has 1001 digits)

Test Input:
4786
3
100
20
1
2
3
4
4781
43
44
45
46

Test Output ...

And should I also take the inbalance parenthesis into account, if it's required, this problem would be so complicated.

thanks everyone, can someone reply?

I spent a lot of time in this problem, and my code can get this input lines worked:
(There are '\t' or spaces in or in the end of the input ...

I'm sorry. I forgot to change this line: To: Everytime I need to make this change before submission.

However, I'm now using this:

I think the concept is fairly simple. Convert infix notation to postfix notation. Then using the postfix notation, parse it and anytime there's supposed to be an operator, recusively plug in either +, - and *.

I think the concept is not so clear!

708 - Dreisam Equations - SampleOutput is EVEN ...