Discord

Checklist VsOSh AI 2026 School Stage (Moscow), grades 9–11 · Task 8

Weighted Voting of Three Models

Russian title: Задание 8

Apply a weighted-vote ensemble of three binary classifiers to a table and count correct final answers.

  • Tabular
  • Data processing (ensemble voting)
  • Russian original · English translation

The task

Three models a1, a2, a3 distinguish dogs (class 0) from cats (class 1). A table (XLSX or CSV) lists, per row, the true class y and the three models' answers, all 0 or 1. With weights w1 = 2, w2 = 1, w3 = 3, compute S = w1·a1 + w2·a2 + w3·a3 and set ŷ = 1 if S ≥ 3, otherwise 0.

Count the rows where ŷ equals y.

Abridged and translated by SOTA from the official Russian materials. The official statement has the exact rules, and it wins wherever this summary differs.

In English

This task was published in Russian. SOTA translated its 4 files into English on 16 September 2026.

Read the task statement in English 305 words

Weighted Voting of Three Models

English translation by SOTA – AI Community of the Russian original. Organisers who would like this translation removed can email [email protected].

Task 8 of the school stage (Moscow) of the All-Russian School Olympiad (VsOSh) 2025/26 in artificial intelligence, grades 9–11. Original: tasks-ai-9-11-sch-msk-25-26.pdf.

Using three machine learning models a1,a2,a3a_1, a_2, a_3, we want to distinguish photographs of dogs (class 0) from photographs of cats (class 1). To evaluate the quality of the models, we ran them on a set of images for which the correct answer is known.

In the table (XLSX format, CSV format), each row contains four numbers: column yy gives the correct class, and columns a1,a2,a3a_1, a_2, a_3 give the answers of the three models. All the numbers are equal to 0 or 1.

Translator's note: the PDF contains no links to the data files named here.

The models are trusted to different degrees; the weights are set as follows:

w1=2,w2=1,w3=3.w_1 = 2, \qquad w_2 = 1, \qquad w_3 = 3.

For each row, the weighted sum is computed:

S=w1a1+w2a2+w3a3.S = w_1 \cdot a_1 + w_2 \cdot a_2 + w_3 \cdot a_3.

The final answer is y^=1\hat{y} = 1 if S3S \geq 3, and y^=0\hat{y} = 0 otherwise.

Find the number of rows in which the final answer y^\hat{y} matches the correct answer yy. Give only this number as your answer.

Translator's note: the statement paper gives only the total for the olympiad (112 points); the official solutions give this task a maximum of 12 points (exact match of the answer).

Translated by SOTA. The Russian original is the official version and wins wherever the two differ. Translated from the statement and solution PDFs of the Moscow school stage (grades 9–11) on vos.olimpiada.ru. The papers name XLSX and CSV data files but do not link them. The spreadsheet formulas use the English function names IF and SUM. If you organise this olympiad and would like the translation removed, email [email protected] and we will take it down.

At a glance

You get
A table in XLSX or CSV format (not included in the published PDF).
You submit
One number.
Scoring
Exact answer (points per task are not stated in the statement file).
Format
School stage (Moscow), started 24 October 2025, grades 9–11; individual; online testing system; maximum 112 points for the paper.

Details

Year
2026, Moscow, Russia (online testing system)
Round
School Stage (Moscow), grades 9–11 · Task 8
Language
Russian; English translation by SOTA
License
Not stated by the source