
数论
文章平均质量分 86
CatDsy
一只慵懒的喵
展开
-
TrickGCD(莫比乌斯函数,容斥)
题目: You are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions? * 1≤Bi≤Ai * For each pair( l , r ) (1≤l≤r≤n) , gcd(bl,bl+1…br)≥2 Input原创 2017-08-18 16:51:14 · 463 阅读 · 0 评论 -
Array GCD
题目 You are given array ai of length n. You may consecutively apply two operations to this array: remove some subsegment (continuous subsequence) of length m < n and pay for it m·a coins change some el原创 2017-08-18 19:55:48 · 556 阅读 · 0 评论 -
Good Sequences(codeforces 264B)
题目: Squirrel Liss is interested in sequences. She also has preferences of integers. She thinks n integers a1, a2, …, an are good.Now she is interested in good sequences. A sequence x1, x2, …, xk is ca原创 2017-08-21 10:46:17 · 712 阅读 · 0 评论