10728  Help!
Moderator: Board moderators
10728  Help!
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 ....
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 ....
Re: Waterloo Fall (10728 & 10730 ?)
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.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
AFAIR the arithmetic progression is a squence a, a+b, a+2b ... You are probably talking about increasing/decreasing sequence.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 ....
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 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.
Code: Select all
<a>
<b>
Code: Select all
Ed
Be carefull with this.
someone who like to solve informatic problems.
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650

 Guru
 Posts: 724
 Joined: Wed Dec 19, 2001 2:00 am
 Location: Germany
I just got AC writing 33 'e's.
someone who like to solve informatic problems.
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650
Hello sozu.
Input
Output
2 same words.
Each word containing only lower case letters.
Input
Code: Select all
<a> <b>
<a> <a>
Code: Select all
1) abc abc
2) acc acc
3) aaa aaa
4) ppp ppp
5) g g
...
...
...
Each word containing only lower case letters.
someone who like to solve informatic problems.
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650
http://acm.uva.es/cgibin/OnlineJudge?AuthorInfo:29650
^^
Thank you.Eduard wrote:Hello sozu.
InputOutputCode: Select all
<a> <b> <a> <a>
2 same words.Code: Select all
1) abc abc 2) acc acc 3) aaa aaa 4) ppp ppp 5) g g ... ... ...
Each word containing only lower case letters.
I got a ACed.