qq_44134712的博客

Description有一天，明明正在读小说，发现每一篇小说都是由许多单词构成的，但是明明发现一个单词会在一篇小说中出现多次。现在明明想知道每个单词分别在小说中出现多少次。Input第一个一个整数N,表示有多少个单词，接下来N行每行一个单词。每个单词由小写字母组成，N ≤ 200,单词长度不超过10^6Output输出N个整数，第i行的数字表示第i个单词在小说中出现了多少次。...

此题为字符串对齐#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[...

H - Jzzhu and CitiesCodeForces - 449BJzzhu is the president of country A. There arencities numbered from1tonin his country. City1is the capital of A. Also there aremroads connecting th...

C - FliptileFarmer 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...

还不会呢

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 ...

题目链接：https://vj.ti12z.cn/415c275cb0a15fcb4ede21b8cb5297de?v=1565418441代码：//Full of love and hope for life#include <iostream>#include <algorithm>#include <stdio.h>#include ...