上一页 1 2 3 4 5 6 7 ··· 9 下一页
摘要: Codeforces 1323D Present Catherine received an array of integers as a gift for March 8. Eventually she grew bored with it, and she started calculated 阅读全文
posted @ 2020-03-26 21:16 Artoriax 阅读(192) 评论(0) 推荐(0) 编辑
摘要: Codeforces 1323E Instant Noodles Wu got hungry after an intense training session, and came to a nearby store to buy his favourite instant noodles. Aft 阅读全文
posted @ 2020-03-26 17:39 Artoriax 阅读(214) 评论(0) 推荐(0) 编辑
摘要: Codeforces 1312E Array Shrinking You are given an array $a_1, a_2, \dots, a_n$. You can perform the following operation any number of times: Choose a 阅读全文
posted @ 2020-03-26 16:00 Artoriax 阅读(283) 评论(0) 推荐(0) 编辑
摘要: Codeforces 1327D Infinite Path You are given a colored permutation $p_1, p_2, \dots, p_n$. The i th element of the permutation has color $c_i$. Let's 阅读全文
posted @ 2020-03-25 10:45 Artoriax 阅读(143) 评论(0) 推荐(0) 编辑
摘要: 题面 This is the hard version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can ma 阅读全文
posted @ 2020-03-20 16:12 Artoriax 阅读(240) 评论(0) 推荐(0) 编辑
摘要: 题面 Description As an eligible Ingress Resistance Agent you should know your power source, the Exotic Matter. We call it XM, which is the driving force 阅读全文
posted @ 2020-01-31 18:06 Artoriax 阅读(157) 评论(0) 推荐(0) 编辑
摘要: | NTT(快速数论变换)用到的各种素数及原根 | | | | | : : | : : | : : | : : | | g是mod(r 2 ^ k + 1)的原根 | | | | | r 2 ^ k + 1 | r | k | g | | 3 | 1 | 1 | 2 | | 5 | 1 | 2 | 阅读全文
posted @ 2020-01-31 17:42 Artoriax 阅读(476) 评论(0) 推荐(0) 编辑
摘要: 题面 Description There are $k$ piles of stones in a circle, numbered from $0$ to $k 1$, where the number of the stones in each pile is $n$ initially. Yo 阅读全文
posted @ 2020-01-30 12:37 Artoriax 阅读(244) 评论(0) 推荐(0) 编辑
摘要: 题面 Description Give you two arrays $A[0..2^m 1]$ and $B[0..2^m 1]$. Please calculate array $C[0..2^m 1]$: $$ C[k]=\sum_{i~and~j=k}A[i~xor~j] B[i~or~j] 阅读全文
posted @ 2020-01-29 22:45 Artoriax 阅读(118) 评论(0) 推荐(0) 编辑
摘要: 题面 Problem description. You are given a tree. If we select 2 distinct nodes uniformly at random, what's the probability that the distance between thes 阅读全文
posted @ 2020-01-17 17:44 Artoriax 阅读(161) 评论(0) 推荐(0) 编辑
摘要: 题面 Description There is a skyscraping tree standing on the playground of Nanjing University of Science and Technology. On each branch of the tree is a 阅读全文
posted @ 2020-01-17 17:34 Artoriax 阅读(140) 评论(0) 推荐(0) 编辑
摘要: 题面 又是一堆废话,不挂了 题目链接https://vjudge.net/problem/HDU 5977 数据规模 Each of the following n 1 lines contains two integers u and v,meaning there is one edge bet 阅读全文
posted @ 2020-01-17 17:12 Artoriax 阅读(117) 评论(0) 推荐(0) 编辑
摘要: 题面 Description 聪聪和可可是兄弟俩,他们俩经常为了一些琐事打起来,例如家中只剩下最后一根冰棍而两人都想吃、两个人都想玩儿电脑(可是他们家只有一台电脑)……遇到这种问题,一般情况下石头剪刀布就好了,可是他们已经玩儿腻了这种低智商的游戏。他们的爸爸快被他们的争吵烦死了,所以他发明了一个新游 阅读全文
posted @ 2020-01-17 16:51 Artoriax 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 题面 太长了不放了 链接:https://vjudge.net/problem/POJ 2114 题意 给定一颗树,m次询问,每次询问是否有路径长度为k的树 题解 和上题差不多,我们可以顺便把路径长度等于k的路径有多少条也算出来,大于0就有,等于0就没有 方法也是和上题一样,这题可以先合并长度相等的 阅读全文
posted @ 2020-01-17 16:40 Artoriax 阅读(96) 评论(0) 推荐(0) 编辑
摘要: 题面 Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u a 阅读全文
posted @ 2020-01-17 16:25 Artoriax 阅读(195) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 9 下一页