Thank you
accepted
Search found 10 matches
- Mon Jan 14, 2013 11:16 am
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 39821
- Mon Jan 14, 2013 11:14 am
- Forum: Volume 2 (200-299)
- Topic: 280 - Vertex
- Replies: 95
- Views: 24838
Re: 280 - Vertex
I change my code to this but still WA #include <iostream> #include <math.h> #include <string> #include <string.h> #include <stdio.h> using namespace std ; int mat[101][101] , q[101] ; bool mark[101] ; int f = 0 ; void dfs(int u,int b) { if( f ) mark[u] = true; int v ; for(v = 0; v < b ; v ++) if( ma...
- Mon Jan 14, 2013 11:04 am
- Forum: Volume 2 (200-299)
- Topic: 280 - Vertex
- Replies: 95
- Views: 24838
Re: 280 - Vertex
thanx for your help
can help me more

can help me more

- Sun Jan 13, 2013 8:13 pm
- Forum: Volume 2 (200-299)
- Topic: 280 - Vertex
- Replies: 95
- Views: 24838
280 - Vertex
why I getting WA #include <iostream> #include <math.h> #include <string> #include <string.h> #include <stdio.h> using namespace std ; int mat[101][101] , q[101] ; bool mark[101] ; int f = 0 ; void dfs(int u,int b) { if( f ) mark[u] = true; int v ; for(v = 0; v < b ; v ++) if( mark[v] == false &&...
- Sun Jan 13, 2013 4:07 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 39821
Re: 11059 - Maximum Product
Code: Select all
remove after ac
- Fri Jan 11, 2013 11:17 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 39821
Re: 11059 - Maximum Product
what's your mean ?
( for that test case my program's output is 4 )
( for that test case my program's output is 4 )
- Thu Jan 10, 2013 12:04 am
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 39821
11059 - Maximum Product
hi Why I getting WA #include <iostream> #include <math.h> #include <string> #include <string.h> #include <stdio.h> using namespace std ; long long f( int m[18] , int n ) { long long i , j, t , s = 1 , mx = 0 ; for ( i = 2 ; i < 262144 ; i++ ) { t = 0 ; s = 1 ; for( j = 17 ; j >= 0 ; j-- ) { t = ( i ...
- Fri Jun 08, 2012 2:36 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10189 - Minesweeper
- Replies: 418
- Views: 80876
Re: 10189 Wrong answer
accepted
thank you very much
thank you very much

- Thu Jun 07, 2012 5:22 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10189 - Minesweeper
- Replies: 418
- Views: 80876
10189 Wrong answer
this is my code for 10189 I don't know why wrong answer!!! Help me. #include <iostream> #include <string.h> using namespace std; char ch[101][101]; int mat[101][101] , dir[8][2] = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,-1},{-1,1}} , n , m ; void f() { memset( mat , 0 , sizeof( mat ) ); int i , ...
- Tue Jun 05, 2012 9:41 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10189 - Minesweeper
- Replies: 418
- Views: 80876
why WA?
my code is: #include <iostream> #include <string.h> using namespace std; char ch[101][101]; int mat[101][101] , dir[8][2] = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,-1},{-1,1}} , n , m ; void f() { memset( mat , 0 , sizeof( mat ) ); int i , j , k , r , s; for( i = 0 ; i < n ; i ++ ) for( j = 0 ; ...