I good vegetable a!

Milk Patterns Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 14392   Accepted: 6384 Case Time Limit: 2000MS Description Farmer John has noticed that th

Description Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Each test case consists of one string, whose length is Output For each

Description 　　喜欢钻研问题的JS同学，最近又迷上了对加密方法的思考。一天，他突然想出了一种他认为是终极的加密办法 ：把需要加密的信息排成一圈，显然，它们有很多种不同的读法。例如下图，可以读作：JSOI07 SOI07J OI07JS I07JSO 07JSOI 7JSOI0把它们按照字符串的大小排序：07JSOI 7JSOI0 I07JSO JSOI07 OI07JS SOI0

比赛链接：http://codeforces.com/contest/822A. I’m bored with life解法：水题，模拟一下。#include <bits/stdc++.h> using namespace std;int main() { int A,B; scanf("%d%d",&A,&B); int C=min(A,B),ans=1; for(

Musical Theme Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 26997   Accepted: 9096 Description A musical melody is represented as a sequence of N (1<=N<=2000