Search found 96 matches

by uvasarker
Sat Jun 02, 2012 7:38 pm
Forum: Volume 120 (12000-12099)
Topic: 12085 - Mobile Casanova
Replies: 15
Views: 3209

12085 Mobile Casanova -- Why WA?

Anyone help me please. I am getting WA in 12085 Mobile Casanova... Here is my code: #include <cstdio> int main() { unsigned long long n, prm[100010], tmp[100010],cas=0; //freopen("in.txt","r",stdin); while(scanf("%llu",&n)==1 & n!=0) { if(n==0) break; for(unsigned long long i=0 ; i<n ; i++) { scanf(...
by uvasarker
Sun Mar 25, 2012 7:51 am
Forum: Bugs and suggestions
Topic: Help me. I can not access my uva.onlinejudge.org account
Replies: 1
Views: 2006

Help me. I can not access my uva.onlinejudge.org account

Help me. I can not access my uva.onlinejudge.org account. My uva user name is: uvasarker Mail id is: shahadat_aub@yahoo.com I have lost my uva OJ password or it hacked. And also my "shahadat_aub@yahoo.com" mail id have been being hacked. Still I can not recover my mail. As a result, I can not access...
by uvasarker
Wed Feb 29, 2012 6:39 pm
Forum: Bugs and suggestions
Topic: Can I change Uva online judge id?
Replies: 1
Views: 2226

Re: Can I change Uva online judge id?

Please help me. I want to change my judge id on uva.onlinejudge.org. Can I do this?
by uvasarker
Wed Feb 29, 2012 11:38 am
Forum: Bugs and suggestions
Topic: Can I change Uva online judge id?
Replies: 1
Views: 2226

Can I change Uva online judge id?

Anyone please, inform me that can I change my judge id of my uva.onlinejudge.org accounts.
by uvasarker
Mon Feb 27, 2012 2:07 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31227

Re: 10533 Digit Primes (TLE) why? please help me, please

Thanks a lot boss I got it AC
by uvasarker
Sun Feb 26, 2012 7:55 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31227

Re: 10533 Digit Primes (TLE) why? please help me, please

Hi boss,
Now, it's WA. Please, help me. Give me some critical test cases. Here is my code:

Code: Select all

/* removed */
by uvasarker
Tue Feb 21, 2012 9:19 pm
Forum: Volume 110 (11000-11099)
Topic: 11068 - An Easy Task
Replies: 16
Views: 7131

Re: 11068 - An Easy Task

Boss I change the full code. and try all test cases. but still WA............ :cry:

Code: Select all

/* Finally I got it AC. Thanks a lot Boss. */
Stupid problem.
by uvasarker
Sat Feb 18, 2012 5:58 am
Forum: Volume 110 (11000-11099)
Topic: 11068 - An Easy Task
Replies: 16
Views: 7131

Re: 11068 - An Easy Task

Hi Boss I am frustrated.............Still WA. Here is my code: #include<cstdio> #include<sstream> #include<cstdlib> #include<cctype> #include<cmath> #include<algorithm> #include<set> #include<queue> #include<stack> #include<list> #include<iostream> #include<fstream> #include<numeric> #include<string...
by uvasarker
Sat Feb 18, 2012 5:54 am
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9961

Re: 11850-Alaska

Hi
Boss,
I updated more. But
Still WA. Please help me. Here is my code:

Code: Select all

/* Removed */ AC
by uvasarker
Fri Feb 17, 2012 6:48 am
Forum: Volume 9 (900-999)
Topic: 914 - Jumping Champion
Replies: 37
Views: 17275

Re: 914 - Jumping Champion

Please, help me anyone. I am getting TLE. WHY? Here is my code: #include <cstdio> #include <cmath> bool sieve[10001011]={0}; int main() { unsigned long T, i, j; sieve[0]=1; sieve[1]=1; // 0 == prime & 1 == non-prime for(i=3 ; i<=1000000 ; i+=2) { sieve[i+1]=1; if(sieve[i]==0 && i<=1000) { for(j=i*i ...
by uvasarker
Fri Feb 17, 2012 5:53 am
Forum: Volume 119 (11900-11999)
Topic: 11991 - Easy Problem from Rujia Liu?
Replies: 32
Views: 8789

Re: 11991 - Easy Problem from Rujia Liu?

Anyone will help me please. I am getting TLE. Please help me so that I can get rid of this problem. Here is my code: #include <cstdio> #include <cmath> int main() { unsigned long n,m, in[1000000]; while(scanf("%lu %lu",&n,&m)==2) { for(unsigned long i=0 ; i<n ; i++) scanf("%lu",&in[i]); unsigned lon...
by uvasarker
Wed Feb 15, 2012 12:32 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33052

Re: 530 Binomial Showdown Time limit exceeded

Hi
Boss
Now, I use Pascale-Triangle formula to solve this problem. But, I am getting Runtime error. Please, help me.
Here is my code:

Code: Select all

Finally, I got it AC /* Removed */
by uvasarker
Tue Feb 14, 2012 1:47 pm
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9961

Re: 11850-Alaska

Hi boss, I am upset still WA. please help me: Here is my code: #include <cstdio> int main() { long n; while(scanf("%ld",&n)==1) { if(n==0) break; long station[100000],I,J,fag=1; for(I=0 ; I<n ; I++) { scanf("%ld",&station[I]); } int dis=0; for(J=0 ; J<n ; J++) { dis=station[J+1]-station[J]; if(dis>2...
by uvasarker
Tue Feb 14, 2012 1:23 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33052

Re: 530 Binomial Showdown Time limit exceeded

Hi boss, Still WA... #include <cstdio> #include <cctype> #include <cmath> #include <iostream> using namespace std; int main() { unsigned long long n, m; while(scanf("%llu %llu",&n,&m)==2) { unsigned long long t=0, t_fact=1, m_fact=1, n_fact=1, c, i, j; if(n==0 && m==0) break; if(m==1) cout<<n<<endl;...
by uvasarker
Sun Feb 12, 2012 5:02 am
Forum: Volume 110 (11000-11099)
Topic: 11068 - An Easy Task
Replies: 16
Views: 7131

Re: 11068 - An Easy Task

I check previous posted of this topic and try all test cases and my code gives correct answer, but when I submit my code to the judge they reply to verdict WA WA WA. Why? Please, give me some information on my code or critical input-output. Please............... #include<cstdio> #include<sstream> #i...

Go to advanced search