发表评论取消回复
相关阅读
相关 Educational Codeforces Round 122 (Rated for Div. 2) D. Make Them Equal
[Problem - D - Codeforces][] 题意: 给定三个数组a,b,c,其中a数组一开始为1,b和c数组是给定的。 对于每次操作,都可以选定一个i,任选
相关 Codeforces Round #834 (Div. 3) D. Make It Round
[Problem - D - Codeforces][] ![1c21641e1301413ea5db4b38f928ab5a.png][] Code: incl
相关 CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) C. Make It Permutation
[Problems - Codeforces][] 题意: ![8339051d6f2741b5ab9a8b0135eedfbb.png][] ![9c592e44e36
相关 【*1700质因子分解】CF1538D
[Problem - D - Codeforces][] 题意: 给定两个数a和b,每次操作可以在两个数中选一个数然后除它的一个因子,问你是否可以进行正好K次操作之后a和b
相关 【质因子】CF834 div2 D. Make It Round
[Problem - D - Codeforces][] 题意: ![4fc4b272648e463b88fd5aba2c4d8ff5.png][] 思路: 首先是个常
相关 【朴素DP】CF834div3 E. The Humanoid
虽然是简单DP,但是不妨碍我不会 [Problem - E - Codeforces][] ![a8cd5785c72547d59250f8894080b693.png][
相关 Codeforces Round #402 (Div. 2) (A-D)
[CF \402 div2][CF _402 div2] A题: 数学。具体看代码吧。很容易明白的。 include<bits/stdc++.h> usi
相关 cf round340 div2 F(莫队)
题目链接:[传送门][Link 1] E. XOR and Favorite Number time limit per test 4 seconds mem
相关 Codeforces 155D(分解质因子+预处理)
问题描述: By 2312 there were n Large Hadron Colliders in the inhabited part of the universe
相关 D. Zero Quantity Maximization(CF: Codeforces Round #544 (Div. 3))
题目描述: You are given two arrays aa and bb, each contains nn integers. You want to cre
还没有评论,来说两句吧...