Portal --> arc080_f Solution ​  这题的话..差分套路题(算吗?反正就是想到差分就很好想了qwq) ​​  (但是问题就是我不会这种套路啊qwq题解原话是:"这种翻面一段区间的题,就是差分套路题"==) ​  我们定义一个新的数组\(A\),\(A_i\)表示的是第\(i\)个和第\(i-1\)个的状态是否相同,是的话为\(0\)否则为\(1\),至于第\(0\)个的话..我们强行定义第\(0\)个位置反面向上 ​  这样我们就得到了一个\(01\)…

Description ​ 有无穷个硬币,初始有n个正面向上,其余均正面向下.  你每次可以选择一个奇质数p,并将连续p个硬币都翻转.  问最小操作次数使得所有硬币均正面向下. Input ​ 第一行一个正整数NN ​ 第二行NN个正整数,第ii个数表示xixi Output ​ 一个整数表示最小操作步数 Sample Input Sample #1 2 4 5 Sample #2 9 1 2 3 4 5 6 7 8 9 Sample #3 2 1 10000000 Sample Output…

[CF912E]Prime Game(meet in the middle) 题面 CF 懒得翻译了. 题解 一眼题. \(meet\ in\ the\ middle\)分别爆算所有可行的两组质数,然后二分答案,\(two-pointers\)扫一下就好了. #include<iostream> #include<cstdio> #include<algorithm> #include<vector> using namespace std; #define…

[题目大意] 若n是素数,输出“Prime”,否则输出n的最小素因子,(n<=2^54) [题解] 和bzoj3667差不多,知识这道题没那么坑. 直接上Pollord_Rho和Rabin_Miller就行了. /************* POJ 1811 by chty 2016.11.7 *************/ #include<iostream> #include<cstdio> #include<cstdlib> #include<cstri…

题意:验证1~10000 的数 n^n+n+41 中素数的个数.每个询问给出a,b  求区间[a,b]中质数出现的比例,保留两位 题解:质数会爆到1e8 所以用miller robin , 另外一个优化是预处理 一个坑是四舍五入卡精度. #include<stdio.h> #include<stdlib.h> #include<string.h> #include<algorithm> #include<iostream> #include<…

http://poj.org/problem?id=3126 https://www.bnuoj.com/v3/problem_show.php?pid=3245 题目鬼图 刚开始看到题目的图觉得这题会很鬼,然后看题,发现是水题... 线性筛预处理素数→BFS+记录深度 or 迭代加深 or 分层BFS // <3126.cpp> - 11/01/16 17:31:53 // This file is made by YJinpeng,created by XuYike's black tec…

题目如下: Given a matrix consisting of 0s and 1s, we may choose any number of columns in the matrix and flip every cell in that column.  Flipping a cell changes the value of that cell from 0 to 1 or from 1 to 0. Return the maximum number of rows that hav…

题目如下: A string of '0's and '1's is monotone increasing if it consists of some number of '0's (possibly 0), followed by some number of '1's (also possibly 0.) We are given a string S of '0's and '1's, and we may flip any '0' to a '1' or a '1' to a '0'…

题目如下: For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 记忆化搜索 日期 题目地址:https://leetcode-cn.com/problems/flip-game-ii/ 题目描述 You are playing the following Flip Game with your friend: Given a string that contains only these two character…