返回题库

PUMaC 2021 · 组合（A 组） · 第 7 题

PUMaC 2021 — Combinatorics (Division A) — Problem 7

专题
Discrete Math / 离散数学
难度
L3
来源
PUMaC

题目详情

  1. Cassidy has string of n bits, where n is a positive integer, which initially are all 0s or 1s. Every second, Cassidy may choose to do one of two things:
解析
  1. Cassidy has string of n bits, where n is a positive integer, which initially are all 0s or 1s. Every second, Cassidy may choose to do one of two things: