摘要： Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the qu 阅读全文

摘要： A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different. Kerem recently got a string s consisting of low 阅读全文

摘要： Kefa decided to celebrate his first big salary by going to the restaurant. He lives by an unusual park. The park is a rooted tree consisting of n vert 阅读全文

摘要： Little girl Susie went shopping with her mom and she wondered how to improve service quality. There are n people in the queue. For each person we know 阅读全文

摘要： Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are nplayers (including Limak himself) and right 阅读全文

摘要： You've got array a[1], a[2], ..., a[n], consisting of n integers. Count the number of ways to split all the elements of the array into three contiguou 阅读全文

摘要： 题目描述 There is a sequence with n integers, your task is finding there are how many consecutive subsequences have two characters:1.The length of the sub 阅读全文

摘要： 题目描述 天国的地铁遭到了冥王哈乙丁的破坏，神圣军团的总司令爱神下令天国的地铁侠们携手542基地对冥王哈乙丁展开了激烈的斗争。天国中的 m 条地铁通道连接了 n 个实验室，如今所有的实验室已经被哈乙丁破坏。如果地铁要在两个实验室之间来往，那么地铁在它们之间经过的实验室必须是完好的。 地铁侠（江湖人称 阅读全文

摘要： 2SAT问题模板 又犯蠢啦啊啊啊啊啊 想当然的直接读取字符串以第二位作为a和b了，找了半天错误，欸 --正文 因为n很小直接使用floyd来判断连通性 阅读全文

摘要： 题目描述 刷题是每个ACMer必由之路，已知某oj上有n个题目，第i个题目小X能做对的概率为Pi(0<=Pi<=1，1<=i<=n) 求小X至少做对k道题的概率 输入 第一行输入一个正整数t，(t<=20)，表示有t组测试样例。 第二行输入正整数n，k，（1<=n,k<=1000） 第三行输入n个小 阅读全文