## Search found 53 matches

Mon Feb 21, 2005 10:06 am
Forum: Volume 3 (300-399)
Topic: 301 - Transportation
Replies: 13
Views: 4912

### 301 - Transportation

i don't know how to solve this problem.could somebody give me some idea?thank you very much!!
Mon Jan 31, 2005 10:17 am
Forum: Volume 5 (500-599)
Topic: 538 - Balancing Bank Accounts
Replies: 18
Views: 8279

i don't know why i got WA. could somebody give me sum special cases,thank you very much! #include <iostream> using namespace std; #include <cstring> typedef struct { char name1[100]; char name2[100]; int mon; }output; int main() { output out[50]; int o; int n,t; char name[50][100]; char cname[50][10...
Mon Jan 24, 2005 7:25 am
Forum: Volume 3 (300-399)
Topic: 341 - Non-Stop Travel
Replies: 38
Views: 11836

### 341 Non-Stop Travel

Hi,i used the "Dijkstra" to solve this problem,but got WA.i don't know why i was wrong,can somebody give me some special case??thank you . #include <iostream> using namespace std; #include <cstdio> #include <cstring> #define MAXV 100 #define MAXDEGREE 100 #define MAXINT 99999 int parent[MAXV]; int d...
Sat Nov 20, 2004 4:14 am
Forum: Volume 107 (10700-10799)
Topic: 10761 - Broken Keyboard
Replies: 31
Views: 11983

i have passed any samples,why i always got WA? [cpp] #include <iostream> using namespace std; #include <cstdio> #include <cstring> int main() { bool key[26],key2[26]; bool f; char brokenkey[26]; char line[100]; int i; int len; int c=1; int num; int temp; cout<<"+----------+----------------+---------...
Thu Oct 28, 2004 6:06 am
Forum: Volume 105 (10500-10599)
Topic: 10515 - Powers Et Al.
Replies: 124
Views: 29889

this is my code,thx; [cpp] #include <iostream.h> #include <string.h> #include <stdio.h> #include <cmath> int main() { char a[110],b[110]; int m,n; int len; while(cin>>a>>b) { if(!strcmp(a,"0")&&!strcmp(b,"0")) break; m=n=0; len=strlen(a); if(len==1) m=(int(a[len-1])-48); else m=(int(a[len-2])-48)*10...
Sun Oct 24, 2004 2:01 pm
Forum: Volume 5 (500-599)
Topic: 535 - Globetrotter
Replies: 20
Views: 6877

### 535 help,i am so confused.

i don't know why i always got WA.please help me ,thank you ! [cpp] #include <iostream> using namespace std; #include <cstring> #include <cmath> #include <cstdio> double r=6378.0; double spherical_distance(double p_lat,double p_long,double q_lat,double q_long) { return acos( sin(p_lat) * sin(q_lat) +...
Sun Oct 17, 2004 10:38 am
Forum: Volume 103 (10300-10399)
Topic: 10393 - The One-Handed Typist
Replies: 40
Views: 11036

### 10393 always WA

i don't know why! [cpp] #include <iostream> using namespace std; #include <cstring> #include <cstdio> int main() { int ff,n; int x; bool f[200]; int i,j; int len; int count; int num; char word[60]; char w[1010][60]; char output[1010][60]; while(cin>>ff>>n) { for(i=0;i<200;i++) { f =true; } while(ff-...
Mon Oct 11, 2004 2:58 pm
Forum: Volume 106 (10600-10699)
Topic: 10650 - Determinate Prime
Replies: 67
Views: 24776

### 10650 help

why i always got WA?? :-? [cpp] #include <iostream> using namespace std; bool b[1000000]={0}; void prime() { int i,j; b[1]=1; for(i=1;i<1000;i++) if (b ==0) for(j=2;j<=1000000/i;j++) b[i*j]=1; } int main() { int i,j,k,l; int p[3500]; int pp[200][10]; int nump[200]; int c; int max,min; int t; bool f;...
Mon Oct 11, 2004 1:31 pm
Forum: Volume 106 (10600-10699)
Topic: 10633 - Rare Easy Problem
Replies: 37
Views: 18863
thank you very much,i got ac now
Tue Oct 05, 2004 4:50 am
Forum: Volume 102 (10200-10299)
Topic: 10229 - Modular Fibonacci
Replies: 53
Views: 17215
thank you very much!
i got AC used unsigned long long.
Tue Oct 05, 2004 4:44 am
Forum: Volume 106 (10600-10699)
Topic: 10633 - Rare Easy Problem
Replies: 37
Views: 18863

### 10633 help!

hi,i used range from -10 to +10 ,but got TLE,i am so confused,why??
[cpp]
AC now
[/cpp]
Fri Oct 01, 2004 9:13 am
Forum: Volume 3 (300-399)
Topic: 332 - Rational Numbers from Repeating Fractions
Replies: 83
Views: 20316

### 332 WA

i don't know why i always get WA,can somebody help me ?thanks; [cpp] #include <iostream.h> #include <math.h> #include <cstdio> #include <cstring> int cas=1; int gcd(int a,int b) { if (a%b==0) return b; else return gcd(b,a%b); } int main() { char c[100]; int k,j; int len; double x; double r; int p,q;...
Fri Oct 01, 2004 7:37 am
Forum: Volume 102 (10200-10299)
Topic: 10229 - Modular Fibonacci
Replies: 53
Views: 17215

### 10229 help!

[cpp]
get AC now!
[/cpp]
Sat Sep 18, 2004 3:46 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31985
thank you very much!
i got AC on your opinion,thanx!!
Sun Sep 05, 2004 2:47 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31985