I face same problem. I have remove all cookies from Firefox. Now I not get the error message but
still can not access the site. What should I do ???????????????
Search found 20 matches
- Thu Oct 29, 2009 4:35 am
- Forum: General
- Topic: uva.onlinejudge.org down again
- Replies: 7
- Views: 9389
- Sat Oct 20, 2007 5:49 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10365 - Blocks
- Replies: 7
- Views: 5220
- Thu Oct 18, 2007 10:29 am
- Forum: Volume 103 (10300-10399)
- Topic: 10365 - Blocks
- Replies: 7
- Views: 5220
- Thu Sep 06, 2007 10:12 am
- Forum: Volume 110 (11000-11099)
- Topic: 11062 - Andy's Second Dictionary
- Replies: 38
- Views: 25023
Re: wa
thanx ...
.. i do as u said & ac now

- Wed Sep 05, 2007 6:30 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11062 - Andy's Second Dictionary
- Replies: 38
- Views: 25023
- Mon Sep 03, 2007 6:47 am
- Forum: Volume 110 (11000-11099)
- Topic: 11000 - Bee
- Replies: 25
- Views: 16970
Re: :( still wa
thanks ac now !!!!!! im realy a stupid[/quote]
- Sun Sep 02, 2007 12:42 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11000 - Bee
- Replies: 25
- Views: 16970
:( still wa
I don't know ..Here is my codePS: Is there any problem with posting full code?
ac
sorry 4 posting my [/code]
- Fri Aug 31, 2007 4:14 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 51693
:)
thanks
....... ac now

- Thu Aug 30, 2007 6:31 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 51693
wa :(
hi .........i get wa on this prob.. . i use O(n) algo..
can any one help me to find the mistake
sorry 4 submitting code
deleted

can any one help me to find the mistake
sorry 4 submitting code
deleted

- Sun Aug 26, 2007 8:40 am
- Forum: Volume 110 (11000-11099)
- Topic: 11069 - A Graph Problem
- Replies: 20
- Views: 10955
- Sun Aug 26, 2007 7:56 am
- Forum: Volume 110 (11000-11099)
- Topic: 11000 - Bee
- Replies: 25
- Views: 16970
wa in 11000
its an easy prob ... but i got wa .....
i just calculate the ( n th fibonacci -1 ) , (n+1 th fibonacci - 1)
here is my function ...
long long a=1,b=1, male=0,total=0;
for(long long i=1 ; i<=n ; i++)
{
male = a+b-1;
long long t =a;
a = b;
b = b+t;
total = a+b-1;
}
is my fibonacci ...
i just calculate the ( n th fibonacci -1 ) , (n+1 th fibonacci - 1)
here is my function ...
long long a=1,b=1, male=0,total=0;
for(long long i=1 ; i<=n ; i++)
{
male = a+b-1;
long long t =a;
a = b;
b = b+t;
total = a+b-1;
}
is my fibonacci ...
- Fri Aug 24, 2007 3:51 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11069 - A Graph Problem
- Replies: 20
- Views: 10955
- Fri Aug 24, 2007 9:55 am
- Forum: Volume 110 (11000-11099)
- Topic: 11069 - A Graph Problem
- Replies: 20
- Views: 10955
11069 :(
what are the outputs for following inputs
input
9
10
11
14
15
16
17
18
thanx ..in adv...
input
9
10
11
14
15
16
17
18
thanx ..in adv...
- Thu Aug 09, 2007 4:36 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10394 - Twin Primes
- Replies: 101
- Views: 48522
run time error
my this code gets run time error :( .. but why?
#include <stdio.h>
#include<math.h>
long int ar[100005],t,t1 ;
char arr[200000005];
void get_prime(long int n)
{
long int x ;
//char arr[20000005];
long int k=1,l;
for (x =1 ; x <= n ; x++)
{
arr[x]='0';
}
while( k <= sqrt(n ...
#include <stdio.h>
#include<math.h>
long int ar[100005],t,t1 ;
char arr[200000005];
void get_prime(long int n)
{
long int x ;
//char arr[20000005];
long int k=1,l;
for (x =1 ; x <= n ; x++)
{
arr[x]='0';
}
while( k <= sqrt(n ...
- Fri May 04, 2007 5:44 pm
- Forum: Volume 4 (400-499)
- Topic: 478 - Points in Figures: Rectangles, Circles, Triangles
- Replies: 44
- Views: 16084