Bil-273 Биринчи сынак |
Старт: 12.ноя.2018 в 09:25:00
Финиш: 16.ноя.2018 в 12:05:00
Турнир завершён!
• Турнирная таблица
|
|
Лимит времени 1000/1000/1000/1000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Problem description
Given N cities and some of them are connected with roads. Calculate number of roads.
Input
There is a single integer N on the first line (0 ≤ N ≤ 100). There are N integers 1 or 0 on each of N next lines. Where (i, j) = 1 if cities i and j are connected and 0 otherwise.
Output
Write number of roads.
Example
| stdin |
stdout |
5
0 1 0 0 0
1 0 1 1 0
0 1 0 0 0
0 1 0 0 0
0 0 0 0 0 |
3 |
Для отправки решений необходимо выполнить вход.
|