OJ Board

PromeNabid

If you do that inside the BFS you are repeating a lot of comparisons.

Thanks a lot brianfry, I missed that optimization.

PromeNabid

Source code:

ac

PromeNabid

I used this comparison..

Code: Select all

// check length, if not same no need to run bfs
solved

PromeNabid

I got TLE. Can not figure out the bug.
I used BFS to find shortest path to trasnform from source to destination. If the query strings are not of same length or both are same, then just printed 0.
Source code: ac

PromeNabid

Got WA.. Can somone give some input and outputs?
Thanks in advance.
/*
Name: Md. Nabid Imteaj
Prob:
Algo:
*/

#pragma comment( linker, "/STACK:16777216" )
#pragma warning( disable:4786 )

#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map ...

PromeNabid

I got WA. Please help to find my mistake. My idea is:
get a line using fgets until EOF
check Capital letters, make them small letters
tokenize string using strtok() by " 0123456789!@#$%^&*\()_+=-[]{}|\\:;\"\'<,>./?`~" and insert into a map as key(because it sorts itself)
finally print the map ...

PromeNabid

Getting WA.
1. I followed http://www.regentsprep.org/Regents/math/geometry/GCG6/RCir.htm this link to find h and k. Then normalized and found r, f, g, c.
2. To aovid division by 0 I first checked if 0 == 0 then it result is 1, if denominator is 0 then result is 0, otherwise did division.
Here is my ...

PromeNabid

"Substitutes for all letters must be different. For some letters substitute letter may coincide with the original letter."
It is never said that substituetes letters will be always next ones.
Hope this input will help.
Input:
HEHE
HAHA
HEHE
HIHI
HEHE
EHEH
HEHE
ABAB
HEHE
MMAA
Output:
YES
YES
YES ...

PromeNabid

Got WA in this topo sort problem. I thought all possible valid outputs should be accepted. I just did a straight forward topological sort. I am not getting what to do with it. Thanks in advance.

#include <iostream>
using namespace std;
int main ( ) {
while( 1 ) {
printf( "Thanks, Brianfry. AC ...

PromeNabid

Old school age calculation math. Interesting problem. Thanks all for all I/Os. Here is a list of all inputs given in this post, outputs from uvatoolkit.com and my AC code.
Input:
28

01/01/2004
02/01/2004

02/01/2130
01/01/2000

01/01/2031
02/01/1900

02/02/2031
02/02/1900

01/02/2031
01/02/2031 ...

PromeNabid

@plamplam
yeah, thats the big hint indeed, draw it down into notebook and it worked really great.

PromeNabid

these kind of problems just waste our time
why "t" is diameter ???
in image in the problem "t" is`nt diameter :D
so i have some other test cases
in the problem problem setter says "All these integers are less than 100" so
can you solve these test cases? :

-1 -2
-100
0 -100

* A circle's ...

PromeNabid

I have a question, what should happen if there is a space right before end of line ?? My code does not get the line feed for this. I did not used "gets".
At first got Wa. I read all the clarifications then Accepted. Some samples by my AC code.
Input:
I love you.

You love me.
The output will ...

PromeNabid

Much easy problem. This samples might help.
Input:

Code: Select all

Output:

Code: Select all

impossible
impossible
impossible
15 5
26 14
50 25
10 3
555 333
5555 4444
6244 6121
55 44
impossible

PromeNabid

Some sample I/O for this problem.
Input:

Code: Select all

1
-1
1111111111111
12345678910121
12345678910121
1234567891012
99999999999997
0

Output:

Code: Select all

-1
-1
265371653
173882801551
173882801551
4281283
119189511323

OJ Board

Search found 21 matches

Re: 429 - Word Transformation

Re: 429 - Word Transformation

Re: 429 - Word Transformation

Re: 429 - Word Transformation

Re: WA-537-Artificial Intelligence?

Re: 10815 - Andy's First Dictionary

Re: 190-Circle Through Three Points

Re: 1339 Ancient Cipher

Re: 10305 - Ordering Tasks

Re: 11219 - How old are you?

Re: 696 - How Many Knights

Re: 10573 - Geometry Paradox

Re: 483

Re: 10812 - Beat the Spread!

Re: 11466 - Largest Prime Divisor