@jpetit/toolkit 3.0.0

package/assets/problems/standard/campanar-de-la-torrassa.pbm/test-2.ops

@@ -0,0 +1 @@
+--maxtime=8

package/assets/problems/standard/maximum-of-2-integers.pbm/README.md

@@ -0,0 +1,11 @@
+# Maximum of two integers
+
+## Features
+
+- Standard problem: read input and write output
+- Statements in multiple languages
+- Solutions in multiple programming languages
+
+## Abstract
+
+Given two integers, determine and output the larger of the two.

package/assets/problems/standard/maximum-of-2-integers.pbm/handler.yml

@@ -0,0 +1 @@
+handler: std

package/assets/problems/standard/maximum-of-2-integers.pbm/problem.ca.tex

@@ -0,0 +1,17 @@
+\Problem{Màxim de dos enters}
+
+
+\Statement
+
+Feu un programa que llegeixi dos nombres i que n'escrigui el màxim.
+
+\Input
+
+L'entrada consisteix en dos enters.
+
+\Output
+
+Cal escriure una línia amb el màxim dels dos nombres.
+
+\Sample
+

package/assets/problems/standard/maximum-of-2-integers.pbm/problem.ca.yml

@@ -0,0 +1,3 @@
+email: jpetit@cs.upc.edu
+title: Màxim de dos enters
+author: Jordi Petit

package/assets/problems/standard/maximum-of-2-integers.pbm/problem.en.tex

@@ -0,0 +1,16 @@
+
+\Problem{Maximum of two integer numbers}
+
+\Statement
+
+Write a program that reads two numbers and prints their maximum.
+
+\Input
+
+Input consists of two integer numbers.
+
+\Output
+
+Print a line with the maximum of the two numbers.
+
+\Sample

package/assets/problems/standard/maximum-of-2-integers.pbm/problem.en.yml

@@ -0,0 +1,4 @@
+translator: Carlos Molina
+title: Maximum of two integers
+translator_email: cmolinah@gmail.com
+original_language: ca

package/assets/problems/standard/maximum-of-2-integers.pbm/sample-1.inp

@@ -0,0 +1 @@
+634 371

package/assets/problems/standard/maximum-of-2-integers.pbm/sample-2.inp

@@ -0,0 +1 @@
+-31 -21

package/assets/problems/standard/maximum-of-2-integers.pbm/sample-3.inp

@@ -0,0 +1 @@
+-5 -5

package/assets/problems/standard/maximum-of-2-integers.pbm/solution.c

@@ -0,0 +1,18 @@
+#include <stdio.h>
+
+int main()
+{
+    int a, b;
+
+    (void)scanf("%d", &a);
+    (void)scanf("%d", &b);
+
+    if (a > b)
+    {
+        printf("%d\n", a);
+    }
+    else
+    {
+        printf("%d\n", b);
+    }
+}

package/assets/problems/standard/maximum-of-2-integers.pbm/solution.cc

@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int a, b;
+    cin >> a >> b;
+    if (a > b) {
+        cout << a << endl;
+    } else {
+        cout << b << endl;
+    }
+}

package/assets/problems/standard/maximum-of-2-integers.pbm/solution.java

@@ -0,0 +1,16 @@
+import java.util.*;
+
+class Main {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int a = scanner.nextInt();
+        int b = scanner.nextInt();
+        if (a > b) {
+            System.out.println(a);
+        } else {
+            System.out.println(b);
+        }
+    }
+
+}

package/assets/problems/standard/maximum-of-2-integers.pbm/solution.py

@@ -0,0 +1,5 @@
+from yogi import read
+
+a = read(int)
+b = read(int)
+print(max(a, b))

package/assets/problems/standard/maximum-of-2-integers.pbm/test-1.inp

@@ -0,0 +1 @@
+4312 47465

package/assets/problems/standard/maximum-of-2-integers.pbm/test-2.inp

@@ -0,0 +1 @@
+-12345 -987

package/assets/problems/standard/maximum-of-2-integers.pbm/test-3.inp

@@ -0,0 +1 @@
+987654321 -987654321

package/assets/problems/standard/maximum-of-2-integers.pbm/test-4.inp

@@ -0,0 +1 @@
+137 0

package/assets/problems/standard/maximum-of-2-integers.pbm/test-5.inp

@@ -0,0 +1 @@
+0 -651

package/assets/problems/standard/treasures-in-a-map.pbm/README.md

@@ -0,0 +1,12 @@
+# Treasures in a map
+
+## Features
+
+- Standard problem: read input and write output
+- Statements in multiple languages
+- Award in .`png` 
+- Random testcases generators
+
+## Abstract
+
+Count the number of treasures in a map represented as a grid of characters.

package/assets/problems/standard/treasures-in-a-map.pbm/atzar.cc

@@ -0,0 +1,85 @@
+// atzar.cc
+// SR, febrer/06
+// Implementacio d'una classe per treballar amb nombres aleatoris.
+
+
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+
+class atzar {
+  private:
+
+  int llavor;
+  void seguent();
+
+  public:
+
+  // inicialitza la llavor amb el valor donat
+  atzar(int llavor);
+
+  // retorna un real aleatori de [0, 1)
+  double uniforme();
+
+  // retorna un enter aleatori de [esquerra, dreta]
+  int uniforme(int esquerra, int dreta);
+
+  // retorna un real aleatori de [esquerra, dreta] amb dig digits
+  double uniforme(int esquerra, int dreta, int dig);
+
+  // retorna true amb probabilitat p
+  bool probabilitat(double p);
+
+  // retorna una permutaci� aleat�ria de 0 .. n - 1
+  vector<int> permutacio(int n);
+};
+
+
+atzar::atzar(int llavor) : llavor(llavor) { }
+
+
+void atzar::seguent() {
+  int x1, x0, z, z1, z0, w, w1, w0;
+  x1 = llavor/65536L; x0 = llavor&65535L;
+  z = 1894L*x0; z1 = z/65536L; z0 = z&65535L;
+  w = 27319L*x1; w1 = w/32768L; w0 = w&32767L;
+  llavor = 453816693L + 1894L*x1 + z1 + w1 - 2147483647L;
+  llavor += 27319L*x0;
+  if (llavor >= 0L) llavor -= 2147483647L;
+  llavor += 32768L*z0;
+  if (llavor >= 0L) llavor -= 2147483647L;
+  llavor += 65536L*w0;
+  if (llavor < 0L) llavor += 2147483647L;
+}
+
+
+double atzar::uniforme() {
+  seguent();
+  return (double)llavor/(double)2147483647L;
+}
+
+
+int atzar::uniforme(int esquerra, int dreta) {
+  return esquerra + (int)(((double)(dreta - esquerra + 1))*uniforme());
+}
+
+
+double atzar::uniforme(int esquerra, int dreta, int dig) {
+  int pow = 1;
+  while (dig--) pow *= 10;
+  return ((double)uniforme(esquerra*pow, dreta*pow))/(double)pow;
+}
+
+
+bool atzar::probabilitat(double p) {
+  return uniforme() < p;
+}
+
+
+vector<int> atzar::permutacio(int n) {
+  vector<int> V(n);
+  for (int i = 0; i < n; ++i) V[i] = i;
+  for (int i = n - 1; i > 0; --i) swap(V[i], V[uniforme(0, i)]);
+  return V;
+}

package/assets/problems/standard/treasures-in-a-map.pbm/generate-1.cc

@@ -0,0 +1,26 @@
+#include "atzar.cc"
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+atzar A(0);
+
+
+int main() {
+  int n = A.uniforme(1, 100);
+  int m = A.uniforme(1, 100);
+  cout << n << ' ' << m << endl;
+
+  int x = A.uniforme(1, n);
+  int y = A.uniforme(1, m);
+
+  for (int i = 1; i <= n; ++i) {
+    for (int j = 1; j <= m; ++j)
+      if ((i == x and j == y) or A.probabilitat(0.6)) cout << '.';
+      else cout << (A.probabilitat(0.04) ? 't' : 'X');
+    cout << endl;
+  }
+
+  cout << x << ' ' << y << endl;
+}

package/assets/problems/standard/treasures-in-a-map.pbm/generate-2.cc

@@ -0,0 +1,26 @@
+#include "atzar.cc"
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+atzar A(1);
+
+
+int main() {
+  int n = A.uniforme(1, 100);
+  int m = A.uniforme(1, 100);
+  cout << n << ' ' << m << endl;
+
+  int x = A.uniforme(1, n);
+  int y = A.uniforme(1, m);
+
+  for (int i = 1; i <= n; ++i) {
+    for (int j = 1; j <= m; ++j)
+      if ((i == x and j == y) or A.probabilitat(0.6)) cout << '.';
+      else cout << (A.probabilitat(0.04) ? 't' : 'X');
+    cout << endl;
+  }
+
+  cout << x << ' ' << y << endl;
+}

package/assets/problems/standard/treasures-in-a-map.pbm/generate-3.cc

@@ -0,0 +1,26 @@
+#include "atzar.cc"
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+atzar A(5);
+
+
+int main() {
+  int n = A.uniforme(1, 100);
+  int m = A.uniforme(1, 100);
+  cout << n << ' ' << m << endl;
+
+  int x = A.uniforme(1, n);
+  int y = A.uniforme(1, m);
+
+  for (int i = 1; i <= n; ++i) {
+    for (int j = 1; j <= m; ++j)
+      if ((i == x and j == y) or A.probabilitat(0.5)) cout << '.';
+      else cout << (A.probabilitat(0.05) ? 't' : 'X');
+    cout << endl;
+  }
+
+  cout << x << ' ' << y << endl;
+}

package/assets/problems/standard/treasures-in-a-map.pbm/generate-4.cc

@@ -0,0 +1,26 @@
+#include "atzar.cc"
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+atzar A(9);
+
+
+int main() {
+  int n = A.uniforme(1, 100);
+  int m = A.uniforme(1, 100);
+  cout << n << ' ' << m << endl;
+
+  int x = A.uniforme(1, n);
+  int y = A.uniforme(1, m);
+
+  for (int i = 1; i <= n; ++i) {
+    for (int j = 1; j <= m; ++j)
+      if ((i == x and j == y) or A.probabilitat(0.6)) cout << '.';
+      else cout << (A.probabilitat(0.04) ? 't' : 'X');
+    cout << endl;
+  }
+
+  cout << x << ' ' << y << endl;
+}

package/assets/problems/standard/treasures-in-a-map.pbm/handler.yml

@@ -0,0 +1 @@
+handler: std

package/assets/problems/standard/treasures-in-a-map.pbm/problem.ca.tex

@@ -0,0 +1,40 @@
+
+\Problem{Tresors en un mapa}
+
+\Statement
+
+Feu un programa que, donat un mapa amb tresors i obstacles,
+digui si és possible o no arribar fins a algun dels tresors
+des d'una posició inicial donada.
+Els moviments permesos són horitzontals o verticals,
+però no diagonals.
+Si cal, es pot passar per sobre dels tresors.
+
+
+\Input
+
+L'entrada comença amb el nombre de files $n$ i de columnes $m$ del mapa.
+Segueixen $n$ files amb $m$ caràcters cadascuna.
+Un punt indica una posició buida,
+una \texttt{'X'} indica un obstacle,
+i una \texttt{'t'} indica un tresor.
+Finalment, un parell de nombres $f$ i $c$
+indiquen la fila i columna inicials (ambdues començant en 1)
+des de les quals cal començar a buscar tresors.
+Podeu suposar que $n > 0$, que $m > 0$,
+que $f$ estarà entre 1 i $n$, que $c$ estarà entre 1 i $m$,
+i que la posició inicial sempre estarà lliure.
+
+
+\Output
+
+Escriviu \texttt{"1"} o \texttt{"0"}
+depenent de si és possible o no arribar a algun dels tresors.
+
+
+\Observation
+
+La manera més senzilla de resoldre aquest exercici no usa cap cua.
+
+
+\SampleTwoCol

package/assets/problems/standard/treasures-in-a-map.pbm/problem.ca.yml

@@ -0,0 +1,3 @@
+email: roura@lsi.upc.edu
+author: Salvador Roura
+title: Tresors en un mapa (1)

package/assets/problems/standard/treasures-in-a-map.pbm/problem.en.tex

@@ -0,0 +1,40 @@
+
+\Problem{Treasures in a map}
+
+\Statement
+
+Write a program that, given a map with treasures and obstacles,
+indicates if is possible or not to arrive to any treasure
+from a given initial position.
+The allowed movements are horizontal or vertical,
+but not diagonal.
+If it is necessary, passing over the treasures is allowed.
+
+
+\Input
+
+Input starts with the number of rows $n$ and the number of columns $m$ of the map.
+$n$ rows follow with $m$ characters each one.
+A dot indicates an empty position,
+a \texttt{'X'} indicates an obstacle,
+and a \texttt{'t'} indicates a treasure.
+Finally, a pair of numbers $r$ and $c$
+indicates the initial row and column (both of them starting with 1)
+where your program must start to look for the treasures.
+You can suppose that $n > 0$, that $m > 0$,
+that $r$ will be between 1 and $n$, that $c$ will be between 1 and $m$,
+and that the initial position will be always in an empty position.
+
+
+\Output
+
+Your program must print \texttt{"1"} or \texttt{"0"}
+depending on if it possible or not to arrive to any treasure.
+
+
+\Observation
+
+The simplest way to solve this exercise does not use any queue.
+
+
+\SampleTwoCol

package/assets/problems/standard/treasures-in-a-map.pbm/problem.en.yml

@@ -0,0 +1,4 @@
+translator: Carlos Molina
+translator_email: cmolinah@gmail.com
+original_language: ca
+title: Treasures in a map (1)

package/assets/problems/standard/treasures-in-a-map.pbm/random-1.inp

@@ -0,0 +1,24 @@
+22 31
+.XX....X.X.....X.X.X.X....XX.X.
+X..X....X.XXX...........XX..X..
+...XXX....tX......X....XX.tXXX.
+X.X....XXXXXX.X.X........X...XX
+X..X...XX..XXX...X..XX....X.X..
+XXt..XXXX.X..X.XXX...X.X....XX.
+X.X.X.X..XXX.XX...X.X.XX.X.X...
+.X..XXX........X.X....XXXX..X.X
+.X..XXX.......XXXX..........X.X
+XXXX..X...X.t.XX.X....XX...X...
+X.X..X.X.X..X.X.XX.X..X..Xt...X
+.X.X...X...XX...X.X.X....X.....
+..XX..X.XXX...XXX....t.X.X.X.XX
+.XXXX....X...XXX.X.XXt.XX..X...
+.X.XX.XX...XX..X.XXXX..X.X....X
+X.X.X.XX.XXX..XX.X.X.........XX
+...XXXX..X.XX..t..X......X...X.
+X.X..X......XX...XX........X..X
+.X...XX.XX.tX.X..XX...X....X..X
+...X...X....XXX..XXXX..XX.X..t.
+X.X.XXXX.XX.tXX..XXX.XX.XX..XX.
+..X.XX..XX....X.XXXX.X........X
+19 30

package/assets/problems/standard/treasures-in-a-map.pbm/random-2.inp

@@ -0,0 +1,27 @@
+25 71
+...X.X.XXXXX.XXX.XX..XXXXX.XXX.X.X..X.XX..XX.X..X...t....X.XX.....X....
+.X..X...........X..XX.X.X.tXX.XX....X...XX.XtX..X..XXX...X.X.X.X..XXX..
+XX.X..X.X.X.XXXX...X.XXXX......XX..XXX.X....XX..X.....XXXX...XX.X.XXXX.
+..XX..XXXX.....X.XXX.XX.X....X...X.......X...X.X..X..XX..X.....XXX.X...
+.X......XXXXXX..XX.XXt.XtXX.XXXX...XX.XXX..XX..X...X....X.XXXX.XXXX.X.X
+XX..X...X.X.X...X..t.XX.X..X........XX....X...tXXX...XXXXX..X..XX.....X
+XX.X...X.X..XX..X.X.X.X...X...XXXX.XXXX.XXX..X.....XX..X.X......X......
+.X.X...X..X.XX......X....XXX.X.XXXtXX.XXXX...XXX.XtXt..XX.tXX.XXX.t.X..
+.XXX.X..XX.....X..XX...X...X.XX.X..X.X...X....X.X.XXXX......XXX..X...XX
+X...XX.X..X...X..X....X.X...X.XXt.X..XXX.X..XX...X.X...X...XXX..X......
+..XXX.X....tX...X......X.X..X.....X..X..XXX.XX.X...XX...X.....X..X.XXX.
+XX...tX..X....XX....XXXX....X.X...XX.X..XX.X.t.t.....X.X...X....X.XX...
+XX.XXXX.X.X.XX...X..X....XXXXX...XX.........X....X..X.X..X.XXX.......X.
+..XtX..X.......XXXX.X.XX..X...XX..XX..XXX....X.X.....X..XXX.X.XXX...X..
+X.X.X....X.....XX.......X.....XX.XX..X......t.X..X...X.....XX.X.X..X...
+....X.X.....X..XXXXX...X.XX..X....X.....XXXX..X.X......XX.XXX...X..X.XX
+X.XXX...t.XX..X.XXX...X..X..X.t..X.X.....XX..X.t..XX..XXX.X.X.X....X.X.
+......XX.......X.XX..X..X.X.....X.XXX..X...X.X.XX..X.....X.XXX..t.XX..X
+.X.X.XX..XX.X.XXX...Xt...X..........XX....XXX..XX...X...XXXXXX.X.XXXX..
+..XX.X..XXX..XXX.XX....X....X......X..X...X.X..XX..X..X.XXXX.XXX..XX.XX
+..XX......X..X..XXX.X.X...X..X.XXX.tXX......XX.X....X.X....XX.....X..Xt
+..XX.X..XX.XX..XXXXX..XX.X...X.X..X.XX.X..XX..X..............XX..XX..X.
+.X...XX....XXXXXX..XX.X...X...X.X......X.XXX.X.X....XX....X......XXXt..
+....tt......X..XX.X..XXX.X...XX.XXXX.X.XXXXXX............X.X.XX....X...
+XX..XX...X......X.XtXX.XXX...XXX.XX.X..XXXXX.XX..XX.X...XXXXX..XX.X....
+8 62

package/assets/problems/standard/treasures-in-a-map.pbm/random-3.inp

@@ -0,0 +1,38 @@
+36 28
+XX.X.X.....X..X...X....XX.XX
+X.XX...XXX.X...X.X..X...X.X.
+X..XtX.X...XX..X...XXX.X....
+X.XXtX.X.XXXX....XX..X....XX
+..XXX...XX.XX.t...XX....X..X
+..XX..X.XX...X....X.X.XXXXXX
+X....XXX.X..X..XX.t..XXXXXXX
+..X..XXX.X..XX...XX.X.X.XXXX
+XX..XXX..X.X.X.t.XX.XXX..XX.
+XX......X.X..XX..XX.X.XXXXXX
+XX.XX.X.X..X...XXX..X.X..XX.
+XXtX...X..XXXX...X.XX.XXXXXX
+.XXXXX..XXX.X.X..XXX..X..XX.
+.XXX.XX...XX...X..XX.tX..XX.
+.X..XX.X.....X.XXX.XX.X...X.
+X....X...X..X..X..X....X.X..
+.X..X.X...XX.X..XXXX..X.....
+XXX.......Xt.XXXXX.X.XX...XX
+.X..X...X....XXX.X......X..X
+X.X.....X..X..XX.XX.....XXX.
+X..X.XXXX.X.X.X.Xt.XXXXX....
+X..X.XXX.XX..XXXXX.XX..X.X..
+..X.X..X.....XXX..X.X.XXX.XX
+XX.XXtX..XX...X....XX.XX.X.X
+..tXXX.t.X.X.X..X.X.XX.X..X.
+X...XXX..X..X.XXXX.XX...X..X
+X.X.XXX...XX.XX.XXX....X.XXX
+XX....X..X.XXXX....XXXXXXX..
+X..X.X..X...XXXX..X...XX....
+t..XXX.XXX.XXXX.X...XX.tX.X.
+tXX.t.....X.X.X....XX..XXX.X
+..X.XXX...XtX.X.X..X.XX..X.t
+XXXX.X.XXXtXX..X..X.XtXXXXX.
+.X.Xt...Xt..t..XXXX.XX..X...
+X.XXXX.XXX...X.XX.XXX...X.XX
+..XXX.X..XXXXXtX..X..X..X.X.
+11 15

package/assets/problems/standard/treasures-in-a-map.pbm/random-4.inp

@@ -0,0 +1,50 @@
+48 86
+.XXXXX...XXX..XX.......XX.XXX.XX..X..XX.X.XX....XX....XX..XX.XX.X..X..X.X.X..X....XX..
+...X.t.X.tXXXX.X.X...X.X.X..XX...XX.X.X......X.XXX.X.X.t.XXX...X.X..X..XXX.XX....X..XX
+..X...X..XX....X.X.....X.XXX.XX...XX..XX...X.X.X..X....XX...XXX...X.X.....XX.XXX....XX
+..X...XXXXX.XXXX.XXX.XXXX..X....XX.X.XX.XXX....XXX..t....X......X.X..X..X..X..X..X.XXX
+X...XX..X.XX.X..XXX...t..X.X.X..X...X.t...XXX.X...X....X.X..X..X.X....X.X.XX....X....X
+....XX.X.XXXXX....X.X.XX.X.X......XX...X.XXXXX.X.....XX.X..X.XX.....XX..X.X.XX.XX.X.X.
+X.XXX..XX.XXXXXXX.X..Xt..XXXXt..XX..X.X..X.XX.X.X....X...XXXX..XX..X......XX.....X.X.X
+...X..t.XX..XXX....X..X.XX...XX...X...X.XX.X....X.X...X....XXX.X.X.XXXX.XX.XXX.X..XX..
+.X...X..X.XX.XX....X.t....XX....XXX.X..XX.XXX..X.X....XX..X..X...X.XX.X..XX.......X...
+....XXXX.XX.X.X..XX.X.X.X.X.X..XXXX...X.t...XX.....XX.X.XX....X.X.....X.X..........X.X
+X.........X.....X..X........XXXXXXXX.X..X..X.XX.XX.X.X.t.X.X....X...XX.....X.X.t......
+.t.XX..X.....X.X...X.XX.t...XX...X.X....XX...XX.X..X.X.XX.XXX...X.......X.X.XX.X..XX.X
+.X...X.....X..X.XX....X.....XX...X.XXXX..X.tXXX.........XX..XX......XXXXXX..XXXX.XXX.X
+..X........X.X..X....XX.X.XX..XX..X...XX.XX.X...X..X...X..X.X.XXXX.XX...XX..X......X..
+...X.XX.....X.XX...XX..X.XX.X.X..XXX..XXX.......X......X.....XX.X.X.X.XXXX..XXXXX.X...
+...XX.XXXX.tX......X...X...........X........XXX.X.XX.XXXX..tX..X...X.X..XX.X..X...X.X.
+.X........X..XXXX.......X.X..XXX.X...XX.X......X.....X......X.....XXXXXX.t.XX.....X...
+.............XX.X.XXX....XXX....XXX...X...X.X..X...X.X...X...X.XXX....X.....XXX..XXXXX
+...X....X.XX........X..XX.XX.X...XX.X...XX.XX.....X.XX.....X...X.XX.XXXX..XX.XX......X
+X.XXX...XX.XXX...X..X..X..XXXXX.X..X..XX....X....XX..XXX.X..X....X...X.....XXX..XXt...
+.X.XXXX.XX.XX......X.....XX..X..X.XX.X.X.XXX..X....X..XX..XXX..X.....X.XXX..XX.XX.X..X
+..X..X.XX......XXXtXXXXXXX....X.X....X....XX..........X..X.......X..XXX.XX..X.......X.
+...XX.X.............X....X..X....X.XXX.X....X..XXXX.XX..X.XXX..XXX.X.X.......XX.X.XXXX
+X..XXXX....XXX.Xt..X...X.X.....XX..XX.X.X.....XtX..X.XX.....X.XXtX......XXX.XX...XX...
+..XXXXX....X.....X.X.X..XX.XX...X.XXX.XX.t.X.XX....XX.X.X.X..XXX..XX.tX..X...X...XXXXX
+XX.X.X..XXX.X...X...........X.......XtXXXX.X....XX..X..X...XX.X.X..X...X...X....XX..X.
+X..XX..XXX.X..XXX.X.X..X.X...X..X.XXX.X....XX....X.X.XXX.XXXX.......X.X.......X......X
+.XXXX.XX.X...t.....XX....XXX..X.....X..X.........X...XXXXtXXXX.....X.XX.X....X..X.XXX.
+..X.XX.XX.t...............XX...X.X....XX.X...X.X.....X..XXX..X..XXXX...XXtX.XX.XX.....
+...XtX..X...X.X......X.XX...X.XXXXX.XX.....XX.XX..XX....X...X.XXtXX.......X..XX.XXX.X.
+X..X........X.X...X.X.X.X.X.X...X.XXX.Xt..t.X.X......X.......XX....t.XX...X.X..XXt.X.X
+XX.XXXX..X.XXXX.XX..X.....X.....XX.X.X..XX..t.X..X..X.......XX......X.X.X..X.XXX.X.X.X
+...X...XXXXXXXXXXX...Xt....XX..X...X.XXX.X.XX.XX......X..X....X.X.XX..tX....X..X.X.X..
+.XX.X....X.............XX..XXX.....X..XtX.X...X...X.t.X..X.X....XXX...X...X....X...XXX
+....X..X.XXXXX.X.X.XXX.X..X...X...........X...XX..X...X.XX..XX........XX.......X......
+..XXt..XXX..X.X.X...XXXX.....X.X...XXX.XX.X.X.X...XX..XX....XX....X..X...XX..X.XX..X..
+........X.X.X.X...X...X.X.XXXX..X...X..XXX..XX.....X.XX......XXX.X.XX..XXX....X..XXX.X
+X.XXX.......XX.X.XX.X.X...XX..X....XXXX.....t..X.....t...X.X.Xt.XX...X.X..t.XX...XX...
+....X...XXX..X.XX.XX.X..X.XX.X.X...X..X.X.....X....XX.X.......XXX...XX..X..X.XX....X..
+.XX.XXXXXX.XXX.X.X.XX.....X....X..XX.XX.....X..XX...X..t.X...X.XX...XXX..XXX.X.......X
+X........XXXX..XXX.X.X..X.X..XX..X.t...XX....X...XX.X.....X...X...XXX.tX...X.Xt.X.X..X
+....XXX.X.XX..XX....X...X..XX......XX.......X.XXX...XXX...XX.XXX...X..XXX....XXX.....X
+..X.Xt..X.Xt.....X......X......X....X..XX.XXX........XXXX....X.X.XXXXX.....XXX.XX.X...
+......X..X....X.XXX...tXX.X..XXX.X..XX...XX.X......t....X.X.X...X.X..XXXX....XX..XX...
+...X.XX......X.X.X..X.....X.XXXXXX...Xt....XX...X.XX.XX.X....X..XX...X.X.X.XXXX..X..X.
+X..X...X...X.............X....X.XX...XXXX...X..XXX....X........XX.X.X............XX.X.
+Xt.X.XX..XXXX..XX..X....XXX.XX...X...XXX..XX...X..X...XXX.XX.XXX.X.XXXX.X.XX....X.X...
+XX.X..X.X....X.X.XXXX.XXXXX.X..X.X.X.X...XXX.XX..Xt......X..X..X.X....X..X...X..X.XX..
+14 13

package/assets/problems/standard/treasures-in-a-map.pbm/sample-1.inp

@@ -0,0 +1,9 @@
+7 6
+..t...
+..XXX.
+......
+tX..X.
+.X..Xt
+.XX...
+..t...
+5 3

package/assets/problems/standard/treasures-in-a-map.pbm/sample-2.inp

@@ -0,0 +1,6 @@
+4 10
+..t...X...
+.....X..t.
+XXXXX.X...
+.......X.t
+4 1

package/assets/problems/standard/treasures-in-a-map.pbm/sample-3.inp

@@ -0,0 +1,7 @@
+5 7
+.......
+.XXXXXt
+.X...Xt
+.X.X.XX
+...X.Xt
+5 5

package/assets/problems/standard/treasures-in-a-map.pbm/solution.cc

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+typedef vector<char> VC;
+typedef vector<VC> VVC;
+typedef vector<bool> VB;
+typedef vector<VB> VVB;
+
+
+bool busca(int f, int c, int n, int m, const VVC& mapa, VVB& vist) {
+  if (f < 0 or f >= n or c < 0 or c >= m or vist[f][c]) return false;
+
+  vist[f][c] = true;
+  if (mapa[f][c] == 't') return true;
+  if (mapa[f][c] == 'X') return false;
+
+  return    busca(f + 1, c, n, m, mapa, vist)
+         or busca(f - 1, c, n, m, mapa, vist)
+         or busca(f, c + 1, n, m, mapa, vist)
+         or busca(f, c - 1, n, m, mapa, vist);
+}
+
+
+int main() {
+  int n, m;
+  cin >> n >> m;
+  VVC mapa(n, VC(m));
+  for (int i = 0; i < n; ++i)
+    for (int j = 0; j < m; ++j) cin >> mapa[i][j];
+  int f, c;
+  cin >> f >> c;
+
+  VVB vist(n, VB(m, false));
+  if (busca(f - 1, c - 1, n, m, mapa, vist)) cout << "1" << endl;
+  else cout << "0" << endl;
+}