- 博客(3)
- 收藏
- 关注
RSS订阅原创 筛选法求素数
#define MAX 66666 int pa[MAX+1]={2,2},pb[MAX/2]; void GetPrime() { int i,j,k=0; int n=MAX/2; for(i=2;i<=n;i++) if(!pa[i]) { pb[k++]=i; for(j=i+i;j<=MAX;j+=i) pa[j]=1; } for(;i<=MAX;i++)
2014-08-20 15:33:29
407
转载 线段树模板
#include #include int qq[200005]; int max(int a,int b) { if(a<b) return b; return a; } struct node { int left,right,max; int mid() { return (left+right)/2; } }q[600005]; int build(int a,in
2014-08-12 16:35:58
350
原创 String to Palindrome
Problem H String to Palindrome Input: Standard Input Output: Standard Output Time Limit: 1 Second In this problem you are asked to convert a string into a palindrome with minimum number of ope
2014-08-07 15:51:13
498
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人