Problem

15 /23


Based on the Unified State Examination 2018 - 2

Problem

The input of the program is a natural number N (\(N<= 100000\)), and then N lines, each containing one integer. It is necessary to count the number of pairs of numbers whose indices differ by at least three and the product is a multiple of 29.
Write a memory and time efficient program.

 

Examples
# Input Output
1 6
29
7
8
29
4
5		 3

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!