Solved problems 84 and 250

dionyziz · Apr 22, 2012 · b9425a2 · b9425a2
1 parent 2dbe056
commit b9425a2
Show file tree

Hide file tree

Showing 2 changed files with 87 additions and 0 deletions.
diff --git a/problem-250/250.py b/problem-250/250.py
@@ -0,0 +1,5 @@
+W = [ [ 1 ] + [ 0 ] * 249, [ 0 ] * 250 ]
+for i in xrange( 1, 250250 + 1 ):
+    for q in xrange( 0, 250 ):
+        W[ i % 2 ][ q ] = ( W[ ( i + 1 ) % 2 ][ q ] + W[ ( i + 1 ) % 2 ][ ( q - pow( i, i, 250 ) ) % 250 ] ) % 10000000000000000
+print W[ 0 ][ 0 ]
diff --git a/problem-84/84.cpp b/problem-84/84.cpp
@@ -0,0 +1,82 @@
+#include <cstdlib>
+#include <cstdio>
+#include <ctime>
+
+using namespace std;
+
+const int DICE_SIDES = 4;
+const int MONTE_CARLO = 100000000;
+
+int probabilities[ 40 ];
+
+enum monopoly {
+    GO   = 0,  CC1 = 2,  R1 = 5,  CH1 = 7,
+    JAIL = 10, C1  = 11, U1 = 12, R2  = 15, CC2 = 17,
+    CH2  = 22, E3  = 24, R3 = 25, U2  = 28,
+    G2J  = 30, CC3 = 33, R4 = 35, CH3 = 36, H2  = 39
+};
+
+int play( int current, int a, int b ) {
+    static int cc = -1, ch = -1;
+
+    current = ( current + a + b ) % 40;
+    switch ( current ) {
+        case G2J: return JAIL;
+        case CC1: case CC2: case CC3:
+            cc = ( cc + 1 ) % 16;
+            switch ( cc ) {
+                case 0: return GO;
+                case 1: return JAIL;
+            }
+            break;
+        case CH1: case CH2: case CH3:
+            ch = ( ch + 1 ) % 16;
+            switch ( ch ) {
+                case 0: return GO;
+                case 1: return JAIL;
+                case 2: return C1;
+                case 3: return E3;
+                case 4: return H2;
+                case 5: return R1;
+                case 6: case 7:
+                    switch ( current ) {
+                        case CH1: return R2;
+                        case CH2: return R3;
+                        case CH3: return R1;
+                    }
+                    break;
+                case 8:
+                    switch ( current ) {
+                        case CH1: case CH3: return U1;
+                        case CH2:           return U2;
+                    }
+                    break;
+                case 9:
+                    return play( current - 3, 0, 0 );
+            }
+            break;
+    }
+    return current;
+}
+
+int main() {
+    int current = GO, maxelement;
+
+    srand( time( NULL ) );
+    for ( int plays = 0; plays < MONTE_CARLO; ++plays ) {
+        current = play( current, 1 + rand() % DICE_SIDES, 1 + rand() % DICE_SIDES );
+        ++probabilities[ current ];
+    }
+    for ( int j = 0; j < 3; ++j ) {
+        for ( int i = 0, m = 0; i < 40; ++i ) {
+            if ( m < probabilities[ i ] ) {
+                m = probabilities[ i ];
+                maxelement = i;
+            }
+        }
+        printf( "P( %i ) = %2.5f\n", maxelement, ( float )probabilities[ maxelement ] / plays );
+        probabilities[ maxelement ] = 0;
+    }
+
+    return 0;
+}