acm-icpc | ICPC 2013-2015 | Learning library

First time, I coded like this (I was making a trie) and when I called add("911"); I got a segmentation fault at there when *str == '1'

Im trying to use a Raleway font family for my heading in my website. In local testing it works fine but when pushed to git and run on git pages it doesnt work. I have even specified the text font TTF file in directory but still doesnt work. What am I doing wrong?

The website

https://codesniper99.github.io/Portfolio/

my html index file

So, I have been doing research about solving the Game Strategy problem of ICPC 2014 (page 7).

This consist in a board game with n boxes, each box have a unique set of paths that goes to another box on the board (can have a path that goes to itself). I think a graph would be a good representation of the game, more specific a directed graph

graphic case representation whit n = 2

I found 2 possible algorithms that should solve the problem:

1.- A YouTube video where it says that i should use the Breadth-first search

2.- Blog commenting the solution of some of the problems of that ICPC year. The author says that DP (dynamic programming) can be used. In Wikipedia's page is explained an algorithm called Dijkstra's algorithm which is used for "the shortest path problem" as the page says.

Is one of these algorithms an better solution for the problem? does one of those have better performance or something like that?

I need to write a python script that can match two lists of strings and return the shortest and lexographically first common parts of lists.

Lists corresponds to each other which means (a1, b1)...(aN, bN), pairs are frozen.

The rule:

I am getting an error when I want to run a python script:

The error is following one:

The code is given below:

This question is taken from an ACM-ICPC Romanian archive.

You are given T tuples of the form (N, P), find the smallest number X for every tuple such that X % P == N. If this is not possible, print -1. X can only be formed using digits from the set {2, 3, 5, 7}.

Example :

3

52 100

11 100

51 1123

Output for given example :

52

-1

322352

Restrictions :

1 ≤ P ≤ 5 * 10^6

1 ≤ N ≤ P - 1

I attempted solving this problem by using a recursive function that would build numbers with digits from the given set and check if the condition is met, but that is way too slow because I have no idea when to stop searching (i.e. when there's no solution for the given tuple).

The author hints at using BFS somehow, but I really don't see any way to construct a meaningful graph using the input data of this problem.

How would you approach solving this problem?