Difference between revisions of "2020 CCPC Mianyang Onsite"

From EOJ Wiki
Jump to navigation Jump to search
 
(13 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
== Problem B ==
 
== Problem B ==
 +
Solved by .(3/249)
  
 
== Problem C ==
 
== Problem C ==
Line 10: Line 11:
  
 
== Problem D ==
 
== Problem D ==
 +
Solved by .(2/91)
  
 
== Problem E ==
 
== Problem E ==
 +
Unsolved.
  
 
== Problem F ==
 
== Problem F ==
 +
Unsolved.
  
 
== Problem G ==
 
== Problem G ==
 +
Solved .(2/50)
  
 
== Problem H ==
 
== Problem H ==
 +
Unsolved.
  
 
== Problem I ==
 
== Problem I ==
 +
Unsolved.
  
 
== Problem J ==
 
== Problem J ==
 +
Solved by .(4/154)
  
 
== Problem K ==
 
== Problem K ==
 +
Solved by .(3/124)
  
 
== Problem L ==
 
== Problem L ==
 +
Solved by bingoier.(1/238)
 +
 +
$dp[i][j]$ 表示做到第 $i$ 位二进制数时,这一位能取到小于等于 $j$ 的数时的方案数
 +
 +
根据 $j$ 的奇偶性分两种情况可以直接向下 $dp$ ,因为总的状态数不会很多,用 $map$ 保存 $dp$ 数组即可

Latest revision as of 14:19, 3 November 2020

Problem A

Unsolved.

Problem B

Solved by .(3/249)

Problem C

Unsolved.

Problem D

Solved by .(2/91)

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved .(2/50)

Problem H

Unsolved.

Problem I

Unsolved.

Problem J

Solved by .(4/154)

Problem K

Solved by .(3/124)

Problem L

Solved by bingoier.(1/238)

$dp[i][j]$ 表示做到第 $i$ 位二进制数时,这一位能取到小于等于 $j$ 的数时的方案数

根据 $j$ 的奇偶性分两种情况可以直接向下 $dp$ ,因为总的状态数不会很多,用 $map$ 保存 $dp$ 数组即可