![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法竞赛
冷萃泡泡茶
澳门科技大学在读
展开
-
Collegiate Programming Contest 2020 @ MUST Problem D
UVA 1629 Cake slicingAnswer key by ZhangXiuboPersonal blog : coldtea.techKey Point :DPRecursionSub-questionWhy DP?Every piece of cake has a similar state(Length and width, number of cherries)Every state can transfer to another state, and with the原创 2020-11-19 23:42:53 · 445 阅读 · 1 评论 -
高精度bigint
#include<bits/stdc++.h>using namespace std;#define maxn 1667 //合理原则长度 //Bigint f[5000 + 5];struct Bigint { int len; int a[maxn]; Bigint(int x=0) { memset(a, 0, sizeof(a));; for (len=1;x;len++) { a[len] += x % 10; x /= 10; } le原创 2020-11-19 22:09:14 · 306 阅读 · 0 评论 -
Collegiate Programming Contest 2020 @ MUST Problem A
UVA 1225 Digit CountingInspect author : Zhang Xiubopersonal blog : coldtea.techKey Point :String ProcessingC++ STLArray原创 2020-11-15 21:04:24 · 386 阅读 · 0 评论 -
竞赛技巧之字符串处理初探(一)
竞赛技巧之字符串处理初探(一)作者:冷萃泡泡茶摘要:本文简要叙述了如何在竞赛中处理字符串,具体方式是通过引入C++ STL中的String类。字符串的定义与初始化出于提高效率的目的,我们不从类与对象的角度来理解这件事情。#include <iostream>#include <string> using namespace std; int main (){ string str1 = "Hello"; string str2 = "World";原创 2020-11-07 15:22:29 · 370 阅读 · 0 评论