OJ Board

i do minimax search on it. but WA. can anyone give me some cases that my code doesnt work? [cpp] #include <stdio.h> #include <stdlib.h> #include <string.h> int i,j,k; char in[30]; int cards[35]; int sum; int minimax(int n,int state,int card1,int card2,int card3,int card4,int card5,int card6); void m...

yes, you are right.....

I am busy right now.
If i have time.
Let me write a "random algorithm", which randomly generate points and test if it satisify the conditions.

Lol~~

Thanks!
fully understand!

XX-0000000000-XX is correct???

why?

how about
AA-0000000000-AA?

oh, hard to identify if it is valid or not..

my code is quie ugly, because i forced it to process the example appears here correctly. However, i am still WA....please help [cpp] #include <stdio.h> #include <string.h> #include <stdlib.h> char s1[100]; char news1[100]; int temp[100]; int ps[100]; int i,j,k; int counter,l; int c,sum,cc,damn,act; ...

thanks anyway!
i got a AC now

UFP2161 wrote:SilVer DirectXer:

Check your "check for duplicates" code again. It's not entirely correct.

thanks UFP2161 , i have updated the code and checked repeated before putting to v[].(see above)
however. seems i am still WA....
why?

i got a WA too, i have checked if repeated words...why WA? [cpp] #include <stdio.h> #include <string.h> char words[1002][52]; char v[1002][52]; char tempch[52]; int i,j,k,l,m,n; char dummy[100]; char cant[100]; int counter,vcounter; int ok; int maxlen; void main() { while (1) { scanf("%d",...

Larry wrote:Use sieve for your prime checker..

thanks....
but, could you explain more details?
how to use a sieve for the prime checker?

Thanx Michniewski! u r right......... :P eric! try with the following one :wink: for(m= 6 ; m < x; m+=6) if(prime(m-1) && prime(m+1)) printf("%ld %ld\n", m-1, m+1); the algorithm is great. but..how do u guys discover that all twins prime are subset of (6*k-1,6*k+1), for k is integ...

hi all..I use DP to solve it. could anyone figure out why..TLE? [cpp] #include <stdio.h> int i,j,k,l,m,n,p; int input[105]; int q[101][20000]; int parenti[101][20000]; int parentj[101][20000]; char op[101][20000]; int qcounter[101]; int qto[101]; int tempnum; int ok; int need; int needtobreak; int n...

input: cat dig dog fig fin fine fog log wine output: 5 why it is 5? maybe i am misunderstanding the question. the task is that we need to find out the smallest step for transforming each pairs of word from the top one by one..(cat->dig),(dig ->dog), (dog->fig),..... and among these smallest number, ...

[cpp] #include <iostream> #include <math.h> using namespace std; int n,k,i,j,l; int input[10005]; int oper[10005]; int apv; int sum; int carry; int ncase; int ok; void main(void) { cin>>ncase; for (l=1;l<=ncase;l++) { for (i=1;i<=10001;i++) oper =0; apv=0; cin>>n>>k; for (i=1;i<=n;i++) { cin>>input ...

oh shamim, you must in a ACM team of a Uni, ha~

pc2 is the submittion program for "real" ACM competition, i remember...written in Java..

i am Time Limit too. But my code run fast... why?[cpp] #include <stdio.h> #include <math.h> int alpha,N,height,rest_c,a,b; int finished; int ans1; double ans2; int i; void main(void) { while (1) { scanf("%d",&height); scanf("%d",&rest_c); if (height==0 && rest_c==...