OJ Board

thanks DP. but still WA. #include <iostream> #include <vector> #include <string> #include <algorithm> //#include <fstream> using namespace std; //fstream fout( "out.txt" ); const int ted = 62; int prime[ted], n, t; string p[ted]; int q, dp[68][17][1010]; bool pr[301] = {0}; int solve( int ptr, int c...

i can't find any bug in my code. Can any body help me? #include <iostream> using namespace std; int dp[8][8][8][8][4][4][4][4]; int solve( int a1, int a2, int a3, int a4, int siz, int fir, int last, int firsize ){ if( dp[a1][a2][a3][a4][siz][fir][last][firsize] != -1 ) return dp[a1][a2][a3][a4][siz]...

my program passed all the testcases what exist in this thread. Can any body help me? #include <iostream> #include <vector> #include <string> #include <algorithm> //#include <fstream> using namespace std; //fstream fout( "out.txt" ); const int ted = 62; int prime[ted], n, t; string p[ted]; int q, dp[...

my code returns the wrong answer with the testcases that exist in this post. but i cant find my buge. can any body help me? #include <iostream> #include <algorithm> #include <queue> using namespace std; int bob[30][3]; int h[30][3][3]; int n; int height(int id, int i, int j) { int a[3] = {0}; a[i] =...

i get wa. can any body find my buge? i cant find it. #include <iostream> #include <string> using namespace std; string sum(string s1, string s2) { string s3; int l1 = s1.length(); int l2 = s2.length(); int ptr1 = l1 - 1, ptr2 = l2 - 1, q = 0; while( ptr1 >= 0 || ptr2 >= 0 ) { if(ptr1 >= 0) q += s1[p...

thank u very much for your tricky test case.

i find my bug and got AC.

thank u.

my code returns this.

can u find any bug in my code?
please explain your algo.
my code returns a correct output for all the test cases .
should i sort the input?
my algo is wrong?
thanks.

what is the output for this input:
2 2 2 ?

i get wa with sorting and without sorting.
can any body help me?

i cant find any bug in my code. can any body help me. i get WA. #include <iostream> #include <algorithm> using namespace std; int score[80]; int s[80][3]; bool gr[80][80]; int main() { int n; int t = 1; while(cin >> n, n) { memset(gr, 0, sizeof(gr)); for(int i = 0;i < n;i++) cin >> s[i][0] >> s[i][1...

very very silly mistake.

my program cout << endl 11 perline.

thanks mr jane.
i got accept.

thank u very much mr jan.

for this input:
4
B 1 1
A 0 0
C 1 0
D 0 1

the output must be : No rectangles ??

can u give me some tricky inputs.thanks.

i cnat understand this sentence:

"Within each set, points labels occur in alphabetical order"

can any body explain this with a example?

i get wa and i dont know which part of my program is wrong.

i get wa in 0.000. please help. #include <iostream> #include <string> using namespace std; int mx; int ptr; string s[26]; bool visited[26][26]; int len; int isin(int i, int j) { if(i >= 0 && j >= 0 && i < ptr && j < len) return 1; return 0; } int dfs(int i, int j) { if(!isin(i, j) || visited[i][j] |...

i get wa in 0.000. can aney body help me? #include <iostream> #include <string> using namespace std; int mx; int ptr; string s[26]; bool visited[26][26]; int len; int isin(int i, int j) { if(i >= 0 && j >= 0 && i < ptr && j < len) return 1; return 0; } int dfs(int i, int j) { if(!isin(i, j) || visit...