数学
数学
xing_mo
这个作者很懒,什么都没留下…
展开
-
D. Count the Arrays,组合,Educational Codeforces Round 83 (Rated for Div. 2)
D. Count the Arrays,Educational Codeforces Round 83 (Rated for Div. 2)http://codeforces.com/contest/1312/problem/DYour task is to calculate the number of arrays such that:each array contains n elem...原创 2020-03-14 02:30:10 · 153 阅读 · 0 评论 -
Kanade's convolution,HDU - 6057,FWT
Kanade’s convolution,HDU - 6057https://vjudge.net/problem/HDU-6057/originGive you two arrays A[0…2m−1] and B[0…2m−1].Please calculate array C[0…2m−1]:C[k]=∑i and j=kA[i xor j]∗B[i or j]You just n...原创 2020-02-19 14:43:03 · 146 阅读 · 0 评论 -
Binary Table,CodeForces - 662C,FWT,状压
Binary Table,CodeForces - 662Chttps://vjudge.net/problem/CodeForces-662C/originYou are given a table consisting of n rows and m columns. Each cell of the table contains either 0 or 1. In one move, y...原创 2020-02-19 13:12:11 · 130 阅读 · 0 评论 -
Super Rooks on Chessboard,UVA - 12633,FFT
Super Rooks on Chessboard,UVA - 12633https://vjudge.net/problem/UVA-12633/originLet’s assume there is a new chess piece named Super-rook. When placed at a cell of a chessboard, itattacks all the ce...原创 2020-02-19 12:34:33 · 192 阅读 · 0 评论 -
Hard Nim,HYSBZ - 4589,Nim博弈,FWT
Hard Nim,HYSBZ - 4589https://vjudge.net/problem/HYSBZ-4589/originClaris和NanoApe在玩石子游戏,他们有n堆石子,规则如下:Claris和NanoApe两个人轮流拿石子,Claris先拿。每次只能从一堆中取若干个,可将一堆全取走,但不可不取,拿到最后1颗石子的人获胜。不同的初始局面,决定了最终的获胜者,有些局面下...原创 2020-02-19 12:13:39 · 113 阅读 · 0 评论 -
A+B Problem,Kattis - aplusb,FFT
A+B Problem,Kattis - aplusbGiven N integers in the range [−50000,50000], how many ways are there to pick three integers ai, aj, ak, such that i, j, k are pairwise distinct and ai+aj=ak? Two ways are ...原创 2020-02-19 12:05:54 · 201 阅读 · 0 评论 -
HDU - 4609 ,3-idiots,FFT
HDU - 4609 ,3-idiotshttps://vjudge.net/problem/HDU-4609/originKing OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a kind o...原创 2020-02-19 00:14:18 · 193 阅读 · 0 评论 -
HDU - 1402,A * B Problem Plus,FFT板
HDU - 1402,A * B Problem Plushttps://vjudge.net/problem/HDU-1402/originCalculate A * B.思路:FFT板题,贴个常数很小的板子#include<bits/stdc++.h>#define ll long long#define ri register int#define MAXN 500...原创 2020-02-18 23:47:20 · 128 阅读 · 0 评论 -
CodeForces - 819D,扩展欧几里得
After studying the beacons Mister B decided to visit alien’s planet, because he learned that they live in a system of flickering star Moon. Moreover, Mister B learned that the star shines once in exac...原创 2019-03-12 15:43:49 · 309 阅读 · 0 评论 -
素数分解
Eddy’s research Ihdu-1164Eddy’s interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can...原创 2019-02-16 16:17:44 · 2711 阅读 · 0 评论 -
D. Same GCDs, Educational Codeforces Round 81 (Rated for Div. 2),欧拉函数
D. Same GCDs, Educational Codeforces Round 81 (Rated for Div. 2)You are given two integers a and m. Calculate the number of integers x such that 0≤x<m and gcd(a,m)=gcd(a+x,m).Note: gcd(a,b) is th...原创 2020-01-30 01:23:05 · 341 阅读 · 0 评论 -
HDU - 6035,点分治,组合计数
Colorful Treehttps://vjudge.net/problem/938230/originThere is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.The path between each...原创 2020-01-18 18:43:37 · 418 阅读 · 0 评论 -
CodeChef PRIMEDST,点分治,FFT
Prime Distance On Treehttps://vjudge.net/problem/149908/originProblem description.You are given a tree. If we select 2 distinct nodes uniformly at random, what’s the probability that the distance b...原创 2020-01-17 11:06:35 · 199 阅读 · 0 评论 -
A. Deadline,数论分块
Educational Codeforces Round 80 (Rated for Div. 2) A. Deadlinehttps://codeforces.com/contest/1288/problem/A思路:⌈dx+1⌉=⌊d+xx+1⌋=1+⌊d−1x+1⌋\lceil \frac{d}{x+1} \rceil=\lfloor\frac{d+x}{x+1}\rfloor=1+\...原创 2020-01-16 10:21:53 · 361 阅读 · 0 评论 -
C. Two Arrays,组合数学
C. Two Arrayshttps://codeforces.com/contest/1288/problem/CYou are given two integers n and m. Calculate the number of pairs of arrays (a,b) such that:the length of both arrays is equal to m;each e...原创 2020-01-16 10:18:41 · 549 阅读 · 0 评论 -
HYSBZ 1061,单纯形&对偶原理
志愿者招募申奥成功后,布布经过不懈努力,终于成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题:为即将启动的奥运新项目招募一批短期志愿者。经过估算,这个项目需要N 天才能完成,其中第i 天至少需要Ai 个人。 布布通过了解得知,一共有M 类志愿者可以招募。其中第i 类可以从第Si 天工作到第Ti 天,招募费用是每人Ci 元。新官上任三把火,为了出色地完成自己的工作,布布希望用...原创 2020-01-14 21:48:37 · 177 阅读 · 0 评论 -
HDU 5909,FWT
Tree CuttingByteasar has a tree T with n vertices conveniently labeled with 1,2,…,n. Each vertex of the tree has an integer value vi.The value of a non-empty tree T is equal to v1⊕v2⊕…⊕vn, where ⊕ d...原创 2020-01-14 00:06:46 · 211 阅读 · 0 评论