From the old laptop

Author: esbanarango

Bomberman.cpp

@@ -0,0 +1,129 @@
+#include<iostream>
+#include<queue>
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+
+
+using namespace std;
+
+struct Tparent{
+       int i,j;
+       Tparent(int i, int j) : i(i), j(j) {}
+       Tparent(){};
+       bool operator == (const  Tparent &uni){
+            return(i==uni.i && j==uni.j);
+       }
+       
+};
+
+struct Tpuerta{
+       int i,j;
+       double prob;
+       Tpuerta(int i, int j, double prob) : i(i), j(j), prob(prob) {}
+       Tpuerta(int i, int j) : i(i), j(j), prob(0) {}
+       Tpuerta(){};
+       bool operator == (const  Tpuerta &uni){
+            return(i==uni.i && j==uni.j);
+       }
+       
+};
+
+char grid[20][20];
+bool visited[20][20];
+Tparent parent[20][20];
+Tpuerta puertas[10];
+int arr[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1,};
+int n;
+int steps=0;
+
+
+
+void bfs(int start_i, int start_j){
+     queue <Tparent> q;
+     q.push(Tparent(start_i,start_j));
+     visited[start_i][start_j] = true;
+     
+     while(!q.empty()){
+          Tparent v = q.front();
+          q.pop();
+          for(int k=0; k < 4; k++){
+                  int ti = v.i + arr[k][0];
+                  int tj = v.j + arr[k][1];
+                  
+                  if(ti>=0 && ti<n && tj>=0 && tj<n){
+                          if(!visited[ti][tj]){
+                               visited[ti][tj] = true;
+                               if(grid[ti][tj]=='.'){
+                                    q.push(Tparent(ti,tj));
+                                    parent[ti][tj]= Tparent(v); 
+                                    //cout<<v.i<<" "<<v.j<<" is parent of "<< ti << " "<<tj<<endl; 
+                               }else if(isdigit(grid[ti][tj])){
+                                     parent[ti][tj]= Tparent(v);
+                               }
+                                           
+                          } 
+                  }
+          }    
+     }
+     
+}
+
+void shortest_path(Tparent start, Tparent end){
+    if(start == end || end == Tparent(-1,-1)){          
+    }else{
+          steps++; 
+       shortest_path(start, parent[end.i][end.j]); 
+        
+    }
+    
+}
+
+int main(){
+    int cases;
+    int nPuerta;
+    int bomberX;
+    int bomberY;
+    
+    cin>>cases;
+    while(cases--){
+            cin>>n;
+            for(int i=0;i<n;i++){
+                  for(int j=0;j<n;j++){
+                          char c;
+                          cin>>c;
+                        if(c=='B'){
+                              bomberX=i;
+                              bomberY=j;     
+                        }else if(isdigit(c)){
+                              int puert= c - '0';
+                              //cout<<puert<<" ";
+                              puertas[puert]=Tpuerta(i,j);           
+                        }
+                        grid[i][j] = c;
+                        visited[i][j]=false;
+                        parent[i][j]=Tparent(-1,-1);
+                  }
+            }
+            bfs(bomberX,bomberY);
+             
+            cin>>nPuerta;
+            for(int i=0;i<nPuerta;i++){
+                  cin>>puertas[i].prob;
+            }
+            double sum=0;
+            for(int i=0; i<nPuerta;i++){
+                  steps=0;
+                  shortest_path(Tparent (bomberX,bomberY), Tparent (puertas[i].i,puertas[i].j));
+                  sum+=(double)(steps * (puertas[i].prob * 0.01));
+            }
+            cout.precision(2);
+            cout<<fixed<<sum<<endl;
+            
+    }
+    
+    
+    
+    
+    return 0;
+}

Live Archive/4215 - Feynman.cpp

@@ -0,0 +1,17 @@
+/*
+  4215 - Feynman
+  ACM-ICPC Live Archive
+  Esteban Arango Medina
+  [email protected]
+
+*/
+
+#include<iostream>
+
+using namespace std;
+
+int main(){ 
+    int n;
+    while((cin>>n) && n){cout<<(2*n + 1)*n*(n+1)/6<<endl;}
+ return 0;   
+}

Live Archive/4233 - Cryptoquote.cpp

@@ -0,0 +1,41 @@
+/*
+  4233  - Cryptoquote
+  ACM-ICPC Live Archive
+  Esteban Arango Medina
+  [email protected]
+*/
+
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main(){
+    int cases;
+    int cont=1;
+    
+    string message;
+    string alphabet="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+    string newAlphabet;
+     
+    cin>>cases;
+    getline(cin,message);
+    
+    while(cases){
+         getline(cin,message);
+         getline(cin,newAlphabet);
+         for(int i=0;i < message.size();i++){
+                 for(int j=0;j<26;j++){
+                         if(message[i]==alphabet[j]){                     
+                                  message[i]=newAlphabet[j];               
+                                  break;                   
+                         }
+                 } 
+         } 
+         cout<<cont<<" "<<message<<endl;
+         cont++;
+         cases--;            
+    }
+  
+ return 0;   
+}

PKU/3507 - Judging Olympia.cpp

@@ -0,0 +1,26 @@
+/*
+  3507 - Judging Olympia
+  PKU Online Judge
+  Esteban Arango Medina
+  [email protected]
+*/
+#include<iostream>
+
+using namespace std;
+
+int main(){
+    int grades[6];
+    bool fin=false;
+    while(!fin){
+                int max=0,min=11,total=0;
+                for(int i=0;i<6;i++){
+                        cin>>grades[i];
+                        if(grades[i]>max){max=grades[i];}
+                        if(grades[i]<min){min=grades[i];}
+                        total+=grades[i];
+                }
+                if(total!=0){cout<<(double)(total-min-max)/4<<endl;}
+                else{fin=true;}
+    }
+ return 0;   
+}

README.md

@@ -2,6 +2,10 @@
 Almost all of them in c++.
 
 ####Online judge
+   * [UVa Online Judge](http://uva.onlinejudge.org/)
+   * [ZOJ](http://acm.zju.edu.cn/)
+   * [Live Archive](http://livearchive.onlinejudge.org/)
+   * [PKU](http://poj.org/)
    * [CodeForces](http://codeforces.com/)
    * [Interviewstreet](https://www.interviewstreet.com/)
    * [Sphere Online Judge](http://www.spoj.pl/)

SPOJ/11031 - Bank Robbers.cpp

@@ -0,0 +1,35 @@
+/*
+  11031 - Bank Robbers
+  SPOJ
+  Esteban Arango Medina
+*/
+#include <algorithm>
+#include <iostream>
+#include <iterator>
+#include <numeric>
+#include <sstream>
+#include <fstream>
+#include <cassert>
+#include <climits>
+#include <cstdlib>
+#include <cstring>
+#include <string>
+#include <cstdio>
+#include <vector>
+#include <cmath>
+#include <queue>
+#include <deque>
+#include <stack>
+#include <list>
+#include <map>
+#include <set>
+using namespace std;
+
+int main(){
+    int n,m;
+
+    while(scanf("%d %d",&n,&m)!=EOF){
+        printf("%d\n",n+m);
+    }
+    return 0;
+}

SPOJ/6256 - Inversion Count.cpp

@@ -1,5 +1,16 @@
+/*
+  6256 - Inversion Count
+  SPOJ
+  Esteban Arango Medina
+  
+  Solution:
+  	Make a new array of size 'MaxElement' of the given array, then, back to front get the sum of each until inv[i]-1 (no including i),
+  	and add 1 to postion inv[i]. Then print the sum. And that's the number of inversions.
+    Fenwick tree.
 
-using namespace std;
+   Notes.
+   	http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binaryIndexedTrees
+*/
 #include <algorithm>
 #include <iostream>
 #include <iterator>
@@ -20,7 +31,7 @@ using namespace std;
 #include <list>
 #include <map>
 #include <set>
-
+using namespace std;
 
 int get(vector<int> *tree,int i){
 	int sum = 0;

SPOJ/902 - Hangover.cpp

@@ -0,0 +1,23 @@
+/*
+  902 - Hangover
+  Sphere Online Judge
+  Esteban Arango Medina
+  [email protected]
+*/
+
+#include <cstdio>
+
+int main (){
+    double num,temp;
+    while(scanf("%lf",&num) && num ){
+            temp=0;
+            int resp=1;
+            while(temp<=num){
+                    temp+=(double) 1/(resp+1);
+                    resp++;         
+            }            
+            printf("%d card(s)\n",resp-1);
+    }   
+    
+ return 0;   
+}

SPOJ/1811 - Longest Common Substring.cpp renamed to SPOJ/Longest Common Substring.cpp

@@ -4,7 +4,7 @@
   Esteban Arango Medina
   
   Solution:
-    Simply show the advantage of Java over C++ = BigInteger. :P
+    Simply shows the advantage of Java over C++ = BigInteger. :P
 */
 import java.io.BufferedReader;
 import java.io.File;

SPOJ/julka.java

@@ -0,0 +1,33 @@
+/*
+  11000 - Bee  
+  TJU Online Judge
+  Esteban Arango Medina
+  [email protected]
+
+*/
+
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+int main(){
+    
+    int n;
+    
+    cin>>n;
+    
+    while(n!=-1){
+           
+           vector <long long int> fib;
+           fib.push_back(0);
+           fib.push_back(1);
+
+           for (int i = 2; i < n+4; i++){
+                   fib.push_back(fib[i-1] + fib[i-2]);
+           }
+           cout<<fib[n+2]-1<<" "<<fib[n+3]-1<<endl;
+           cin>>n;
+    }
+    return 0;
+}