Petya has a rectangular Board of size n×mn×m . Initially, kk chips are placed on the board, ii -th chip is located in the cell at the intersection of ...
分类：
其他好文 时间：
2020-03-25 01:05:14
阅读次数：
81
题目链接：http://codeforces.com/problemset/problem/13/E Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for o ...
分类：
其他好文 时间：
2020-02-27 19:09:01
阅读次数：
78
A Petya is a big fan of mathematics, esecially its part related to fractions. Recently he learned that a fraction is called proper iff its numerator i ...
"Temporarily unavailable" "K for the Price of One (Hard Version)" "Petya and Exam" Temporarily unavailable $$ Time Limit: 1 s\quad Memory Limit: 256 M ...
分类：
其他好文 时间：
2019-12-25 23:45:54
阅读次数：
119
"更好的阅读体验" Portal Portal1: "Codeforces" Portal2: "Luogu" <! more Description Petya loves lucky numbers. Everybody knows that lucky numbers are positive ...
分类：
其他好文 时间：
2019-08-07 22:43:13
阅读次数：
118
A - Petya and Origami CodeForces - 1080A 题意：制造一份邀请函需要2份a物品，5份b物品，8份c物品，一个盒子里面有k份物品（可以为a或b或c）问你制造n份邀请函需要用多少个盒子 题解：加起来就行了 #include <iostream> #include < ...
分类：
其他好文 时间：
2019-07-12 20:08:00
阅读次数：
113
题意： 给出一个数组，元素有正有负有0，问其区间和小于 t 的子区间的个数。 sum[ r ]-sum[ l-1 ]<t，其中sum是a的前缀和。 实现的方法就是从前往后对于每一个sum[ i ]，看在它前面有多少个大于等于sum[ i ] - t 的前缀和。 树状数组维护的是 i 前面有几个数小于 ...
分类：
编程语言 时间：
2019-03-15 20:41:03
阅读次数：
232
"link" 题目大意：Petya写了一个假的序列求max cpp int fast_max(int n, int a[]) { int ans = 0; int offset = 0; for (int i = 0; i using namespace std; const int xkj = 1 ...
分类：
其他好文 时间：
2019-03-06 15:09:05
阅读次数：
154
Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for one person with following rules: There are N holes l ...
分类：
其他好文 时间：
2019-03-05 18:46:47
阅读次数：
163
Join 题目链接：https://vjudge.net/problem/URAL-1627 Description: Businessman Petya recently bought a new house. This house has one floor with n × m square ...
分类：
其他好文 时间：
2019-02-17 22:19:57
阅读次数：
230
