KFU. Card publication. PROBLEMS OF NUMBER THEORYIN PROGRAMMING CONTESTS

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

PROBLEMS OF NUMBER THEORYIN PROGRAMMING CONTESTS

Form of presentation

Articles in international journals and collections

Year of publication

2016

Язык

английский

Authors, employees of KFU

Kinder Mikhail Ivanovich, author

Falileeva Marina Viktorovna, author

Shakirova Liliana Rafikovna, author

Bibliographic description in the original language

Falileeva M. PROBLEMS OF NUMBER THEORYIN PROGRAMMING CONTESTS / M. Falileeva, L. Shakirova, M. Kinder // EDULEARN16 Proceedings. 2016. - P. 0933-0936.

Annotation

EDULEARN16 Proceedings, 8th International Conference on Education and New Learning Technologies

Keywords

programming contests, olympiads of informatics, tasks of number theory, training

The name of the journal

EDULEARN16 Proceedings, 8th International Conference on Education and New Learning Technologies

On-line resource for training course

http://dspace.kpfu.ru/xmlui/bitstream/handle/net/104105/statya_2_Barselona_2016.pdf?sequence=1&isAllowed=y

URL

https://library.iated.org/view/FALILEEVA2016PRO

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=134700&p_lang=2

Resource files

File name	Size (MB)	Format
statya_2_Barselona_2016.pdf	0,40	pdf	show / download

Full metadata record

Field DC	Value	Language
dc.contributor.author	Kinder Mikhail Ivanovich	ru_RU
dc.contributor.author	Falileeva Marina Viktorovna	ru_RU
dc.contributor.author	Shakirova Liliana Rafikovna	ru_RU
dc.date.accessioned	2016-01-01T00:00:00Z	ru_RU
dc.date.available	2016-01-01T00:00:00Z	ru_RU
dc.date.issued	2016	ru_RU
dc.identifier.citation	Falileeva M. PROBLEMS OF NUMBER THEORYIN PROGRAMMING CONTESTS / M. Falileeva, L. Shakirova, M. Kinder // EDULEARN16 Proceedings. 2016. - P. 0933-0936.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=134700&p_lang=2	ru_RU
dc.description.abstract	EDULEARN16 Proceedings, 8th International Conference on Education and New Learning Technologies	ru_RU
dc.description.abstract	There are many different competitions in the field of informatics with different objectives. In spite of these differences, they all share the same need for high quality tasks. This paper describes the algo-rithmic tasks of number theory of different levels of difficulty. Most tasks are used in the specific scope of teaching and learning informatics. In this paper we consider the problems of enumerating the number of ordered tuples of positive inte-gers with fixed greatest common divisor and least common multiple, and we analyze the some properties of the resulting arithmetic functions. The important feature of these tasks is that they are multilevel tasks. They assume to use solution algorithms of various complexity which depend on dimension of the task. All algorithms we present have low sample complexity that depends only on the input parameters. Many of the examples in this paper are taken from the Open Cup named after E.V. Pankratiev (Grand-Prix of Tatarstan).	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	programming contests	ru_RU
dc.subject	olympiads of informatics	ru_RU
dc.subject	tasks of number theory	ru_RU
dc.subject	training	ru_RU
dc.title	PROBLEMS OF NUMBER THEORYIN PROGRAMMING CONTESTS	ru_RU
dc.type	Articles in international journals and collections	ru_RU