good vegetable!

Vjudge题目链接，STL的队列，模拟队列即可，注意输入n=1的情况（坑点，每行首尾没空格）。#include<cstdio>#include<iostream>#include<queue>using namespace std;int main(){ int n; while(~scanf("%d", &n) &&...

Vjudge题目链接，水题，判断6个矩形能不能构成一个长方体。构成长方体：平行面的矩形相同；长宽高至多是三个不同的数#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<set>using namespace std;...

Vjudge题目链接，水题，判断一个字符串是不是另一个字符串的子序列和归并排序的merge一样，双下标扫，注意数组开小了会RE#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int maxn...

Vjudge题目链接，水题，找一个字符串的周期，注意输入输出格式。周期从1开始枚举即可#include<cstdio>#include<iostream>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int main()...

Vjudge题目链接，水题，题目怎么说就怎么写。1e4 就算是n2n^2n2也能过，何况根本到不了n2n^2n2Sample Input2313Sample Output0 1 1 1 0 0 0 0 0 01 6 2 2 1 1 1 1 1 1#include<cstdio>#include<iostream>#include<cstrin...

Vjudge题目链接，计算分子式的分子量。思路：从前往后扫写了一下发现很麻烦，于是从后往前扫，遇到数字计算正序的数字，遇到字母就计算ans += (mp[s[i]] * (tot == 0 ? 1 : tot));tot = 0;//tot=0表示遇到这个字母前没遇到数字，所以上面是0就乘1Sample Input4CC6H5OHNH2CH2COOHC12H22O11Sa...

Vjudge题目链接，水题，恢复代码能力用。题意：连续的几个’O’就计几分，一个’X’计0分。#include<cstdio>#include<iostream>#include<cstring>using namespace std;int main(){ int ans = 0, tot, T; cin>>T; ...