Phoebe201421085-CSDN博客

原创 poj3320

#include #include #include # include using namespace std;int a[1000005],p;setint>com;mapint,int>mp;int main() /*尺取法*/{ //freopen("in.txt","r",stdin); cin>>p; com

2015-04-19 10:17:26 1284

原创 poj3278

#include #include using namespace std;long long a[200020][2];bool b[200020];int main(){ long long n,k,f,r,maxx=100000; cin>>n>>k; for (f=0;f200000;f++) b[f]=0; f=1;r=f; a[f]

2015-04-19 10:16:41 415

原创 poj3299

#include #include #include using namespace std;double HH(double TT,double DD){ double h,e; e=6.11*exp(5417.7530*((1/273.16)-(1/(DD+273.16)))); h=0.5555*(e-10.0); return TT+h;}

2015-04-19 10:16:12 435

原创 poj3273

#include #include using namespace std;long long n,m,a[100005];long long check(long long mid){ long long total=0; long long s=0; for (int i=1;in;) { while (s+a[i]mid&

2015-04-19 10:14:01 328

原创 poj3258

#include #include #include using namespace std;long long rock[50005],l,n,m;bool check(long long d){ int total=0,i=1,j=1; while (in) { j=i+1; while (rock[j]-rock[i]

2015-04-19 10:11:24 349

原创 poj3122

#include #include #include double pi=acos(-1.0),eps=1e-6; /*pi的取值*/int t;long long pie[10005];using namespace std;bool div(double s,int n,int f){ double nn=0; for (int i=1;in;i++)

2015-04-19 10:09:03 490

原创 poj3094

#include #include #include using namespace std;int main(){ char a[300]; int i,n; long long sum; // freopen("in.txt","r",stdin); gets(a); while (a[0]!='#') { sum=

2015-04-19 10:04:59 346

原创 poj3061

#include #include #include using namespace std;int a[100010];int main(){ long long n,s,t,sum,ans; int left,right,i,j; // freopen("in.txt","r",stdin); cin>>t; for (j=1;jt;j++

2015-04-19 09:51:52 306

原创 poj3006

#include #include #include using namespace std;int main(){ bool a[1000005],p[1000005]; int i,j,t,d,n; long long c; // freopen("in.txt","r",stdin); memset(a,true,sizeof(a));

2015-04-19 09:51:39 492

原创 poj2996

#include #include using namespace std;int main(){ char chess[20][33],loca[65][4]; int i,j,t; // freopen("in.txt","r",stdin); for (i=1;i17;i++) for (j=1;j33;j++) cin>>chess[i]

2015-04-19 09:48:51 422

原创 poj2993

#include #include #include using namespace std;int main(){ char chess[20][40],whi[20][5],bla[20][4]; string color,white,black; int i,j,k,tw,tb,l; //freopen("in.txt","r",stdin);

2015-04-19 09:48:08 417

原创 poj2965

#include #include using namespace std;struct game{ char p[4][4]; char f[4][4]; int n,i,j,up;};game dl[100000],a;char fan(char kaig){ if (kaig=='-') return '+';else return '-

2015-04-19 09:39:03 386

原创 poj2739

#include #include using namespace std;int main(){ int a[10005],i,j,n,t; long long sum; //freopen("in.txt","r",stdin); for (i=1;i10005;i++) a[i]=1; a[1]=0; for (i=2;i10005;i

2015-04-19 09:32:44 539

原创 poj2833

#include #include #include #include using namespace std;long long maxx[15],minx[15],total,r;double avr;int main(){ int n1,n2,n,i; // freopen("in.txt","r",stdin); while (1) {

2015-04-19 09:32:29 402

原创 poj2636

#include using namespace std;int main(){ int n,k,m,i,j,tol; cin>>n; for (i=1;in;i++) { cin>>m; tol=1-m; for (j=1;jm;j++) { cin>>k;

2015-04-19 09:29:27 295

原创 poj2635

#include #include #include #include using namespace std;int main(){ char ss[110]; bool pa[1000010]; long long b; int a[110],i,j,g,l,s,judge,k; // freopen("in.txt","r",stdin);

2015-04-19 09:26:53 285

原创 poj2488

#include #include using namespace std;int step[900][2],a[30][30],p,q,bingo,n;int dicy[8] = {-2,-2,-1,-1,1,1,2,2};int dicx[8] = {-1,1,-2,2,-2,2,-1,1};void print(){ int i,j; for (i=1;ip;i+

2015-04-19 09:18:57 274

原创 poj2386

#include #include using namespace std;char a[110][110];int n,m, xx[8]={-1,-1,-1,0,0,1,1,1}, yy[8]={-1,0,1,-1,1,-1,0,1}, vis[110][110];void did(int i, int j,int k){ if (i1||j1|

2015-04-19 09:12:09 402

原创 poj2388

#include #include using namespace std;int main(){ int a[10100],n; cin>>n; for (int i=1;in;i++) cin>>a[i]; sort(a+1,a+n+1); couta[(n+1)/2]; return 0;}【题意】给定n（n为奇数）个数，输出其中位数

2015-04-19 09:12:06 225

原创 poj2262

#include #include #include #include using namespace std;int main(){ bool a[1000005],p[1000005]; int i,j,n; // freopen("in.txt","r",stdin); memset(a,true,sizeof(a)); memset(p,fa

2015-04-19 09:07:35 407

原创 poj2255

#include #include #include using namespace std;struct tr{ char c; int l; int r;}s[30];int k,n;string a,b;int find(int a1,int a2,int b1,int b2)//找出根的编号{ // cout int i,j

2015-04-19 08:58:25 384

原创 poj2159

#include #include #include #include #include using namespace std;int main(){ int i,n,a[30],b[30]; char org[200],code[200]; bool judge; //freopen("in.txt","r",stdin); scanf("

2015-04-19 08:57:39 329

原创 poj1804

#include #include using namespace std;long long sum;void add(int a[],int l,int m,int r) //归并{ int i,j,k,b[r-l+2]; i=l;j=m+1; for (k=1;im&&jr;k++) { if (a[i]a[j])

2015-04-19 08:55:12 286

原创 poj1573

#include #include using namespace std;int main(){ char grid[12][12]; int trace[12][12]; int m,n,k,c1,c2,i,j,ju,step,loop; //freopen("in.txt","r",stdin); cin>>m>>n>>k; while

2015-04-18 23:02:53 382

原创 poj1503

#include #include #include #include using namespace std;int main(){ int a[20000],b[20000],i,l1,l2; char s1[200],s2[200]; //freopen("in.txt","r",stdin); memset(a,0,sizeof(a));

2015-04-18 22:56:45 342

原创 poj1363

#include #include using namespace std;int main(){ int n,a[1005],z[1005],t,f,r,i; // freopen("in.txt","r",stdin); cin>>n; while (n>0) { cin>>a[1]; while (a[1]>0)

2015-04-18 22:55:40 309

原创 poj1166

#include using namespace std;int main(){ int i,a[10],b[10],c[10]; for(i=1;i9;i++) cin>>a[i]; for(b[1]=0;b[1]3;b[1]++) /*每个钟最多转三次，四次则等于没转，4的9次方钟可能，同理，翻棋子，按开关等每个最多操作一次 ,用BFS会超时！

2015-04-18 22:49:15 477

原创 poj1111

#include #include using namespace std;int a[30][30],b[30][30],n,m,x,y,que[900][2],f,r;int dicx[8]={1,1,1,0,0,-1,-1,-1}, dicy[8]={-1,0,1,-1,1,-1,0,1}, dx[4]={1,-1,0,0}, dy[4]={0,0,1,-

2015-04-18 22:48:34 411

原创 poj1101

#include #include using namespace std;int w,h,x1,x2,y1,y2,a[80][80],f[80][80],best,now, dx[4]={0,0,-1,1}, dy[4]={-1,1,0,0};void dfs(int xx,int yy,int dd){ int i,x,y; if (nowbes

2015-04-18 22:30:05 1315

原创 poj1083

#include #include #include using namespace std;int a[210];int main(){ int k,n,x,y,i,j,l; // freopen("in.txt","r",stdin); cin>>k; for (l=1;lk;l++) { cin>>n; me

2015-04-18 22:24:29 246

原创 poj1068

#include #include using namespace std;int main(){ int n,m,i,j,k,t,z,x; char p[1000000]; //freopen("in.txt","r",stdin); cin>>n; for (i=1;in;i++) { cin>>m; //还原

2015-04-18 22:09:27 457

原创 poj1004

#include #include using namespace std;int main(){ double sum,mou; int i; // freopen("in.txt","r",stdin); sum=0; for (i=1;i12;i++) { cin>>mou; sum+=mou; } sum=

2015-04-18 22:07:08 348

原创 poj1001

多精度乘单精度#include #include #include using namespace std;int main(){ char rr[6]; int a[2000],n,r,i,j,t,k,w; // freopen("in.txt","r",stdin); //scanf("%s",rr);cin>>n; while (ci

2015-04-18 21:55:11 278

原创 poj1936

#include #include #include using namespace std;int main(){ char a[100010],b[100010]; while (scanf("%s%s",a,b)!=EOF) { int i,j; for (i=0,j=0;a[i]!='

2015-04-17 23:21:25 274

原创 poj1442

#include #include #include using namespace std;int main(){ long long m,n,a[30010],u[30010]; cin>>m>>n; for (int i=1;i>a[i]; for (int j=1;j>u[j]; priority_qu

2015-04-17 23:17:38 827

原创 poj2586

#include #include using namespace std;int main(){ long long s,d,ans; while (cin>>s>>d) { if (d>4*s) ans=10*s-2*d; else if (2*d>3*s) ans=8*s-4*d;

2015-04-17 23:10:05 254

原创 poj1328

#include #include #include #include using namespace std;const int maxx=1010;struct node{ double left,right;}a[maxx];bool cmp(node i,node j){ return i.le

2015-04-17 23:08:42 315

原创 poj1011

#include #include #include using namespace std;int len[75],used[75],ans,sum,n;bool cmp(int a,int b){ return a>b;}bool check(int pos/*当前小木棍编号*/,int stk/*当前长木棍剩余长度*

2015-04-17 23:01:09 222

原创 poj2796

#include #include using namespace std;long long a[100010],from[100010],to[100010],sum[100010],n;int main(){ int i,j; cin>>n; for (i=1;i { scanf("%I

2015-04-17 22:58:27 422

原创 poj2676

#include #include using namespace std;char a[10][10];int sd[10][10],flag;bool check(int n,int num){ for (int i=0;i if (sd[i][n%9]==num) return false; for (in

2015-04-17 22:56:20 448

空空如也

空空如也