template skiplist

Author: openinx

poj/volume-20/2918.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <stdio.h>
+
+using namespace std;
+
+char b[9][10];
+
+bool check(int x, int y){
+     int i, j ; 
+     for(i = 0 ; i < 9 ; ++ i){
+         if(i != y && b[x][i] == b[x][y] ) return false;
+         if(i != x && b[i][y] == b[x][y] ) return false;
+     }
+     for(i = 0 ; i < 3 ; ++ i){
+         for(j = 0 ; j < 3 ; ++ j){
+             int si = i + x / 3 * 3 , sj = j + y / 3 * 3 ; 
+             if( !(si == x && sj == y) && b[si][sj] == b[x][y])
+                 return false; 
+         }
+     }
+     return true;
+}
+
+void dfs(int t){
+     if(t >= 9 * 9 ) {
+         for(int i = 0 ; i < 9 ; ++ i){
+             for(int j = 0 ; j < 9 ; ++ j)
+                 putchar(b[i][j]);
+             putchar('\n');
+         }
+         putchar('\n');
+         return ;
+     }
+     int x = t / 9 , y = t % 9 ;
+     if(b[x][y] != '0'){  
+          dfs(t+1);
+          return ;
+     }
+     for(int i = 1 ; i <= 9 ; ++ i){
+          b[x][y] = i + '0' ; 
+          if(check(x,y))
+              dfs(t + 1);
+          b[x][y] = '0' ; 
+     }
+}
+
+int main(){
+    int n; 
+    while(scanf("%d", &n) != EOF && n){
+       for(int i = 0 ; i < n ; ++ i){
+           for(int k = 0 ; k < 9 ; ++ k){
+               scanf("%s", b[k]);
+           }
+           printf("Scenario #%d:\n", i + 1); 
+           dfs(0);
+       }      
+    }
+    return 0 ;
+}

poj/volume-20/2926.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+#include <math.h>
+#include <time.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+using namespace std;
+
+#define MAXN 100005
+
+int n ; 
+double a[MAXN][5] ;
+
+int main(){
+    int x , y, check;
+    double l , r , mid;
+    scanf("%d", &n);
+    srand(time(NULL));
+    for(int i = 0 ; i < n ; ++ i){
+        for(int j = 0 ; j < 5 ; ++ j)
+            scanf("%lf", &a[i][j]);
+    }
+    l = 0.0 ; r = 1e20;
+    for(int i = 0 ; i < 100 ; ++ i){
+        mid = (l + r ) / 2.0;
+        check = true;
+        for(int k = 0 ; check && k < 100000 ; ++ k){
+            x = rand() % n ; 
+            y = rand() % n ; 
+            double sum = 0 ; 
+            for(int j = 0 ; j < 5 ; ++j)
+                sum +=  fabs(a[x][j] - a[y][j]);
+            if(sum > mid){
+                check = false;
+            }
+        }
+        if(check){
+            r = mid;
+        }else{
+            l = mid;
+        }
+    }
+    printf("%0.2lf\n", mid);
+    return 0;
+}

poj/volume-20/2973.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <stdio.h>
+#include <string.h>
+
+using namespace std;
+
+#define MAXN 1005
+
+int n, hit[MAXN]; 
+char s[MAXN][8], t[8], cur[8];
+
+
+bool streq(char *pattern, char *target){
+    while(*pattern && *target){
+        if(*pattern == '_' || *pattern == *target){
+            pattern ++ ; 
+            target ++ ;
+        }else{
+            return false;
+        }
+    }
+    if(*target == '\0') return true;
+    return false;
+}
+
+
+void calc(){
+    for(int i = 0 ; i < n ; ++ i)
+        if( 0 == hit[i] && streq(cur, s[i]) ){
+            hit[i] = 1;
+        }
+}
+
+void dfs(int i){
+    if(i >= strlen(cur)){
+        calc();
+    }
+    for(int k = i ; k < strlen(cur); ++ k){
+        swap(cur[i], cur[k]);
+        dfs(i+1);
+        swap(cur[i], cur[k]);
+    }
+}
+
+
+int main(){
+    int ans = 0 ;
+    while(scanf("%d", &n)!= EOF && n){
+        for(int i = 0 ; i < n ; ++ i){
+            scanf("%s", s[i]);
+        }
+        scanf("%s", t);
+        memset(hit, 0, sizeof(hit));
+        strcpy(cur, t);
+        dfs(0);
+        ans = 0 ; 
+        for(int i = 0 ;i < n ; ++ i)
+            ans += hit[i];
+        printf("%d\n", ans);
+    }
+    return 0 ;
+}