equal
deleted
inserted
replaced
64 for(int i=0;i<5;i++) { |
64 for(int i=0;i<5;i++) { |
65 Primes P; |
65 Primes P; |
66 for(int i=0;i<dim*(1<<dim);i++) P(); |
66 for(int i=0;i<dim*(1<<dim);i++) P(); |
67 |
67 |
68 // for(EdgeIt e(G);G.valid(e);G.next(e)) map[e]=P(); |
68 // for(EdgeIt e(G);G.valid(e);G.next(e)) map[e]=P(); |
69 for(int i=0;i<dim*(1<<dim);i++) |
69 Edge te; |
|
70 for(int i=0;i<dim*(1<<dim);i++) { |
|
71 te.setToId(((long long int)(i)*93505)%(dim*(1<<dim))); |
70 // map[Edge(((long long int)(i)*2987)%(dim*(1<<dim)))]=P(); |
72 // map[Edge(((long long int)(i)*2987)%(dim*(1<<dim)))]=P(); |
71 map[Edge(((long long int)(i)*93505)%(dim*(1<<dim)))]=P(); |
73 map[te]=P(); |
72 |
74 } |
|
75 |
73 // for(int i=0;i<(1<<dim);i++) { |
76 // for(int i=0;i<(1<<dim);i++) { |
74 // int mul= (1<<(numOfZeros(i,dim)/4)); |
77 // int mul= (1<<(numOfZeros(i,dim)/4)); |
75 // for(OutEdgeIt e(G,nodes[i]);G.valid(e);G.next(e)) |
78 // for(OutEdgeIt e(G,nodes[i]);G.valid(e);G.next(e)) |
76 // map[e]*=mul; |
79 // map[e]*=mul; |
77 // } |
80 // } |