CodeForces
紫杉丶
这个作者很懒,什么都没留下…
展开
-
CodeForces 448B Suffix Structures
题意:如果串A中包含串B的所有字母, 并且这些字母在串A和串B中排列顺序相同, 输出“automaton”, 否则,如果串A中包含串B的所有字母, 我们在这种情况下在进行讨论,如果A和B的长度相等, 输出“array”,如果A比B长,输出“both”, 否则输出“need tree”。#include "stack"#include "cstdio"#include "iostre原创 2015-03-10 18:15:21 · 399 阅读 · 0 评论 -
CodeForces 144C Anagram Search
Anagram Searchtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA string t is called an anagram of the string s, if原创 2015-03-16 21:15:10 · 404 阅读 · 0 评论 -
Codeforces 2A Winner (STL map使用)
A. Winnertime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputThe winner of the card game popular in Berland "Berlogg原创 2015-02-09 10:33:39 · 571 阅读 · 0 评论 -
CodeForces 7C Line (扩展欧几里得)
前面忘记修改gcd,一直求不出来。。。套套模板轻松水,,#include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype"原创 2015-04-02 22:33:02 · 361 阅读 · 0 评论 -
CodeForces 7A Kalevitch and Chess
dfs都不需要,由于题目只给8*8的范围,所以直接暴力就好了。。。#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstrea原创 2015-04-02 22:34:37 · 348 阅读 · 0 评论