南阳师范学院ACM官方博客

摘要： find()函数可以帮助你在两个字符串之间，查找很多他们的关系。。。#include#includeusing namespace std;int main(){ string s,s2; int n; cin>>n; while(n--) { cin>>s>>s2; string fla... 阅读全文

摘要： 夹角有多大(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9312Accepted Submission(s): 3719P... 阅读全文

摘要： 描述现在，有一行括号序列，请你检查这行括号是否配对。输入第一行输入一个数N（0#include#include#include#includeusing namespace std;struct sStack{ char sign[10010]; int top;};void initstack(s... 阅读全文

摘要： 母牛的故事Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42986 Accepted Submission(s): 21357Problem D... 阅读全文

摘要： 整除的尾数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23920 Accepted Submission(s): 10162Problem D... 阅读全文

摘要： A + B AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15391 Accepted Submission(s): 6713Prob... 阅读全文

摘要： 寻人启事：2014级新生看过来！夹角有多大IITime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7200 Accepted Submission(s... 阅读全文

摘要： Palindromes _easy versionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21769Accepted Submission(... 阅读全文

摘要： Lowest Common Multiple PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33483Accepted Submissio... 阅读全文

摘要： Problem Description“回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。请写一个程序判断读入的字符串是否是“回文”。Input输入包含多个测试实例，输入数据的第一行是一个正整数n,表示测试实例的个数，后面紧跟着是n个字符串。Output如果一... 阅读全文