目录 A B C D E F G Dashboard - Codeforces Round #806 (Div. 4) - Codeforces A 题意： 判断一个字符串是否由yes组成 很无聊... #include <bits/stdc++.h> using namespace std;
#pragma warning(disable:4996);
#define ll long long
#define int ll...
time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output At the store, the salespeople want to make all prices?round. In this problem, a number that is a power of?1010?is called a?round?number. For exam...
Educational Codeforces Round 75 (Rated for Div. 2) A~E2 A. Broken Keyboard 链接 #include<bits/stdc++.h>
using namespace std;
int st[30];
int main()
{ int T; cin >> T; while (T--) { string s; cin >> s; for (int i = 0; i <...
目录 A. Perfect PermutationB. PartyC. Color the Picture A. Perfect Permutation code void solve()
{ cin>>n; rep(i,2,n)cout<<i<<' '; cout<<1<<endl; } B. Party 题意： 有一场party邀请大家吃蛋糕，一共有n个人和...
Codeforces Round #810 (Div. 2) A. Perfect Permutation 题目描述 构造一个含1~n的长度为n的数列，满足 p[i]/i有最小值 code #include<bitsdc++.h> using namespace std; const int N = 1e5 + 10; int n, m, k, t;
int a[N]; void solve()
{ c...
Codeforces Round #810 (Div. 2) D. Rain (线段树差分) 前言： 一道恶心了我近一天的题,共 180 180 180 行重复敲了 3 3 3 次 ， 不知道 d d d 了多久的 b u g bug bug ，还是线段树专题做的太少了。 题意： 给定一个 n n n ，这 n n n 天会降...
Problem - 1476B - Codeforces B. Inflation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You have a statistic of price changes for one product represented as an array of?nn?positive integers?...
