cycl的博客

Codeforces Round #668 (Div. 2)E. Fixed Point Removal ##题意给你一个序列a，若a[i]==ia[i] == ia[i]==i你可以删除a[i]a[i]a[i]，删除后前后两部分将重新连接，序列a的权值为他能最多能删除的次数给你q个查询，每个查询给你个x，y，表示将前x个元素和后个元素变为n+1，a的权值变为了多少思路首先我们对原序列分析，要是删除的次数最多，我们肯定是优先删除i大的，口胡证明若a，b位置可删除，a<b，先删除a的会影响a.

2020牛客多校第二场场上解决：C,D,F已补题: A,B,G,H,J,KAll with Pairs字符串题意给你n个字符串，定义f(s,t)f(s,t)f(s,t)表示串s的前缀和t的后缀的最长匹配长度求：∑i=1n∑j=1nf(si,sj)2(mod 998244353)\sum_{i=1}^{n}\sum_{j=1}^{n}f(s_i,s_j)^2(mod\ 998244353)i=1∑n​j=1∑n​f(si​,sj​)2(mod 998244353)解法

题目链接链接：https://ac.nowcoder.com/acm/contest/317/F来源：牛客网题目描述小a有一个长度为nn的序列，但是他忘了这个序列的样子，他只记得序列中的数大小在[1, V]内你可以任意选择一些位置，并给它们赋值来组成一段子序列，需要满足序列中的数严格递增一段子序列的“萌值”定义为序列中除最大数外所有数的乘积，若只有1个数则为1他想请你求出所有合法子序...

题目链接Problem DescriptionFinal Exam is coming! Cuber QQ has now one night to prepare for tomorrow’s exam.The exam will be a exam of problems sharing altogether m points. Cuber QQ doesn’t know about t...

题目地址Problem DescriptionAcesrc is a famous mathematician at Nanjing University second to none. Playing with interesting numbers is his favorite. Today, he finds a manuscript when cleaning his room, w...

题目链接Problem DescriptionMany problems require printing the probability of something. Moreover, it is common that if the answer is ab, you should output a×b−1(modp) (p is a prime number). In these pro...

Problem DescriptionYou are given a 4 × 4 grid, which consists of 15 number cells and an empty cell.All numbers are unique and ranged from 1 to 15.In this board, the cells which are adjacent with th...

Problem DescriptionYou are given a positive integer n > 1. Consider all the different prime divisors of n. Each of them is included in the expansion n into prime factors in some degree. Required t...

题目链接Problem DescriptionGiven a sequence of n integers called W and an integer m. For each i (1 <= i <= n), you can choose some elements Wk (1 <= k < i), and change them to zero to make ∑...

var foo =‘bar’#include<bits/stdc++.h>#define ll long long#define mod 1000003using namespace std;//const double pi=atan(1)*4;int m,n;float t[200][200];int id[10005];int c[11]={0,0,0,1,4,...

题目链接//http://acm.hdu.edu.cn/showproblem.php?pid=4793Problem DescriptionThere’s a round medal fixed on an ideal smooth table, Fancy is trying to throw some coins and make them slip towards the medal ...

Problem DescriptionMs.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of...

题目链接Problem DescriptionFarmer John keeps a website called ‘FansBlog’ .Everyday , there are many people visited this blog.One day, he find the visits has reached P , which is a prime number.He thinks...