OJ Board

Here is my code. I got WA but I don't know what I have done wrongly. Please give some inputs that my code fails. Thanks.

#include <iostream>
#include <map>
#include <algorithm>
#include <sstream>
using namespace std;

map<string, long long> m;

string& replace_all(string& str,const string& old_val ...

Please read carefully what I said :wink: :

If 1 is reliable , then
a)7 is not reliable, (since 7 says 1 is not reliable)


but you said:

i think there's a little prob with ur thinking.......in ur thinking...... if 1 is not reliable then 7 is obviously not reliable.......but i think thats not ...

On that case, 2 can be also reliable.. :-)

Yes, 2 can be reliable. Please tell me whether my following logic to solve the problem is incorrect:

for each input of X and Y,
(
BX = The current state of X
BY = The current state of Y

If BX is not set and BY is not set
=> set BX = 1 or 0

If BX ...

try this input

20 6
1 -3
2 -3
3 1
2 2
7 -1
4 3


the rigth out put should be 18......your code shows 19..... :wink:

I don't quite understand why this input causes 18. From my understanding,

If 1 is reliable, then
a) 7 is not reliable, (since 7 says 1 is not reliable) and
b) 3 is not ...

My code passed the test cases as listed in this thread, but I still get WA. What is wrong with my code? Thanks.


#include <iostream>
using namespace std;

main() {
int i, a, x, y;
while (cin >> i >> a) {
if (i==0 && a==0) break;

bool b[i];
for (int j=0; j<i; j++)
b[j]=true;

for (int j=0 ...

How about the following case:

I got WA all the time for this problem. I guess I have overlooked something unsure, since my program passed the test cases given in the problem description. Could someone post some critical inputs? Thanks.

Some one can explain these case???
INPUT:
2
44455
44555
OUTPUT:
S
S

Why???
I am confused. :-?

This is because:
A player can remove a particular digit if the sum of digits of the resulting number is a multiple of 3 or there are no digits left.

Since S moves first, the obvious way is to ...

I have tried to tackle this problem but I am getting WA. I have passed the given input in this thread. here is my code:


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

main() {
int n;
long double a, b, c, x, y, z;
long double p, q, d, u, v, phi, e, e1;

double pi = acos(-1.0 ...

LayCurse, thanks for your input. I modified my code and finally passed the test case above. However, I am still getting WA. Could somebody helps what test case my code below will fail? Thanks a lot.

#include <iostream>
using namespace std;

main() {
int n;
cin >> n;
for (int i=0; i<n; i ...

I am getting WA all the time. Please help to give some critical inputs. Thanks.

#include <iostream>
using namespace std;

int main() {
int n;
cin >> n;
for (int i=0; i<n; i++) {
string s;
cin >> s;
int n2 = s.size();
cout << "Case " << (i+1) << ": ";
// cout << s << " - ";

if (n2==1 ...

I tested my program and all the test cases in the sample and in this thread are passed. However, I still get WA all the time? could somebody help?


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

string trim(string s) {
s.erase(0,s.find_first_not_of(" "));
s.erase(s.find_last_not_of ...

Here is my code and got WA:

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

string calc_sum(string str1, string str2) {
string s1 = str1, s2 = str2;
if (str1.length() > str2.length()) {
for (int i = str2.length(); i < str1.length(); i++)
s2 ...

i have tried the problem and got WA for several times, even I used the algorithm posted by Sedefcho. Here is my code:


#include <iostream>
#include <string>
#include <sstream>
using namespace std;

#define S1_MAX 9876543210ULL

bool checkDigits(unsigned long long s1) {
string n_str ...

Found my problem already. Thanks.