Search found 5 matches
- Tue Sep 07, 2004 3:27 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10704 - Traffic!
- Replies: 15
- Views: 11603
10704 - Traffic!
Please give me some testdata ,3x!
- Mon Dec 22, 2003 5:07 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10544 - Numbering the Paths
- Replies: 14
- Views: 6365
Please give me some advice ,ok? otherwise ,some test cases.
Please give me some advice ,ok? otherwise ,some test cases.3X!
- Fri Dec 19, 2003 3:20 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10541 - Stripe
- Replies: 10
- Views: 6518
- Wed Dec 17, 2003 4:53 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10541 - Stripe
- Replies: 10
- Views: 6518
10541 - Stripe
Why Wa?
#include<stdlib.h>
#include<string.h>
#include<iostream.h>
int t,n,k,f[2][201][51];
void add(int *a,int *b,int *c)
{
int i,g;
memset(c,0,sizeof(c[0])*51);
if (a[0]>b[0]) c[0]=a[0]; else c[0]=b[0];
g=0;
for (i=1;i<=c[0];i++)
{
c =a +b +g;
g=c /10;
c %=10;
}
if (g>0) c[++c[0]]=g ...
#include<stdlib.h>
#include<string.h>
#include<iostream.h>
int t,n,k,f[2][201][51];
void add(int *a,int *b,int *c)
{
int i,g;
memset(c,0,sizeof(c[0])*51);
if (a[0]>b[0]) c[0]=a[0]; else c[0]=b[0];
g=0;
for (i=1;i<=c[0];i++)
{
c =a +b +g;
g=c /10;
c %=10;
}
if (g>0) c[++c[0]]=g ...
- Wed Dec 17, 2003 4:23 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10544 - Numbering the Paths
- Replies: 14
- Views: 6365
10544 Why Wrong Answer!!!
:o
I think my code is right,but it got WA,please help me !3x!
I use dynamic to solve it,and assumed if there is only one letter,the number is zero.
#include<string.h>
#include<iostream.h>
int t,n,m,q;
char s[30],o[30],g[26][27];
long sum[26];
void get(int v)
{
int i;
if (sum[v]>0) return ...
I think my code is right,but it got WA,please help me !3x!
I use dynamic to solve it,and assumed if there is only one letter,the number is zero.
#include<string.h>
#include<iostream.h>
int t,n,m,q;
char s[30],o[30],g[26][27];
long sum[26];
void get(int v)
{
int i;
if (sum[v]>0) return ...