| | | believe: Flat () | | |
I experience the code for this one is quite large... but anyway maybe someone can surprise my bug(My solution is the simulation one) :
#include <iostream>#include <algorithm>#include <sstream>#include <string>#include <vector>#include <stack>#consider <map>#include <set>#include <list>#include <deque>#consider <queue>#include <numeric>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <ext/hash_map>#include <ext/hash_set>#define F(i,a,b)
(__typeof__((v) begin()) it=(v) begin();it!=(v) end();++it)#define all(x) (x) begin(),(x) end()
MarbleMachine::maxMarbles(vector <string> layout vector <string> actions.
a[i][j]|=(1<<(i*n+j));a2[i][j]|=(1<<(i*n+j));
((a[i][j]>>k)&1)trulo2[i][j]+=trulo[k/n][k%n];F(i,0,m)F(j,0,n)trulo[i][j]=trulo2[i][j];
Hehe...... it's a bunco create of "pastrulo" which means someone who uses drugs. It was my call when I was younger,of cover with no cerebrate at all :D
Found the mistake. Changing unsigned long desire into bitset for the masks worked. Is it wrong to acces the most significant bit in an unsigned integer?(namely 31 bit in an unsigned int. 63 in a unsigned long long)
| | | | | |
Forex Groups - Tips on Trading
Related article:
http://forums.topcoder.com/?module=Message&messageID=890615
comments | Add comment | Report as Spam
|
