Search found 18 matches

by tanmoy
Mon Jan 17, 2011 8:38 pm
Forum: Volume 113 (11300-11399)
Topic: 11374 - Airport Express
Replies: 15
Views: 6575

Re: 11374 - Airport Express

Need some critical cases........ :D
by tanmoy
Tue Jan 11, 2011 9:20 pm
Forum: Volume 119 (11900-11999)
Topic: 11902 - Dominator
Replies: 20
Views: 9141

Re: 11902 - dominator

4 5 1 0 0 0 1 1 0 0 0 1 1 0 0 0 1 0 0 0 0 0 1 1 0 0 1 Case 1: +---------+ |Y|Y|N|N|Y| +---------+ |N|Y|N|N|N| +---------+ |N|N|N|N|N| +---------+ |N|N|N|N|N| +---------+ |N|Y|N|N|Y| +---------+ 10 1 0 0 0 0 1 0 1 0 1 1 0 0 1 0 0 1 1 0 1 0 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 1 1 0 0 ...
by tanmoy
Mon Jan 10, 2011 1:39 pm
Forum: Volume 119 (11900-11999)
Topic: 11902 - Dominator
Replies: 20
Views: 9141

11902 - Dominator

Thanks i get it now.....AC
by tanmoy
Wed Nov 10, 2010 12:04 pm
Forum: Volume 117 (11700-11799)
Topic: 11795 - Mega Man's Mission
Replies: 6
Views: 3183

Re: 11795 - Mega Man's Mission

Can any one give me some critical cases , i'm getting WA
by tanmoy
Mon May 03, 2010 10:02 am
Forum: Volume 117 (11700-11799)
Topic: 11736 - Debugging RAM
Replies: 5
Views: 2318

Re: debugging ram

heeeeeeeyyyyyy taman thanks man i really forgot that.thanks a lot :)
by tanmoy
Sun May 02, 2010 2:54 pm
Forum: Volume 117 (11700-11799)
Topic: 11736 - Debugging RAM
Replies: 5
Views: 2318

Re: debugging ram

can anyone plz help me ?? i'm getting wrong ans :( #pragma warning ( disable : 4786 ) #include<stdio.h> #include<math.h> #include<string.h> #include<stdlib.h> #include<iostream> #include<map> #include<vector> #include<string> using namespace std; #define _pf printf #define _sc scanf int main(){ char...
by tanmoy
Mon Jul 20, 2009 9:22 pm
Forum: Volume 115 (11500-11599)
Topic: 11537 - Secret Problemsetters' Union
Replies: 4
Views: 2892

Re: 11537 - Secret Problemsetters' Union

i'm getting runtime error for this problem. :( if you guys kindly check my code and advice me how to solve this problem then it will really great for me. #pragma warning (disable : 4786 ) #include<string.h> #include<stdlib.h> #include<stdio.h> #include<iostream> #include<algorithm> #include<vector> ...
by tanmoy
Sat Apr 04, 2009 5:53 pm
Forum: Volume 115 (11500-11599)
Topic: 11518 - Dominos 2
Replies: 24
Views: 8602

Re: 11518 - Dominos 2

anyone help plz i'm getting WA for this problem. #include<stdio.h> #include<string.h> #include<vector> #include<list> using namespace std; #define _pf printf #define _sc scanf #define max 10002 int n,m,l,C; list<int> L[max]; bool map[max]; bool check[max]; void dfs(int i){ int r; C++; map[i]=false; ...
by tanmoy
Sun Jan 25, 2009 8:57 pm
Forum: Volume 7 (700-799)
Topic: 762 - We Ship Cheap
Replies: 51
Views: 20105

Re: 762 - We Ship Cheap

plz someone help me i got many WA :( here is my code #pragma warning ( disable : 4786 ) #include<stdio.h> #include<vector> #include<queue> #include<string> #include<vector> #include<iostream> using namespace std; #define max 5000 vector<string> K(100000); bool adj[max][max],T[max]; int node,D[max],H...
by tanmoy
Fri Jan 23, 2009 10:11 pm
Forum: Volume 112 (11200-11299)
Topic: 11283 - Playing Boggle
Replies: 19
Views: 8171

Re: 11283 - Playing Boggle

i use dfs but getting tle plz help #include<stdio.h> #include<string.h> #include<memory.h> #define MAX 100 char GAME[4][4]; bool MAP[4][4]; char c[134]; int reach[8][2]={{+0,+1},{+0,-1},{-1,+0},{-1,+1},{-1,-1},{+1,-1},{+1,+0},{+1,+1}},R,C,l,count=0; void dfs(int i,int j,int depth){ if(GAME[i][j]!=c[...
by tanmoy
Fri Jan 09, 2009 9:07 pm
Forum: Volume 115 (11500-11599)
Topic: 11567 - Moliu Number Generator
Replies: 13
Views: 4015

Re: 11567 - Moliu Number Generator

i'm getting TLE.what's the problem and i can't think any other idea #include<stdio.h> int c=0, d=0; bool f1,f2; int find(int s){ int f=s; c=0,d=0; f1=false,f2=false; s++,c++; while(s%2==0){ s/=2; if(s==1){c++;f1=true;} c++; } f--,d++; while(f%2==0){ f/=2; if(f==1){d++;f2=true;} d++; } if(f1==true&&f...
by tanmoy
Tue Jan 06, 2009 3:09 am
Forum: Volume 113 (11300-11399)
Topic: 11377 - Airport Setup
Replies: 24
Views: 11825

Re: 11377 - Airport Setup

can any one help me about this problem plz #include<stdio.h> #include<memory.h> #include<iostream> #include<queue> using namespace std; #define MAX 2002 int adj[MAX][MAX]; int P[MAX+3],O[MAX]; bool T[MAX]; int n,s,d,counter,v=0; void BFS (void){ int x,i,c=0; bool flag=false; fill(P,P+n+2,0); queue<i...
by tanmoy
Mon Aug 04, 2008 10:09 am
Forum: Volume 5 (500-599)
Topic: 516 - Prime Land
Replies: 23
Views: 6514

Re: 516

thanks a lot .
at last i get ac :) :)
thanks again for your good advice :)
by tanmoy
Sun Aug 03, 2008 9:56 pm
Forum: Volume 114 (11400-11499)
Topic: 11476 - Factorizing Large Integers
Replies: 17
Views: 8178

11476 - Factorizing Large Integers

it is getting TLE . is there any better idea to solve this problem ? i wanna learn some better approach. plz healp [#include<stdio.h> #include<math.h> #include<vector> using namespace std; int r=0,e; void prime_factors(long long a) { e=0; int w=0; int s=0; if(a%2==0) { w=1; s=1; while(((a%2)==0)) { ...
by tanmoy
Mon Jul 28, 2008 11:34 pm
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 61024

Re: 10200 - Prime Time

it is WA.SOME ONE HELP ME PLZ. HERE IS MY CODE: #include<stdio.h> #include<math.h> #include<memory.h> long store[10000+12]; void is_prime(void) { long result,k,i,j; for(i=0;i<=10000;i++) { result=i*i+i+41; if(result%2!=0) { j=(long)sqrt(result); for(k=3;k<=j;k+=2) { if(result%k==0) break; } if(k>j) ...

Go to advanced search