思维
Tizzii
这个作者很懒,什么都没留下…
展开
-
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 various useless characteristics for it. She succeeded to do it for eac...原创 2020-03-09 15:54:17 · 650 阅读 · 0 评论 -
CodeForces - 1323 C Unusual Competitions
一、内容A bracketed sequence is called correct (regular) if by inserting "+" and "1" you can get a well-formed mathematical expression from it. For example, sequences "(())()", "()" and "(()(()))" are co...原创 2020-03-09 11:50:44 · 571 阅读 · 1 评论 -
CodeForces - 1323B Count Subrectangles
一、内容You are given an array a of length n and array b of length m both consisting of only integers 0 and 1. Consider a matrix c of size n×m formed by following rule: ci,j=ai⋅bj (i.e. ai multiplied by ...原创 2020-03-09 11:39:42 · 564 阅读 · 0 评论 -
CodeForces - 1300 A Non-zero B Assigning to Classes C Anu Has a Function
A统计0的个数,每个0都要加上1,如果最后总和是0,那么还得在一个正数上加1。#include <cstdio>#include <cstring>using namespace std;int t, n, num;int main() { scanf("%d", &t); while (t--) { int sum = 0, cnt = ...原创 2020-02-23 11:01:46 · 410 阅读 · 0 评论 -
CodeForces - 1303 D Fill The Bag 二进制
一、内容You have a bag of size n. Also you have m boxes. The size of i-th box is ai, where each aiis an integer non-negative power of two.You can divide boxes into two parts of equal size. Your goal is t...原创 2020-02-20 15:28:40 · 433 阅读 · 0 评论 -
CodeForces - 1303C Perfect Keyboard
一、内容Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where all 26lowercase Latin letters will be arrang...原创 2020-02-20 13:54:07 · 557 阅读 · 0 评论 -
CodeForces - 1303 A Erasing Zeroes B National Project
A统计2个1中间0的个数#include <cstdio>#include <cstring>using namespace std;const int N = 105;int t, n;char s[N]; int main() { scanf("%d", &t); while (t--) { scanf("%s", s + 1);...原创 2020-02-20 13:26:32 · 387 阅读 · 0 评论 -
CodeForces - 1307D Cow and Fields 差值排序
一、内容Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field nat the end of the day.The Cowf...原创 2020-02-19 13:04:06 · 747 阅读 · 1 评论 -
CodeForces 1307 C Cow and Message dp
一、内容Bessie the cow has just intercepted a text that Farmer John sent to Burger Queen! However, Bessie is sure that there is a secret message hidden inside.The text is a string sof lowercase Latin let...原创 2020-02-19 11:27:19 · 556 阅读 · 0 评论 -
Codeforces Round #621 (Div. 1 + Div. 2) A Cow and Haybales B Cow and Friend
A#include <cstdio>#include <algorithm>using namespace std;int t, n, k, num, ans;int main() { scanf("%d", &t); while (t--) { scanf("%d%d%d", &n, &k, &ans); for (i...原创 2020-02-19 11:15:04 · 467 阅读 · 0 评论 -
CodeForces - 1296D Fight with Monsters
一、内容There are n monsters standing in a row numbered from 1 to n. The i-th monster has hi health points (hp). You have your attack power equal to a hp and your opponent has his attack power equal to b...原创 2020-02-18 13:51:17 · 456 阅读 · 0 评论 -
Codeforces Round #617 (Div. 3) A Array with Odd Sum B Food Buying C Yet Another Walking Robot
A#include <cstdio>int t, n, num;int main() { scanf("%d", &t); while (t--) { scanf("%d", &n); int odd = 0; for (int i = 1; i <= n; i++) { scanf("%d", &num); if (num ...原创 2020-02-18 13:21:06 · 391 阅读 · 0 评论 -
Codeforces #620 (Div. 2)A Two Rabbits B - Longest Palindrome C - Air Conditioner
A#include <cstdio>#include <algorithm>#include <cstring>using namespace std;int t, a, b, x, y;int main() { scanf("%d", &t); while (t--) { scanf("%d%d%d%d", &x, &...原创 2020-02-16 10:26:01 · 392 阅读 · 0 评论 -
Codeforce 1304 C. Air Conditioner
一、内容Gildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.Gildong tries so hard to satisfy the customers that he ev...原创 2020-02-15 23:18:10 · 554 阅读 · 0 评论 -
Codeforces #619 (Div. 2) A Three Strings B Motarack's Birthday C Ayoub's function
A只要a[i]和b[i]其中有一个与c[i]相等,那么可以直接用c[i]替换另外一个。 若都不相等无法替换。(必须替换n次)#include <cstdio>#include <cstring>using namespace std;const int N = 105;int n;char a[N], b[N], c[N];bool ok() { in...原创 2020-02-14 13:40:03 · 458 阅读 · 0 评论 -
A. Equation CodeForces - 1269A
一、内容Let's call a positive integer composite if it has at least one divisor other than 1and itself. For example: the following numbers are composite: 1024, 4, 6, 9;the following numbers are not compo...原创 2019-12-21 21:50:59 · 617 阅读 · 0 评论 -
B.Modulo Equality CodeForces - 1269B
一、内容You are given a positive integer m and two integer sequence: a=[a1,a2,…,an] and b=[b1,b2,…,bn]. Both of these sequence have a length nPermutation is a sequence of ndifferent positive integers fro...原创 2019-12-21 21:36:30 · 636 阅读 · 0 评论 -
Beingawesomeism CodeForces - 1281D
一、内容Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well. He's not getting a lot of sales on his website which he decided to call Azamon. His big problem...原创 2019-12-18 21:00:36 · 582 阅读 · 0 评论 -
Happy Birthday, Polycarp! CodeForces - 1277A
一、内容题意:问1-n中有多少个数是全部相同的数字组成的。如111,222,333,1,2,3,4。。。二、思路每次将n除以相同的基数 和 9进行比较。三、代码#include <cstdio>#include <algorithm>using namespace std;typedef long long ll;int t, n, ans;int ...原创 2019-12-17 18:22:10 · 451 阅读 · 0 评论