## Search found 26 matches

- Sat Dec 22, 2007 4:48 pm
- Forum: Other words
- Topic: Communication System-pku 1018
- Replies:
**0** - Views:
**1894**

### Communication System-pku 1018

Hello all, I'm trying to solve this problem: http://acm.pku.edu.cn/JudgeOnline/problem?id=1018 This problem is here too: http://acm.tju.edu.cn/toj/showp1258.html but I got WA every time. I posted it here, because I have learned many things from this forum before, but I didn't see that websites' foru...

- Fri Nov 10, 2006 4:19 pm
- Forum: Volume 9 (900-999)
- Topic: 911 - Multinomial Coefficients
- Replies:
**15** - Views:
**6160**

- Fri Nov 10, 2006 1:18 pm
- Forum: Volume 9 (900-999)
- Topic: 911 - Multinomial Coefficients
- Replies:
**15** - Views:
**6160**

I need your help to find my mistake.I'm getting WA and realy don't know where is the bug.
Thanks in advance

Code: Select all

```
removed
```

- Fri Nov 10, 2006 1:13 pm
- Forum: Volume 9 (900-999)
- Topic: 967 - Circular
- Replies:
**23** - Views:
**12677**

- Thu Nov 09, 2006 10:59 pm
- Forum: Volume 9 (900-999)
- Topic: 967 - Circular
- Replies:
**23** - Views:
**12677**

could someone please help me and tell me what's wrong with this code?

I'm getting WA.It is an easy problem I think so.

I'm getting WA.It is an easy problem I think so.

Code: Select all

`removed`

- Sat Oct 28, 2006 11:08 am
- Forum: Volume 111 (11100-11199)
- Topic: 11136 - Hoax or what
- Replies:
**31** - Views:
**17507**

could somebody please tell me where is my mistake or give me I/O that my program fails.I'm getting Wa. #include<iostream.h> #include<fstream.h> void main(){ // ifstream cin("a.in"); long long dayno,sum,max1,max2,min1,min2,bill,I,K,n; cin>>dayno; while(dayno>0){ sum=0; max1=max2=0; min1=min2=1000001;...

- Thu Oct 19, 2006 8:08 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10622 - Perfect P-th Powers
- Replies:
**47** - Views:
**23682**

### WA_please help

I'm getting WA and don't undrestand where is my mistake.could someone please help me? my algorithm: 1)producing prime numbers up to the sqrt of MAX_int(our limit) 2)when reading an input produce all powers of its primefactors and store them 3)getting gcd between powers 4)(if n<0 and gcd%2==0 )gcd/=2...

- Sun Sep 24, 2006 10:10 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11096 - Nails
- Replies:
**28** - Views:
**14225**

- Sat Sep 23, 2006 9:41 am
- Forum: Volume 110 (11000-11099)
- Topic: 11096 - Nails
- Replies:
**28** - Views:
**14225**

### 11096 - Nails

I'm getting WA.Where is my mistake?Is this problem convex hull?
Please help.Thanks in advance.

Code: Select all

`removed`

- Fri Sep 22, 2006 10:20 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11099 - Next Same-Factored
- Replies:
**24** - Views:
**10497**

- Fri Sep 22, 2006 8:47 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11099 - Next Same-Factored
- Replies:
**24** - Views:
**10497**

I'm getting WA.Where is my mistake?Please help.
Thanks in advance

Code: Select all

`removed`

- Thu Sep 21, 2006 8:52 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11099 - Next Same-Factored
- Replies:
**24** - Views:
**10497**

### 11099 - Next Same-Factored

I need a hint to solve this problem whitout getting tle. I used these 2 methds but both of them get tle. 1)produce and keep all of the prime factors of all numbers up to 2000000(like Eratosten algorithm) 2)produce and keep all of the prime factors of all numbers up to 1000000(like Eratosten algorith...

- Tue Sep 12, 2006 12:12 am
- Forum: Volume 1 (100-199)
- Topic: 147 - Dollars
- Replies:
**233** - Views:
**20260**

I'm getting RE (invalid memory refrence): #include<iostream> #include<stdio.h> using namespace std; int a[6001][8],sum[6001][8],value[8]={1,2,4,10,20,40,100,200}; void main(){ int i,j,x,ans,dolor; for(i=0;i<6001;i++) sum[i][0]=a[i][0]=1; for(i=0;i<6001;i++) for(j=1;j<8;j++){ if(i<value[j]){ a[i][j]=...

- Fri Aug 25, 2006 4:21 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10296 - Jogging Trails
- Replies:
**7** - Views:
**5366**

I'm getting TLE on this problem.please help?Is my algorithm rigth? #include<iostream.h> int n,v,e,shortest[20][20],G[20][20],d[20],sum,minsum,A[20],degree[20]; bool sw[20],put[20],chosen[20]; void shortpath(){ int a,cur,i,no,min; for(a=1;a<=v;a++){ if(degree[a]%2==0)continue; for(i=1;i<=v;i++){ sw[i...

- Wed Aug 23, 2006 10:25 am
- Forum: Volume 6 (600-699)
- Topic: 694 - The Collatz Sequence
- Replies:
**46** - Views:
**15712**

I'm getting WA.Could anyone tell me why? #include<iostream.h> //#include<fstream.h> void main(){ //ifstream cin("694.in"); long long A,L,terms,Case,mainA; cin>>A>>L; Case=0; mainA=A; while(A>0){ Case++; terms=1; while(true){ if(A==1)break; if(A%2==0){A/=2;terms++;} else{ if(A>((L-1)/3))break; else {...