题目链接 Problem Description When online chatting, we can save what somebody said to form his ''Classic Quotation''. Little Q does this, too. What's more? He even changes the original words. Formally, we can assume what somebody said as a string S w...

2018-06-17 21:56:44

描述 写一个程序，找出给出素数范围内的所有孪生素数的组数。一般来说，孪生素数就是指两个素数距离为2，近的不能再近的相邻素数。有些童鞋一看到题就开始写程序，不仔细看题，咱们为了遏制一下读题不认真仔细的童鞋，规定，两个素数相邻为1的也成为孪生素数。 输入 第...

2018-06-17 21:56:44

#includeiostream using namespace std; int main(){ int i,j,m,n; i = 8 ; j = 10 ; m =++i+j++ ; n =(++i)+(++j)+ m; cout i ' \t ' j ' \t ' m ' \t ' n endl; return 0 ; }...

2018-06-17 21:56:13

C++远征之封装篇（上）笔记 所有内容都是听课笔记，愿课堂视频如下： C++远征之封装篇(上)-慕课网 http://www.imooc.com/learn/382 类和对象 1 什么是类，什么是对象？ 对象是具体的事物，而类是出于不同的目的从对象中抽象出来的，所以，同一事物可以抽象成不同的类。...

2018-06-17 21:56:41

因为本人对web机制了解较少，在使用C/libcurl中遇到了很多问题。主要的解决方式： 1，在网页源码中找到提交form的定位。也就是网页文件对应 form 中的 action 属性。往往都是提交到jsp或者php等脚本中运行的，而不是直接提交到本网页。 2，要注意 http头 。 http头的不...

2018-06-17 21:56:39

题目链接 Problem Description Uncle Mao is a wonderful ACMER. One day he met an easy problem, but Uncle Mao was so lazy that he left the problem to you. I hope you can give him a solution. Given a string s, we define a substring that happens exactly...

2018-06-17 21:56:34

Distance in Tree CodeForces - 161D 题意：给一棵n个结点的树，任意两点之间的距离为1，现在有点u、v，且u与v的最短距离为k，求这样的点对(u,v)的个数（(u,v)/(v,u)算一对）。 方法： ans[i][k]表示与i结点距离为k的子结点个数 ans[i][k]=sum{ans[son][k-1]} ans[i][0...

2018-06-17 21:56:32

题目链接 Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a game with these n gems. They place the gems in a row and decide to take turns to take gems from left to right. Alice goes first and takes 1 or 2...

2018-06-17 21:56:31

array array array Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 459Accepted Submission(s): 282 Problem Description One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan...

2018-06-17 21:56:01

...

2018-06-17 21:56:27