随笔分类 - POJ
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; const int maxn = 1005; const int N = 1000005; int data[maxn][maxn]; int nex
阅读全文
摘要：#include<iostream> #include<cstring> #include<bitset> #include<cstdio> using namespace std; const int maxn = 1005; bitset<maxn>data[maxn]; int n,m; vo
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; const int maxn = 100005; int data[maxn]; int n,m; bool test(int min){ int i,sum=0,group=1; fo
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<queue> #define ll long long #define N 50005 #define INF (1LL<<60) using namespace std;
阅读全文
摘要：#include<cstdio> int main(){ int a,b,c,t; scanf("%d",&t); while(t--){ scanf("%d%d%d",&a,&b,&c); if((b==9&&c==30)||(b==11&&c==30)||!((b+c)&1))printf("Y
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<queue> using namespace std; int ans; int data[10][10],visit[10][10]; struct Node{ int x
阅读全文
摘要：#include<iostream> #include<cstring> #include<cmath> #include<cstdio> using namespace std; struct Node{ int p,l,x; int di[105]; int d[105]; }node[105]
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int i,j,k,t,n,data[50],sum = 0; scanf("%d",&n); for(i=2;;i++){ sum += i; data[i]
阅读全文
摘要：#include<iostream> #include<cstdio> //#include<cmath> using namespace std; const int maxn = 50005; int log(int n){ int count = 0; while(n){ count++; n
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int cow[1005],edge[1005][1005],k,n,m,visit_sum[1005]; bool visit[1005]; voi
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int yh[15][15]; void init(){ int i,j; for(i=1;i<=10;i++){ yh[i][1] = 1; y
阅读全文
摘要：#include<iostream> #include<ctime> #include<algorithm> #include<cstdio> using namespace std; long long data[10005],d[10005]; void init(int n){ int j;
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int prime[20005]; void init(){ int i,j; memset(prime,0,sizeof prime); prime
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; int data[26] = {2,5,4,4,1,6,5,5,1,7,6,3,5,2,3,5,7,2,1,2
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; void init(int*data,bool*visit){ int t = 0; data[0] = 0; for(int i=1;i<=5000
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int ancestor[900]; struct Node{ int x,y,value; }node[900]; bool cmp(Node
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; char c[45][15]; int data[45][15],count,M; int edge[405][405],link[405],visi
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int i,j,k,n,h,h_t,f[30],d[30],sheng[30],t[30],ans_t[30][30],sum
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> #include<cstring> using namespace std; int n; double data[205][205],x[205],y[205]; void floyd(){ i
阅读全文
