NSU
CRYPTO
Login
Registration
Toggle navigation
NSU
CRYPTO
Login
Registration
Olympiad 2022
Results
Home
News
Participation outline
Committees & Sponsors
Important dates
Archive
Unsolved problems
Publications
Feedbacks
Archive
NSUCRYPTO-2022
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Total results
NSUCRYPTO-2021
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Map
Committees & Sponsors
Information letter
NSUCRYPTO-2020
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2019
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2018
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2017
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2016
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2015
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
NSUCRYPTO-2014
Problems of the 1st round (Section A)
Problems of the 1st round (Section B)
Problems of the 2nd round
Solutions of the problems
Total results
Photos
Committees & Sponsors
Information letter
Second round 2021
Problems
Toggle navigation
P.1
P.2
P.3
P.4
P.5
P.6
P.7
P.8
P.9
P.10
P.11
P.12
P.13
Download all problems
Problem 11
:
Additional information
The bound <2^n-n-1 works for n>=4. If n<4, the bound is <=2^n-n-1.
alt:
Open file
For all questions please contact
nsucrypto@nsu.ru
© 2022 NSUCRYPTO