Search found 163 matches

by Emilio
Mon Nov 07, 2005 12:46 am
Forum: Volume 109 (10900-10999)
Topic: 10949 - Kids in a Grid
Replies: 30
Views: 11465

polone wrote: Hmm... I used: Code: cin>>n1>>x>>y; x--; y--; if(x<0 || y<0 || x>=h || y>=w) while(1); and get TLE this is my input method: Code: char map[21][21]; cin>>t; for(tt=1;tt<=t;tt++) { cin>>h>>w; for(i=0;i<h;i++) cin>>map ; cin>>n1>>x>>y; cin>>s1; xxxxx cin>>n2>>x>>y; cin>>s2; xxxxx } Is it ...
by Emilio
Sun Nov 06, 2005 9:13 pm
Forum: Volume 3 (300-399)
Topic: 342 - HTML Syntax Checking
Replies: 31
Views: 12440

Thanks for the reply!

I got AC.
With your output I have seen that I considered of another way some cases.
by Emilio
Sat Nov 05, 2005 6:20 pm
Forum: Volume 3 (300-399)
Topic: 342 - HTML Syntax Checking
Replies: 31
Views: 12440

Hi all! I'm getting WAs. Could you say me what is the output for this? [EDIT] Now cases 3 and 4 are correct as regards problem's specification [/EDIT] 2 <EMILIOJOSE> </EMILIOJOSE> 2 <EMILIOJOSe> </EMILIOJOSe> 2 <EMILIOJOSE> </EMILIOJOSe> 2 <EMILIOJOSEe> </EMILIOJOSEe> 2 <EMILIOJOSEE> </EMILIOJOSEE> ...
by Emilio
Wed Nov 02, 2005 6:54 pm
Forum: Volume 109 (10900-10999)
Topic: 10956 - Prime Suspect
Replies: 24
Views: 11616

Hello all! I want to put my point of view about the time limit. I agree with the four seconds of time limit because with a bigger limit you can use the method of the three bases for solve the problem, and with this, the problem would be a very straighforward problem. I prefer for this problem that y...
by Emilio
Tue Nov 01, 2005 8:28 pm
Forum: Volume 109 (10900-10999)
Topic: 10950 - Bad Code
Replies: 19
Views: 10126

Hi Riyad! I haven't checked your code deeply, but for me is strange that you stop when your counter is 100 and then you sort the first 100 strings that you found. If you search in alphabetical order the first ones strings, the first 100 must be the first in alphabetical order, else you are sorting t...
by Emilio
Mon Oct 31, 2005 1:46 pm
Forum: Volume 109 (10900-10999)
Topic: 10954 - Add All
Replies: 80
Views: 26934

by Emilio
Sun Oct 30, 2005 7:15 pm
Forum: Volume 109 (10900-10999)
Topic: 10950 - Bad Code
Replies: 19
Views: 10126

For these inputs post in this thread: 1 a 0 000 3 a 0 b 01 c 10 00110001 8 a 101 b 1 c 10 d 1001 e 1010 f 101010 g 101011 h 1010101 010101010101000101001010111010100101011010101010101011010101010101010110101010101011010101010101101 0 this is the different output for my AC code: Case #1 aaa aa aa Cas...
by Emilio
Sun Oct 23, 2005 6:13 pm
Forum: Volume 8 (800-899)
Topic: 842 - Crossword Puzzles
Replies: 6
Views: 2698

Hi there after a time! :D

I have done again try this problem and have obtained AC at my first attempt.

Here is the output for my previous post where are my test cases:

Code: Select all

1

1

1

1

5

3

0

1

0
It's different artem's output. :roll:
by Emilio
Tue Oct 11, 2005 10:59 pm
Forum: Volume 109 (10900-10999)
Topic: 10932 - Calculator
Replies: 19
Views: 10968

I have obtained AC.
My trouble was similar to sunmoonstar_love's trouble.
I used atoi, but now I have used atof and have obtained AC.
A semi-mistake :lol:
by Emilio
Mon Oct 10, 2005 4:00 am
Forum: Volume 109 (10900-10999)
Topic: 10932 - Calculator
Replies: 19
Views: 10968

Hello! Could anyone say me if is correct my output? input: y=5 x=10 (x+y)/5+(x-5)+5*(5-10)*7+7 -7+1*1*(5-6)*(5-1-1-1-1-1) x x*(x+x)+x x*((x+x))+y ((((x)))) (x) (x-(x*x+x)+x*x) (x/5/5) -5*4 5*(5-2) 5-2-2-2 2*(-6-2+3-3-3-3-3)*3*2*7*3494*(-1)/(-2) 2*2*2*2*2*2*2/2*1 a=1 b=2 a*b-(5*4-((2+34)*a+1)+7*3) a*...
by Emilio
Sun Oct 09, 2005 2:24 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 30748

earlier terms of the sequence Let be a sequence a1, a2, ..., an The earlier terms of an element ak, 1<=k<=n, there are the terms, a1, a2, ..., a(k-1) Example: 1 2 3 9 The earlier terms of 1 is nothing. The earlier terms of 2 is 1. The earlier terms of 3 are 1,2. The earlier terms of 9 are 1,2,3.
by Emilio
Sat Oct 08, 2005 1:52 am
Forum: Volume 109 (10900-10999)
Topic: 10923 - Seven Seas
Replies: 28
Views: 11507

Thanks! I have got AC. My trouble was a bug in my code. But I have got AC with different approachs: 1. I calculate the distance how euclidean distance. 2. I calculate the distance how Manhattan distance. 3. I can move (only test with my own ship) where there is a rock. 4. I can't move (only test wit...
by Emilio
Fri Oct 07, 2005 8:16 pm
Forum: Volume 109 (10900-10999)
Topic: 10923 - Seven Seas
Replies: 28
Views: 11507

Hi another time!

I can't figure out how you can destroy the enemies in the fourth case without dead.
Could you explain me that?
by Emilio
Thu Oct 06, 2005 10:44 pm
Forum: Volume 109 (10900-10999)
Topic: 10923 - Seven Seas
Replies: 28
Views: 11507

Hello there! I have got correct answers for all the inputs of this board, but I get WA from OJ. Could anyone say me if are there some tricky inputs? And, could anyone say me if is this correct? input: 8 .....S.. ........ ........ ######## E......E ........ ....E... ........ EEE..... .....S.. ..........
by Emilio
Tue Sep 27, 2005 12:16 am
Forum: Volume 108 (10800-10899)
Topic: 10831 - Gerg's Cake
Replies: 13
Views: 5566

Thanks mf another time!

A good link :wink:

Now, I have solved it at time of 0:00.004

Go to advanced search