OJ Board

I replaced this part of your code
for(i=0;i<26;i++){
if(my[i]>=my[i+26]){
my[i]+=my[i+26];
if(max<my[i]){
max=my[i];
}
my[i+26]=0;
}
else{
my[i+26]+=my[i];
if(max<my[i+26]){
max=my[i+26];
}
my[i]=0;

}

with:

max=0;
for(i=0;i<52;i++)
if(my[i]>max)
max=my[i];


And got AC ...

Use this:

#include <iostream.h>
void main(){
int a;
while(true){
cin>>a;
if(cin.fail()){
cout<<"error"<<endl;
cin.clear();
break;
}
else{
break;
}
}
}

cin.clear() does not do what you think it does. read the documentations.

You're not initializing the 'count' variable in genFac() function.

You should always initialize variables unless they are global, or static.

And, the way you start your program:

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <functional ...

Hey,
My AC program outputs But if you're getting WA instead of PE (Presentation Error) you should consider checking your algorithm instead.

Good luck,
Sahand.

There should be an 'Edit' button right next to your post.
Take care...

Hi,

I think most of those 0:00 for this problem are done using pre calculation.
Maybe even all of them!
Anyway, I think you can optimize your code a good amount in the following way. I could get it accepted in 0:00.980 which is not really good, but is still better.

#include <stdio.h>

int main ...

Try this input:

1
4 5 3
AA AD AC AB
AC AB
AB AD
AC AD
AA AC
AA AB
10 AA AD
10 AA AC
10 AC AD

Your output:
SHIPPING ROUTES OUTPUT

DATA SET 1

NO SHIPMENT POSSIBLE
$1000
NO SHIPMENT POSSIBLE

END OF OUTPUT



Correct output:
SHIPPING ROUTES OUTPUT

DATA SET 1

$2000
$1000
$1000

END OF OUTPUT ...

I checked your code and it seems it's more a problem with your algorithm than the way you treat input.
Hint: Inside this loop:
for (j=0;j<(signed)strlen(a)-1;j++) {....}
You can accomplish what you want by using only a . There's no need to look ahead.

And also, It's better if you include your ...

Thanks a lot, I got AC
It was a very simple mistake!

Yes, I checked that. I was not correct but I corrected it and I still get WA.
Here's the new code: Thanks!

I got AC. Thanks!

Another problem that I keep getting WAs on without any good reason.
I checked all the sample input on the board but no luck!
Please help me!!

OK, Here's how I do it:

int main()
{
int cases;
cin>>cases;
for(int casei=1;casei<=cases;casei++)
{
bool bitmap[32][32];
for(int i=0;i<32;i++)
for(int j=0;j<32;j++)
bitmap[i][j]=false;

int x,y;
cin>>x>>y;
string line;
getline(cin,line);
if(line=="")
getline(cin,line);

for(int i=0 ...

This is my code for 325, but I keep getting WAs!
I checked all the sample inputs on this board, and it gives correct output.
I would really appreciate if somebody could tell me what i'm doing is wrong.

P.S. I know it's not an efficient way of doing it. I know about FSMs but just didn't feel like ...

I didn't check your program but here's the output I get from my AC code:

Input:
3
2 1
EEENNNWWWSSS.
2 1
ENWS.
2 1
EEEEEEEEEENWWWWWWWWWWS.


Output:
Bitmap #1 ...