Search found 39 matches
- Thu Jan 01, 2004 6:41 am
- Forum: Volume 105 (10500-10599)
- Topic: 10578 - The Game of 31
- Replies: 11
- Views: 5300
10578 The Game of 31
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...
- Sat Nov 15, 2003 8:45 pm
- Forum: Volume 6 (600-699)
- Topic: 691 - Triangle Partition
- Replies: 2
- Views: 2209
- Fri Aug 29, 2003 6:59 am
- Forum: Volume 100 (10000-10099)
- Topic: 10029 - Edit Step Ladders
- Replies: 70
- Views: 22939
- Thu Aug 28, 2003 9:15 pm
- Forum: Volume 3 (300-399)
- Topic: 333 - Recognizing Good ISBNs
- Replies: 166
- Views: 25411
- Thu Aug 28, 2003 4:50 am
- Forum: Volume 3 (300-399)
- Topic: 333 - Recognizing Good ISBNs
- Replies: 166
- Views: 25411
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; ...
- Mon Aug 04, 2003 5:10 am
- Forum: Volume 103 (10300-10399)
- Topic: 10393 - The One-Handed Typist
- Replies: 40
- Views: 12243
- Sun Aug 03, 2003 6:17 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10393 - The One-Handed Typist
- Replies: 40
- Views: 12243
- Sat Aug 02, 2003 8:00 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10393 - The One-Handed Typist
- Replies: 40
- Views: 12243
- Sat Aug 02, 2003 7:28 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10394 - Twin Primes
- Replies: 101
- Views: 35291
- Fri Aug 01, 2003 3:06 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10394 - Twin Primes
- Replies: 101
- Views: 35291
- Wed Jul 30, 2003 8:22 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10400 - Game Show Math
- Replies: 32
- Views: 18626
10400 math game show..TLE using DP?
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...
- Tue Jul 22, 2003 7:34 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10029 - Edit Step Ladders
- Replies: 70
- Views: 22939
10029
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, ...
- Sun Jul 20, 2003 3:11 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10036 - Divisibility
- Replies: 37
- Views: 12283
10036 Divisibility WA
[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 ...
- Sun Jul 06, 2003 7:27 am
- Forum: General
- Topic: SECURITY FLAW IN ONLINE JUDGE
- Replies: 34
- Views: 9561
- Sat Jul 05, 2003 2:41 pm
- Forum: Volume 1 (100-199)
- Topic: 107 - The Cat in the Hat
- Replies: 278
- Views: 26822