重新学编程之待补题
ZZ --瑞 hopeACMer
WA就完事了
展开
-
明明的字符串
Description 有一天,明明正在读小说,发现每一篇小说都是由许多单词构成的,但是明明发现一个单词会在一篇小说中出现多次。现在明明想知道每个单词分别在小说中出现多少次。 Input 第一个一个整数N,表示有多少个单词,接下来N行每行一个单词。每个单词由小写字母组成,N ≤ 200,单词长度不超过10^6 Output 输出N个整数,第i行的数字表示第i个单词在小说中出现了多少次。...原创 2019-06-26 18:40:26 · 115 阅读 · 0 评论 -
J - Alignment of Code(25) (UVA - 1593 )
此题为字符串对齐 #include<cstdio> #include<algorithm> #include<cstring> using namespace std; int MAX_len[200], MAX_num; struct line { char str[200]; int num[200]; int len; } L[...原创 2019-06-28 20:17:34 · 120 阅读 · 0 评论 -
Codeforces 449B Jzzhu and Cities(最短路计数+迪杰斯特拉最小堆优化)
H - Jzzhu and Cities CodeForces - 449B Jzzhu is the president of country A. There arencities numbered from1tonin his country. City1is the capital of A. Also there aremroads connecting th...转载 2019-07-29 20:29:41 · 149 阅读 · 0 评论 -
C - Fliptile (黑白棋翻转经典题型 DFS)
C - Fliptile Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate anM×Ngrid (1 ≤M...原创 2019-07-26 20:13:50 · 1441 阅读 · 0 评论 -
E - Ambush UVALive - 8267(网络流)
还不会呢原创 2019-07-31 19:19:30 · 145 阅读 · 0 评论 -
B - Neither shaken nor stirred URAL - 2013 (dfs)
The ACM ICPC regional contest in St. Petersburg is a stressful event even for veterans of competetive programming. That’s why for the last four years programmer Denchik and his coach Vova go to their ...原创 2019-08-07 20:22:20 · 188 阅读 · 0 评论 -
E - Cupcakes Gym - 101243E (贪心)
题目链接:https://vj.ti12z.cn/415c275cb0a15fcb4ede21b8cb5297de?v=1565418441 代码: //Full of love and hope for life #include <iostream> #include <algorithm> #include <stdio.h> #include ...原创 2019-08-12 20:42:53 · 115 阅读 · 0 评论