|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||1||1||1||100.000%|
It is known that the human DNA is represented by an integer number. On a microscopical level, the DNA consists of numerous genes. Considering the binary representation of the corresponding number of the DNA, we notice the following rule: digit 1 on the ith position indicates the presence of the ith gene, whereas digit 0 indicates its absence (i is a positive integer). Moreover, it was observed that any two distinct adults can give birth to a child whose DNA only contains the ith gene if and only if the DNAs of both of the adults contain that gene.
Generate an array of 2000 non-negative integers representing the DNAs of a group of adults so that the total number of children with distinct DNAs that can be born from adults belonging to this group is as big as possible. (as big as possible doesn’t mean optimum). The scoring will respect the table below.
|Score||NR-the number number of children with distinct DNAs|
|37||200,000 ≤ NR ≤ 549,999|
|74||550,000 ≤ NR ≤ 600,000|
|74 + 1.5 × ((X - 600,001)/40,000 + 1)||600,000 < NR ≤ 999,999|
|100||1,000,000 ≤ NR|
Considering that the adults have the following DNAs: 1, 5, 3, 6, 9, 12, the distinct DNAs of the children will be 1, 0, 4, 2, 8.