Copies

In the practicals of the programming courses at the Vrije Universiteit all handed in assignments are stored digitally in a database. To make sure that students write their own code, these assignments are checked against each other by a plagiarism checker. The plagiarism checker creates a file per student. The first line of such a file contains the student number of said student, and the rest of the lines of this file each contains:

• a student number
• some amount of spaces
• a similarity score (ranging from 0% to 100%)
• some other amount of spaces
• another student number

An example of such a file would be:

0000008
0000010 12% 0000004
0000009 23% 0000004
0000008 15% 0000004
0000004 13% 0000010

A line "number1 xx% number2" means that the student with student number number1 has an xx% match with the student with number2. This does not automatically imply that the student with number2 also has an xx% match with the student with student number number1!

Write a program that:

• reads the student number on the first line of the file
• creates a bar chart of the matches of the student with that student number for the ten intervals 1-10, 11-20, ..., 91-100 (a line represents a match of that student if his or her number appears in the spot of number1)
• prints the number of expected copies of that student (a match is an expected copy if the match percentage is > 59%)

The bar chart can be represented by = characters.

In case of the example file shown above, the bar chart would have one bar in the second interval (as 15 is in the interval 11-20), and the program would print that there are 0 expected copies.