摘要: 题目链接 https://pintia.cn/problem-sets/1218774283169423360/problems/1218774532776648715 方法一, 见代码 #include <cstdio> #include <iostream> #include <algorith 阅读全文
posted @ 2020-01-28 22:11 hulian425 阅读(323) 评论(0) 推荐(0)
摘要: 题目链接 dp[i] 表示“iloveyou”这个字符串中第i个字母已经出现的“有效次数”; 代码 #include<iostream> #include<cmath> using namespace std; const ll mod = 20010905; ll dp[9]; int main( 阅读全文
posted @ 2020-01-28 19:17 hulian425 阅读(118) 评论(0) 推荐(0)
摘要: #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> using namespace std; #define MAXN 10 // 顶点个数最大值 struct Arcnode 阅读全文
posted @ 2020-01-28 16:40 hulian425 阅读(125) 评论(0) 推荐(0)