My memory-tight sieve looks like this:
#define MAXSIEVE 100000000 // All prime numbers up to this
#define MAXSIEVEHALF (MAXSIEVE/2)
#define MAXSQRT 5000 // sqrt(MAXSIEVE)/2
char a[MAXSIEVE/16+2];
#define isprime(n) (a[(n)>>4]&(1<<(((n)>>1)&7))) // Works when n is odd
int i,j;
memset(a,255 ...
Search found 3 matches
- Fri Mar 05, 2010 9:23 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10394 - Twin Primes
- Replies: 101
- Views: 48883
- Sun Feb 21, 2010 4:08 pm
- Forum: Volume 3 (300-399)
- Topic: 332 - Rational Numbers from Repeating Fractions
- Replies: 83
- Views: 34525
Re: 332 why RTE please help me
after 9 RTE i,ve got accetped;
i think ,when the input is 3 0.0000 then calculating GCD code terminates;
so it causes RTE..................................
i think ,when the input is 3 0.0000 then calculating GCD code terminates;
so it causes RTE..................................
- Sat Dec 26, 2009 4:40 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11650 - Mirror Clock
- Replies: 15
- Views: 6760
Re: 11650-why i get WA
meghla:ju-cse
my code just fullfill ar the set of ans; still i am getting WA;
can u give me some set why my code is not working?
my sample input and output is;
12
12:0
12:00
12:30
11:30
12:60
11:00
1:59
10:01
2:00
10:00
08:45
03:15
8:45
03:15
11:00
01:00
04:35
07:25
4:35
07:25
7:56
04:04
can u ...
my code just fullfill ar the set of ans; still i am getting WA;
can u give me some set why my code is not working?
my sample input and output is;
12
12:0
12:00
12:30
11:30
12:60
11:00
1:59
10:01
2:00
10:00
08:45
03:15
8:45
03:15
11:00
01:00
04:35
07:25
4:35
07:25
7:56
04:04
can u ...