本文版权归点A点C和博客园共有,欢迎转载,但必须保留此段声明,并给出原文连接,谢谢合作!!!

随笔分类 -  codeforces

Codeforces Beat Round#57(Div.2)
摘要:A. Tabletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSimon has a rectangular table consisting ofnrows andmcolumns. Simon numbered the rows of the table from top to bottom starting from one and the columns — from left to right starting from one. 阅读全文

posted @ 2013-11-09 22:07 点A点C 阅读(212) 评论(0) 推荐(0)

Codeforces Beta Round #55 (Div. 2)
摘要:B题#include #include#includeusing namespace std;int main(){int n,a,sum=0,min=101;scanf("%d",&n);while(n--){scanf("%d",&a);sum+=a;if(a%2==1&&a#include#include #include using namespace std;int main(){ char s1[105]; char s2[105]; int zimu[27]; char out[105]; int n; wh 阅读全文

posted @ 2013-11-08 10:54 点A点C 阅读(312) 评论(0) 推荐(0)

Codeforces Beta Round #49 (Div. 2)-D. Physical Education
摘要:D. Physical Educationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the childre 阅读全文

posted @ 2013-10-10 20:53 点A点C 阅读(265) 评论(0) 推荐(0)

Codeforces Beta Round #49 (Div. 2)-C. Little Frog
摘要:C. Little Frogtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there arenmounds on the swamp, located on one line. The distance between the neighb 阅读全文

posted @ 2013-10-10 20:44 点A点C 阅读(357) 评论(0) 推荐(0)

使用STL的next_permutation函数生成全排列(C++)
摘要:文章作者:姜南(Slyar)文章来源:Slyar Home (www.slyar.com) 转载请注明,谢谢合作。下午研究了一下全排列算法,然后发现C++的STL有一个函数可以方便地生成全排列,这就是next_permutation在C++ Reference中查看了一下next_permutation的函数声明:#include <algorithm>bool next_permutation( iterator start, iterator end );Thenext_permutation() function attempts to transform the given 阅读全文

posted @ 2013-04-20 18:39 点A点C 阅读(334) 评论(0) 推荐(0)

Codeforces Beta Round #77 (Div. 2 Only)-A. Football
摘要:time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a str 阅读全文

posted @ 2013-04-20 17:24 点A点C 阅读(462) 评论(0) 推荐(0)

Codeforces Round #176 (Div. 2)总结-A. IQ Test
摘要:A. IQ Testtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the city of Ultima Thule job applicants are often offered an IQ test.The test is as follows: the person gets a piece of squared paper with a4 × 4square painted on it. Some of the s 阅读全文

posted @ 2013-04-13 19:00 点A点C 阅读(771) 评论(0) 推荐(0)

导航