OJ Board

Finally I got AC using Python . But I suppose input data may have garbage in the last (e.g. additional space), so length for every row input is NOT 3...

pls anybody help me..!! i am new poster in this site.. i don't know why i am getting WA....on this problem.. #include<stdio.h> #include<string.h> #include<ctype.h> int main() { int i,j,x_count,o_count,flag_x,flag_o,t,test; char B[10][10]; //freopen("c.txt","r",stdin); scanf("...

Thanks to every one who contributed their knowledge to this. I appreciate it My 2 cents: Make sure to skip unwanted input once you exit out of a for-loop early. So if you are reading in 9 values (each spot on the board), make sure to skip over the remaining values if you happen to exit the for-loop ...

Try the I/O in this thread.

Try these
input :
http://paste.ubuntu.com/5896578/
output:
http://paste.ubuntu.com/5896581/

ohh thanks sir.... :@brainfry...

.XX
XOO
XOO

how become this a valid tic tac game?????

1
XXX
XOO
XOO

why this case indicates "yes" as we see x wins 2 time how this is possible...??????

Click my submissions to see the reason for your compile error.
don't use system("pause");

i can not find my compilation error #include<iostream> using namespace std; int main() { int p=0,c,b,check=0,repeat; cin>>repeat; do { char y='y'; char a[3][3]={'.','.','.','.','.','.','.','.','.'}; p=0; do { system("cls"); for(int i=0;i<3;i++) { for(int j=0;j<3;j++) { cout<<a [j]; } cout<...

... and guys This is sooo number theory.... just try to find the last digit of 'm' & ckeck only da last two digit of 'n'... suppose.. m=298 n=10363 Here last digit of m=8 so check only the recurrence of last digit of 8 that is 8,4,2,6 And last 2 digits of n=63.. 63%4 = 3 The 3rd recurrence ...

How to solve this problem? I solved 10363 but I am getting TLE for this one(11623). Please can someone describe an efficient algorithm? I just store the input as a table in a 2D array and compare vertically, horizontally and diagonally to check ...

34 XXX XOO XOO OXX XOO XXO X.. X.. X.. X.. X.. O.. X.X ... .X. O.O ... .O. X.O XO. XOX X.O XOO XXX OXO XXX OXO XXX .O. .O. OOO .X. .X. XOX OXO XOX XXX OOO X.O X.O ..X X.. X.X .OO XOO X.X OO. X.X X.O O.X X.O X.O OO. XXX X.O O.X OOX X.O O.. XXO X.O O.O X.. ... ... ... ... .X. ... ... .O. ... OO. XXO ...

Getting WA... but why?? /*in the name of Allah */ # include <list> # include <deque> # include <bitset> # include <algorithm> # include <functional> # include <numeric> # include <utility> # include <sstream> # include <iostream> # include <iomanip> # include <cstdio> # include <cmath> # include <cs...

Can anyone please help me with my code ? M getting W/A :( m i missing any important part? thanks in advance #include <stdio.h> #include <iostream> #include <vector> #include <map> #include <algorithm> #include <string.h> using namespace std; #define fo(i,start,end) for(int i=start;i<end;i++) #define...