OJ Board

Please try this case:

*abcd

* means a space

My AC code produce:

00199897923


But your code just produce 2 blank lines.

Also, there are some problems in decoding.

your code cannot handle the number bigger than 99.

Such as:

001


My AC code produce:

d


However, your code did nothing ...

Maybe u are using VC6 as your compiler...

VC6 will not complain if you use a variable that had been declared but blinded.

However, gcc & g++ will complain.

i think there are some misunderstandings between u and LIMON.

u thought programmers should not show their acc code, and LIMON just want to let others who can not pass the questions get help.

If u are serious and confident that u can solve the problem, u should not refer to the website.

However ...

Please look at this for-loop.
i is blinded.
You can't use it before declare it.


for(i=0;i<lomba;i++)
{
c_char[key[i]-1] = d_char[i];
}


I suggest you change it like this way as you use before:

for(int i=0;i<lomba;i++)
{
c_char[key[i]-1] = d_char[i];
}


Hope it helps. :D

Keep trying...

You will succeed anyway...

If you have further questions, please feel free to ask.

This problem is the same as Problem 530.
You can find some test cases on thread 530.

------------------------

I recommand you to use long long integer to record the result.

Also, you can not assume m could not be ZERO.
If n!=0 && m=0, you should output 1.

Sample input:

10 0
0 0


Sample ...

Hi.
This is an easy problem.
But please be careful about its output standard.

Output a blank line after each set.

That's why you get WA.
You didn't put any blank line after them.

I have tested for you.
if this line

cout<<"The minimum number of moves is "<<mov<<".\n";

changes to

cout ...

Your solution even can not handle the example input!!!

Sample input:

5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL


Sample output:

1 1 E
3 3 N LOST
2 3 S


Your code produces:

1 1 E
3 3 N LOST
0 3 S LOST


Please check your program. If the preview robots leave a "scent" on a ...

To "mahmoud.helmy"

Actually, you need not to memorize what the input is.

You just need to make an integer to memorize what the quato is.

For example, you can use this code to finish the job.


char c;
int num=0;
while((c=getchar())!=EOF){
if(c=='"'&&num==0) {num=1; printf("``");}
else if(c ...

After reading so many suggestions, I got AC now.

However, I found a very serious problem. The first character of the puzzle might be Z !!!

When you use getchar(), you can't know whether there will be any characters following 'Z'.

I think most of you will search the character and if you found it ...

You must loss the endl at the end of the output.

However, I don't think your algorithm is good enough.

But it will be ok if the time limit is not exceeded.

#include<iostream>
#include<vector>
using namespace std;

void check(int i,int loc);

vector<int> a1,a2,street;
int order[2000];
bool finish=false,pass=false;
int num;
bool used[2000];
bool checked[2000];

int main(){
int b1,b2,st;
while(cin>>b1>>b2){
a1.clear(); a2.clear(); street.clear();
if ...

I have solved 302 by using DFS Algorithm. However, I get TLE.

I don't know what kind of cases will lead to TLE. Can somebody tell me.

I find my program run fast on my computer even though the cases are very complicated.

I think I must ignore some special cases that beyond my thinking.

Is It built by youself?
That's great.

However, I can't find the solution of 148.
But now I have got AC.

Thank you anyway.

I got AC now.

Anyway, thank you very much.