Hello Codeforces members. I try build online judge. I dont found any information about installation pascal abc.net and free pascal to docker alpine. How to install these languages?

Hello everyone!

My last blog I wrote book Jon Duckett php and mysql. I need help download or buy pdf format. if anyone know how do it please write comment. I'm very glad if we help me.

Thanks advance!
Sorry my English!
I wait your help!

Hello everybody!

I need your help. I want to learn php and mysql. If someone have book by Jon Duckett called php and mysql please send to my email pdf format. I dont have any credit cards. If we have the book please send. I'm very glad if we help to me.

My email: feruzatamyradow@mail.ru

---------------------------------

Sorry my english.

Thanks advance. ---------------------------------****

Hello Coderforces!
I want to learn R and python programming laguagages. but i don't find best tutorial. Please help me if we have tutorials or know links please write comment or send my email: feruzatamyradow@mail.ru

Thanks advance!!!
Sorry my English.

Hello codeforces community. can you help me problem on the dp.
task in russian

Consider an oriented graph G having n vertices numbered by positive integers from 1 to n. In the graph G, there may be several arcs between the same pair of vertices, as well as arcs leading from the vertex to it. Each arc of the graph is marked by some letter of the Latin alphabet. Each path in graph G can be put in correspondence with a string consisting of letters written on successively paths that pass through this path. This is the pathname of the path. We call the string S the path line of the graph G if there exists a path in it whose path label is S.

Your task is to calculate the remainder of dividing by 1 000 000 the number of waypoints of graph G consisting of exactly L symbols.

**Input**

The first line of the input data contains integers n, m, L (1 ≤ n ≤ 10, 1 ≤ m ≤ 10 000, 1 ≤ L ≤ 100) equal to the number of vertices and edges of the graph G, and also the length of the path lines that need to look for. The next m rows define the arcs of the graph G. Each of these lines contains two natural numbers a, b (1 ≤ a, b ≤ n) and a small Latin letter c, which means the presence of an arc from the vertex a to the vertex b marked with the symbol c. Elements of each line are separated from each other by spaces.

**Output**

The only output line must contain one number equal to the remainder of dividing the number of path lines of length L in column G by 1 000 000.

**Test**

Hi CF! I find problem sqrt decomposition. Sorry my english isn't well.

Roma and Vitala came up with the following game: add and subtract from the number of power two, and after each operation count the number of units in the binary number of this number. Who is faster and more correct, he won.

You have to help them: write a program with which they could check their calculations. The rules of the game are:

At the beginning of the game, the number P is zero. For the entire game, N operations are performed. Each operation is the addition to the number P or subtraction from the number P of the number 2S. After performing each operation, it is necessary to output the number of units in the binary representation of P. It is guaranteed that at any time the number P can not be negative.

Input

The first line of the input file INPUT.TXT contains an integer N (1 ≤ N ≤ 10⁵) — the number of operations. The following N lines specify operations where each operation is specified by one of two lines: "add S" or "sub S", where S (0 ≤ S ≤ 10⁵) is an integer.

The "add S" operation means that 2 ^S must be added to the P number.

The operation "sub S" means that the number P should subtract 2 ^S.

Output

For each of the N requests to the output file OUTPUT.TXT on a separate line, output the number of units in the binary record of the number P after performing this operation.

test

4 add 2 add 8 sub 3 sub 0 output: 1 2 6 7

Помагите мне пожалуйста как решить эту задача Шары и коробки