Search found 48 matches

by rhsumon
Fri Nov 14, 2008 6:56 pm
Forum: General
Topic: Other User Statistic
Replies: 0
Views: 2223

Other User Statistic

How can anyone see other's statistic in new site?
by rhsumon
Fri Nov 07, 2008 5:10 pm
Forum: Volume 115 (11500-11599)
Topic: 11545 - Avoiding Jungle in the Dark
Replies: 13
Views: 4563

Re: 11545 Avoiding Jungle in the Dark

thanks shamim vai.
I got it.......
by rhsumon
Fri Nov 07, 2008 6:38 am
Forum: Volume 115 (11500-11599)
Topic: 11545 - Avoiding Jungle in the Dark
Replies: 13
Views: 4563

Re: 11545 Avoiding Jungle in the Dark

Hello,
Here the problem says the person can take rest any time after he completed one rest session but again it says that one can rest exactly 8 hours... I can't understand
by rhsumon
Fri Aug 22, 2008 12:02 am
Forum: Volume 103 (10300-10399)
Topic: 10394 - Twin Primes
Replies: 101
Views: 32201

Re: 10394 - Twin Primes

would u plz someone look at my code
why it gives RTE............
here is my code:

Code: Select all

At Last AC in 1.4 sec
plz help someone
by rhsumon
Wed Aug 20, 2008 10:20 pm
Forum: Volume 101 (10100-10199)
Topic: 10179 - Irreducible Basic Fractions
Replies: 28
Views: 9692

Re: 10179 - Irreducible Basic Fractions

WA plz help first time TLE then WA where is the wrong #include<stdio.h> #include<math.h> #include<stdlib.h> #define P 100000 long prime[P]; long p[50000]; int phi[P+100]; void gen_prime(){ int i,j; prime[0] = prime[1] = 1; for(i=2; i<=(long)sqrt(P); i++){ if(prime[i]==0){ for(j=i*i; j<=P-1; j=j+i){ ...
by rhsumon
Wed Aug 20, 2008 4:18 pm
Forum: Algorithms
Topic: Big prime
Replies: 1
Views: 822

Big prime

Using Seive method it is possible to generate all primes between n=sqrt(2^31-1).
But if we need the next all prime upto 2^31-1. Then what should we do?

Plz someone clarify this algorithm with example.

Thanks
Sumon
by rhsumon
Mon Aug 18, 2008 9:17 am
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 26607

Re: 10139 - Factovisors

Why run time error I'll be mad for this problem I also tried by making big array size Here is my code: Now I changed code and now it is WA Plz somebody help me The code is: #include<stdio.h> #include<math.h> #include<stdlib.h> #define P 50000 long prime[P]; long p[10000],f[10000]; int efact=0; void ...
by rhsumon
Sun Aug 17, 2008 12:39 pm
Forum: Volume 100 (10000-10099)
Topic: 10061 - How many zero's and how many digits ?
Replies: 43
Views: 21325

Re: 10061 - How Many Zeros and How Many Digits?

Where is the problem i cannot find plz help some one here is my code: #include<stdio.h> #include<math.h> #include<stdlib.h> #define P 2005 #define M 1050000 long prime[P]; long p[500]; double f[500]; void gen_prime(){ int i,j; prime[0] = prime[1] = 1; for(i=2; i<=(long)sqrt(P); i++){ if(prime[i]==0)...
by rhsumon
Sat Aug 16, 2008 10:00 pm
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 17829

Re: 412 - WA (Can't find the big from posts before <- -a>)

Where i the problem here
I can't fix
Plz take a look

Code: Select all

Silly Mitake 
Anyway AC now
Plz help anyone
by rhsumon
Sat Aug 16, 2008 9:02 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 22194

Re: 406 - Prime Cuts

Thanks Ragib
Silly Mistake.
Anyway r u in CSE if then which Semester
Mail Me
rhsumon@gmail.com
Thanks Again
by rhsumon
Sat Aug 16, 2008 8:07 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 22194

Re: 406 - Prime Cuts

Hello programmars

I mean my code i correct but WA
Where is the problem
Plz Help me
Here is my code:

Code: Select all

AC ...........
by rhsumon
Wed Apr 02, 2008 7:58 pm
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 4908

Re: I am having real trouble with 10331 the Flyover construction

Thnkx but some problem........
But is that false.......... if i reform my code like that..

Code: Select all

Actually i've understood..........
What a stupid am i!!!!!!!!!!!!!!!!!!!!!!!!! :x 
Is there also print any trailing " "? I'm confused.............
Ok u r correct but i am confusing abt that
by rhsumon
Tue Apr 01, 2008 5:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 4908

Re: I am having real trouble with 10331 the Flyover construction

Presentation Error:::::::: Why PE
My output code is like,

Code: Select all

		for(i=1; i<=m; i++){
			if(count[i]==max){
				printf("%d",i);
				if(i<m) printf(" "); 
			}
		}
		printf("\n");
Is there any problem .............
plz give some adv.
by rhsumon
Thu Mar 06, 2008 10:35 pm
Forum: Volume 102 (10200-10299)
Topic: 10258 - Contest Scoreboard
Replies: 87
Views: 34413

Hello programmers I'm trying it for 3 hours but still wa Where is the problem Any one help me , Here is my code: #include<stdio.h> #include<stdlib.h> #include<string.h> int inc[105][105],cor[105][10]; struct contest{ int solve; int pen; int team; int sub; }; int cmp(const void *ia, const void *ib){ ...
by rhsumon
Thu Jan 17, 2008 9:53 pm
Forum: Volume 100 (10000-10099)
Topic: 10075 - Airlines
Replies: 9
Views: 4868

I worked according to ur suggetion
But i got for the case 2
Dhaka Hong kong
19652 km where the ans would be 19654

Plz describe ur idea brifly...... to understood us well................
plz i'm boaring .... now ... now i'm helpless,.......

Go to advanced search