Skip to content

proneutrino/codeforces-solution

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Codeforces Round 461- Problem F

For some set of integers I, define f(I) as the number of pairs a,b in I such that a) a is strictly less than b b) a divides b without a remainder. Write an algorithm to find a subset I of {1,2,⋯,n} such that f(I)=k given the value of n and k

About

No description or website provided.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages