Thank_you

一点发现

BFS标记路径(1) C F 水题(20) dfs(1) SDNUOJ(26) string(1) vector(1) 一点算法(3) 冒泡排序(1) 强制改变类型(1) 快速幂（取模）(1) 所谓函数(1) 数组a[-1](1) 未归档(62) 栈stack(1) 线性筛(1) 队列queue(1) 随笔(1)

/ 注册

全部文章 / 一点发现（共3篇）

This is a very simple problem! Your only job is to calculate a + b + c + d!

题目链接：https://ac.nowcoder.com/acm/contest/338/G 原文链接：https://blog.csdn.net/ordinarv/article/details/85932520 There are several cases. In the first lin...

2019-01-06

0 783

upper_bound and lower_bound

#include <bits/stdc++.h> using namespace std; int main() { int b[11] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int a[11] = {0, 1, 1, 1, 2, ...

2018-12-14

0 418

字符串数组

#include<cstdio> #include<iostream> #include<cstring> using namespace std; int main() { string s[100]; int n; while(cin...

2018-11-23

0 354