OJ Board

Well I mean prob B and D.
http://acm.uva.es/contest/data/next/problemset/
B:
"Given two patterns, you are to find a phrase that matches both."
So how come for the input:
<a> b
c <a>

Output is
c b

D:
"is called antiarithmetic if there is no subsequence of it forming an arithmetic progression of length bigger than 2, i.e. there are no three indices 0 ? i < j < k < n such that (pi , pj , pk) forms an arithmetic progression."
For each test case output one line with yes or no stating whether the permutation is antiarithmetic or not.

So why is 6: 2 4 3 5 0 1 antiarithmetic ? (2,3,5) (4,3,0) (4,3,1) - that are arithmetic progressions so but there should be none in order for it to be antiarithmetic ....

Well I mean prob B and D.
http://acm.uva.es/contest/data/next/problemset/
B:
"Given two patterns, you are to find a phrase that matches both."
So how come for the input:
<a> b
c <a>

Output is
c b

Because the upper <a> is a different <a> than the lower <a> . You have to divide "tags" into two sets: tags from the first line and tags from the second line.

D:
"is called antiarithmetic if there is no subsequence of it forming an arithmetic progression of length bigger than 2, i.e. there are no three indices 0 ≤ i < j < k < n such that (pi , pj , pk) forms an arithmetic progression."
For each test case output one line with yes or no stating whether the permutation is antiarithmetic or not.

So why is 6: 2 4 3 5 0 1 antiarithmetic ? (2,3,5) (4,3,0) (4,3,1) - that are arithmetic progressions so but there should be none in order for it to be antiarithmetic ....

AFAIR the arithmetic progression is a squence a, a+b, a+2b ... You are probably talking about increasing/decreasing sequence.

Thank you very much, indeed.

Hello
I want to tell something about Problem B(10728).I got WA during the contest this problem because of just writing caps lock letter.
For example. I was writing. I just change Ed to e and got AC.
Be carefull with this.

I just change Ed to e and got AC.

In others terms, it must be a letters from 'a' to 'z' in the words that you invent?
And what about the length of these words?

Of course you should only replace placeholders with what is defined as word in this problem, and that is between one and 16 lowercase letters.

I just got AC writing 33 'e'-s.

Input
<a> <b>
<a> <a>

Ouput
1) abc abc
2) -

What is a right?

Hello sozu.
Input Output 2 same words.
Each word containing only lower case letters.

Eduard wrote:Hello sozu.
Input

Code: Select all

<a> <b> 
<a> <a> 

Output

Code: Select all

1) abc abc 
2) acc acc
3) aaa aaa
4) ppp ppp
5) g g
...
...
...

2 same words.
Each word containing only lower case letters.

Thank you.

I got a ACed.