sinat_35121480的博客

#include#include#include#include#includeusing namespace std;#define N 100000int h=0;bool p[N];int prime[N];void db(){ memset(p,true,sizeof(p)); for(int i=2;i<N;i++) { if(p[i]==true)

templateinline bool scan_d(T &ret){ char c; int sgn; if(c=getchar(),c==EOF) return 0; while (c != '-' && (c '9') ) c = getchar(); sgn = (c == '-') ? -1 : 1; ret = (c == '-') ? 0

// poj3070#include#include#includeusing namespace std;struct jz{ int a[2][2]; void init(){ a[0][0]=a[0][1]=a[1][0]=1; a[1][1]=0; }};jz multi(jz a,jz b){ jz c; for(int i=0;i<2;i++) {

http://acm.hdu.edu.cn/showproblem.php?pid=1863// >File Name: 最小生成树Kruskal.cpp// > Author: Webwei#include#include#define MAX 113using namespace std;struct edge{ int from,to; long

//hdu 1042#include#include#define MAX 100000using namespace std;int main(){ int a[MAX] = { 0 }; int n; int i, j, k, count, temp; while (cin >> n) { a[0] = 1;