Amiraitowa-优快云博客

原创 B. A New Technique

cf 1435 B判断第一个字符就好了，然后用map存下每一行，按照列的顺序就直接输出#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack&gt

2020-10-26 14:17:21 369

原创 A. Finding Sasuke

cf 1435 A把每个数从1到n倒序输出pow(-1,i)*a[n-i+1]#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#i

2020-10-26 14:10:39 327

cf 1430 C就只有最大为 ((n-2)+n)/2的时候不同#include<bits/stdc++.h>#pragma GCC optimize(3)#pragma GCC optimize(2)using namespace std;typedef long long ll;const int mod = 1e9 + 7;const int maxn = 1000010;ll n, m, k, i, j, t;ll ans, num, sum, cnt;ll a[m

2020-10-26 10:52:12 280

原创 B. Barrels

cd 1430 B找到你输入的n个水桶的k+1个最大值输出就ok了#include<bits/stdc++.h>#pragma GCC optimize(3)#pragma GCC optimize(2)using namespace std;typedef long long ll;const int mod = 1e9 + 7;const int maxn = 1000010;ll n, m, k, i, j, t;ll ans, num, sum, cnt;ll a[

2020-10-26 10:48:08 204

原创 A. Number of Apartments

cf 1430 A我比较菜，，只会暴力写 T_T#include<bits/stdc++.h>#pragma GCC optimize(3)#pragma GCC optimize(2)using namespace std;typedef long long ll;const int mod = 1e9 + 7;const int maxn = 1000010;ll n, m, k, i, j, t;ll ans, num, sum, cnt;ll a[maxn], b[

2020-10-26 10:45:50 175

原创 C. Increase and Copy

cf 1426 c最小的时候即是趋近于我们输入的n的算术平方根的时候#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#includ

2020-10-26 10:42:30 205

原创 A. Floor Number

A. Floor Number题意就是最下面的一层只能有两间房，你输入的x就是从第二层开始最大能够创建的房间数#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include

2020-10-26 10:38:15 267

原创 Two Arrays

cf 1417 B#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#include<queue>#include&lt

2020-09-29 10:38:11 314

原创 Copy-paste

cf 1417A主要思路：保证最小的数不变，把次小的数开始一直加到最接近T（ans<=T）的时候,记录加的次数输出就行。#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>

2020-09-29 10:24:40 736

原创 Arena of Greed

cf 1425 A 贪婪游戏思路：主要是判断当m>4且为4的倍数的时候，如何拿才能让自己获得最大的数量。#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include

2020-09-29 10:18:11 228

原创 Rock and Lever

cd 1420: B`#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#include<queue>#include&

2020-09-27 19:23:15 177

原创 Pokémon Army (easy version)

cf 1420: B#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#include<queue>#include&l

2020-09-27 19:17:31 182

原创 Cubes Sorting

cf 1420: A#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<cstdio>#include<map>#include<set>#include<string>#include<utility>#include<stack>#include<queue>#include&l

2020-09-27 19:14:37 239

原创 template的快读与快写

以下是使用模板template的快读与快写，它可以读取任何格式的整型数据。template <typename T>void read(T &x) /*快读*/{ x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); } while (isdigit(c

2020-09-27 15:17:04 517

原创莫比乌斯-欧拉筛

莫比乌斯函数-欧拉筛法#include<stdio.h>#include<string.h>long long prime[5500000];long long vis[5500000];long long mo[5500000];int main(){ int i,j,ans=0; mo[1]=1; for(i=2; i<=11...

2019-12-30 19:34:02 272 1

Amiraitowa的博客