这场简单些,E题是个推结论的数学题,沾点高精的思想。F是个需要些预处理的DP,G题是用exgcd算边权的堆优化dijkstra。C题有点骗,硬啃很难做。 A Thorns and Coins
题意:
在你的电脑宇宙之旅中,你偶然发现了…
A carry-look-ahead adder improves speed by reducing the time required to determine carry bits.The “CLA logic” is also the timing critical psth inthe design.面积换速度,3个16bit的CLA来提高一个32bit的CLA we wiil use three 16-bits adders to design…