{"id":280,"date":"2011-12-04T09:23:59","date_gmt":"2011-12-04T09:23:59","guid":{"rendered":"http:\/\/sxkdz.0ginr.com\/blog\/?p=280"},"modified":"2011-12-04T09:25:45","modified_gmt":"2011-12-04T09:25:45","slug":"%e3%80%90%e8%bd%ac%e8%bd%bd%e3%80%91noip2011%e6%99%ae%e5%8f%8a%e7%bb%84%e9%a2%98%e8%a7%a3","status":"publish","type":"post","link":"https:\/\/sxkdz.0ginr.com\/blog\/?p=280","title":{"rendered":"\u3010\u8f6c\u8f7d\u3011NOIp2011\u666e\u53ca\u7ec4\u9898\u89e3"},"content":{"rendered":"

NOIP2011\u666e\u53ca\u7ec4\u89e3\u9898\u62a5\u544a
\n\u2014\u2014ahbbzeq 2011.11.25 \u8f6c\u8f7d\u8bf7\u6ce8\u660e\u6765\u6e90
\n\u4e00\u3001\u6570\u5b57\u53cd\u8f6c
\n\u6ca1\u5f97\u6ee1\u5206\u53ea\u80fd\u8bf4\u660e\u4e00\u4e2a\u95ee\u9898\uff0c\u4f60\u7684\u7a0b\u5e8f\u5199\u7684\u592a\u5c11\u4e86\u3002
\n[delphi]
\nprogram reverse;
\nvar
\n s:string;
\n i,sta:longint;
\nbegin
\n assign(input,’reverse.in’);reset(input);
\n assign(output,’reverse.out’);rewrite(output);<\/p>\n

readln(i);
\n str(i,s);
\n sta:=1;
\n if s[1]=’-‘ then
\n begin
\n write(‘-‘);
\n sta:=2;
\n end;
\n i:=length(s);
\n while (s[i]=’0’) and (i>sta) do
\n dec(i);
\n while (i>=sta) do
\n begin
\n write(s[i]);
\n dec(i);
\n end;<\/p>\n

close(input);close(output);
\nend.
\n[\/delphi]<\/p>\n

\u4e8c\u3001\u7edf\u8ba1\u5355\u8bcd\u4e2a\u6570
\n\u8003\u4f60\u7684\u57fa\u672c\u529f\uff0c\u548c\u5bf9\u7a0b\u5e8f\u7684\u7406\u89e3\uff0c\u5c24\u5176\u662f\u7ec6\u8282\u4e0a\u7684\u4f18\u5316\u3002\u76f4\u63a5\u5728\u6587\u7ae0\u4e2d\u9009\u51fa\u5355\u8bcd\uff0c\u4e0e\u7ed9\u5b9a\u5355\u8bcd\u957f\u5ea6\u4e00\u81f4\u65f6\u624d\u6bd4\u8f83\uff0c\u51fd\u6570\u4f20\u53c2\u6570\u65f6\u4e5f\u4e0d\u8981\u4f20\u5b57\u7b26\u4e32\uff08\u4f1a\u5f88\u6162\u7684\uff0c\u5177\u4f53\u6162\u591a\u5c11\u6ca1\u8bd5\uff09\u3002
\n[delphi]
\nprogram stat;
\nvar
\n s,p:ansistring;
\n i,j,first,num,len,c,k:longint;<\/p>\n

function cmp(x:longint):boolean;
\n var
\n i:longint;
\n begin
\n for i:= 1 to c do
\n if s[i]<> p[x+i-1] then exit(false);
\n exit(true);
\n end;
\nbegin
\n assign(input,’stat.in’);reset(input);
\n assign(output,’stat.out’);rewrite(output);<\/p>\n

readln(s);readln(p);
\n s:=upcase(s);p:=upcase(p);
\n c:=length(s); len:=length(p);
\n i:=1; num:=0; first:=-1;
\n while (s[i]=’ ‘)and (i<=len) do inc(i);\n while (i<=len) do\n begin\n j:=i+1;\n while (p[j]<>‘ ‘) and (j<=len) do\n inc(j);\n if (j-i = c) and cmp(i) then\n begin\n if first=-1 then first:=i;\n inc(num);\n end;\n i:=j; while (p[i]=' ') and (i<=len) do inc(i);\n end;\n if first=-1 then\n writeln(-1)\n else writeln(num,' ',first-1);\n \n close(input);close(output);\nend.\n[\/delphi]\n \n\u4e09\u3001\u745e\u58eb\u8f6e\n\u5b9e\u8df5\u8bc1\u660e\uff0c\u5982\u679c\u5355\u7eaf\u7684\u6392\u5e8fr\u6b21\uff0c\u5fc5\u7136\u7ed3\u679c\u662f\u8d85\u65f6\u3002\u4e8b\u5b9e\u4e0a\u53ea\u9700\u4e00\u6b21\u771f\u6b63\u610f\u4e49\u4e0a\u7684\u6392\u5e8f\u4ee5\u540e\uff0c\u5728\u4ee5\u540e\u7684\u6bd4\u8d5b\u4e2d\uff0c\u6309\u539f\u987a\u5e8f\u5206\u6210\u4e24\u7ec4\uff0c\u83b7\u80dc\u7ec4\u548c\u5931\u8d25\u7ec4\uff0c\u8fd9\u4e24\u7ec4\u4f9d\u7136\u662f\u6709\u5e8f\u7684\uff0c\u518d\u628a\u8fd9\u4e24\u7ec4\u5f52\u5e76\u6210\u4e00\u7ec4\uff0c\u5c31\u53ef\u4ee5\u4e86\u3002\u603b\u65f6\u95f4\u590d\u6742\u5ea6O\uff08N*R\uff09\u3002 \u4e3a\u4e86\u65b9\u4fbf\u5f52\u5e76\uff0c\u4e0b\u9762\u7684\u6570\u7ec4\u91c7\u7528\u4e86\u6eda\u52a8\u6570\u7ec4\u3002\n[delphi]\nprogram swiss_merger;\n\nvar\n n,r,q,i,j,k,c,pwin,plose:longint;\n s,w,t:array[1..200050] of longint;\n id:array[0..1,1..200050] of longint;\n \nprocedure qsort(n,m:longint);\n var\n i,j,k,t:longint;\n \n begin\n i:=n;j:=m; k:= id[0,(n+m)div 2];\n repeat\n while (s[id[0,i]] > s[k]) or (s[id[0,i]]=s[k]) and (id[0,i]k) do dec(j);
\n if i<=j then\n begin\n t:=id[0,i]; id[0,i]:=id[0,j];id[0,j]:=t;\n inc(i); dec(j);\n end;\n until i>j;
\n if n s[ id[1-c,plose] ]) or (s[id[1-c,pwin]] = s[ id[1-c,plose] ] ) and ( id[1-c,pwin]< id[1-c,plose] ) ) then\n begin\n id[c,j]:=id[1-c,pwin];\n inc(pwin,2);\n end\n else\n begin\n id[c,j]:=id[1-c,plose];\n inc(plose,2);\n end;\n end;\n writeln(id[c,q]);\n close(input);close(output);\nend.\n[\/delphi]\n\n\u56db\u3001\u8868\u8fbe\u5f0f\u7684\u503c\n\u7b97\u6cd5\u7c7b\u4f3c\u4e8e\u8868\u8fbe\u5f0f\u8ba1\u7b97\uff0c\u4e00\u4e2a\u7b26\u53f7\u6808\uff0c\u4e24\u4e2a\u6570\u636e\u6808\u3002\u8bb0f(s,0)\u8868\u793a\u8868\u8fbe\u5f0fs\u4e3a0\u7684\u65b9\u6848\u6570\uff0cf(s,1)\u8868\u793a\u8868\u8fbe\u5f0fs\u4e3a1\u7684\u65b9\u6848\u6570\u3002f(a+b,0) = f(a,0)*f(b,0) \uff0cf(a+b,1) = f(a,0)*f(b,0)+f(a,0)*f(b,1)+f(a,1)*f(b,0) , f(a*b,0)=f(a,0)*f(b,0) + f(a,1)*f(b,0) + f(a,0)*f(b,1) , f(a*b,1) = f(a,1) * f(b,1)\n[delphi]\nprogram exp;\nconst\n maxn= 100010;\n op:array[1..4] of char = ('(','+','*',')');\n \/\/ ( + * )\n flag:array[1..4,1..4] of char = (\n { ( } ('<','<','<','='),\n { + } ('<','>‘,’<','>‘),
\n { * } (‘<','>‘,’>’,’>’),
\n { ) } (‘>’,’>’,’>’,’>’));
\nvar
\n stack_op:array[1..maxn] of char;
\n stack_data0,stack_data1:array[1..maxn] of longint;
\n n,top_op,top_data,i,len:longint;
\n a0,a1,b0,b1,t0,t1:longint;
\n s:ansistring;
\n ch,now:char;
\nprocedure push_op(ch:char);
\n begin
\n inc(top_op);
\n stack_op[top_op]:=ch;
\n end;
\nfunction pop_op:char;
\n begin
\n pop_op:= stack_op[top_op];
\n dec(top_op);
\n end;
\nfunction gettop:char;
\n begin
\n gettop:=stack_op[top_op];
\n end;
\nprocedure push_data(a0,a1:longint);
\n begin
\n inc(top_data);
\n stack_data0[top_data]:=a0;
\n stack_data1[top_data]:=a1;
\n end;
\nprocedure pop_data(var a0,a1:longint);
\n begin
\n a0:=stack_data0[top_data];
\n a1:=stack_data1[top_data];
\n dec(top_data);
\n end;
\nfunction find(ch:char):integer;
\n var
\n i:longint;
\n begin
\n for i:= 1 to 4 do
\n if op[i]=ch then exit(i);
\n end;
\nbegin
\n assign(input,’exp.in’);reset(input);
\n assign(output,’exp.out’);rewrite(output);
\n top_op:=0; top_data:=0;
\n push_op(‘(‘); push_data(1,1);
\n readln(n);
\n readln(s); s:=s+’)’;
\n len:=length(s);
\n i:=1;
\n while i<=len do\n begin\n if i=22 then\n readln;\n case flag[find(gettop),find(s[i])] of\n\/\/ begin\n '<': begin push_op(s[i]); if (s[i]<>‘(‘) then push_data(1,1); inc(i); end;
\n ‘=’: begin now:=pop_op; inc(i); end;
\n ‘>’: begin
\n pop_data(a0,a1); pop_data(b0,b1);
\n now:=pop_op;
\n if now=’+’ then
\n begin
\n t0:= (a0*b0) mod 10007;
\n t1:= ( (a0*b1) mod 10007 +(a1*b1) mod 10007 + (a1*b0) mod 10007) mod 10007;
\n push_data(t0,t1);
\n end
\n else
\n begin
\n t0:= ( (a0*b1) mod 10007 + (a1*b0) mod 10007 + (a0 * b0) mod 10007 ) mod 10007;
\n t1:= (a1*b1) mod 10007;
\n push_data(t0,t1);
\n end;
\n end;
\n end;
\n end;
\n writeln(stack_data0[top_data]);
\n close(input); close(output);
\nend.
\n[\/delphi]<\/p>\n","protected":false},"excerpt":{"rendered":"

NOIP2011\u666e\u53ca\u7ec4\u89e3\u9898\u62a5\u544a \u2014\u2014ahbbzeq 2011.11.25 \u8f6c\u8f7d\u8bf7\u6ce8\u660e\u6765\u6e90 \u4e00\u3001\u6570\u5b57\u53cd\u8f6c \u6ca1\u5f97\u6ee1\u5206\u53ea\u80fd\u8bf4\u660e\u4e00\u4e2a\u95ee\u9898\uff0c\u4f60\u7684\u7a0b\u5e8f\u5199\u7684\u592a\u5c11\u4e86\u3002 [delphi] program reverse; var s:string; i,sta:longint; begin assign(input,’reverse.in’);reset(input); assign(output,’reverse.out’);rewrite(output); readln(i); str(i,s); sta:=1; if s[1]=’-‘ then begin write(‘-‘); sta:=2; end; i:=length(s); while (s[i]=’0’) and (i>sta) do dec(i); while (i>=sta) do begin write(s[i]); dec(i); end; close(input);close(output); end. [\/delphi] \u4e8c\u3001\u7edf\u8ba1\u5355\u8bcd\u4e2a\u6570 \u8003\u4f60\u7684\u57fa\u672c\u529f\uff0c\u548c\u5bf9\u7a0b\u5e8f\u7684\u7406\u89e3\uff0c\u5c24\u5176\u662f\u7ec6\u8282\u4e0a\u7684\u4f18\u5316\u3002\u76f4\u63a5\u5728\u6587\u7ae0\u4e2d\u9009\u51fa\u5355\u8bcd\uff0c\u4e0e\u7ed9\u5b9a\u5355\u8bcd\u957f\u5ea6\u4e00\u81f4\u65f6\u624d\u6bd4\u8f83\uff0c\u51fd\u6570\u4f20\u53c2\u6570\u65f6\u4e5f\u4e0d\u8981\u4f20\u5b57\u7b26\u4e32\uff08\u4f1a\u5f88\u6162\u7684\uff0c\u5177\u4f53\u6162\u591a\u5c11\u6ca1\u8bd5\uff09\u3002 [delphi] program stat; var s,p:ansistring; i,j,first,num,len,c,k:longint; function cmp(x:longint):boolean; var i:longint; begin […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,3],"tags":[51,52,35,5],"class_list":["post-280","post","type-post","status-publish","format-standard","hentry","category-1","category-3","tag-noip2011","tag-noip","tag-oi","tag-5"],"_links":{"self":[{"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/280","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=280"}],"version-history":[{"count":2,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/280\/revisions"}],"predecessor-version":[{"id":282,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/280\/revisions\/282"}],"wp:attachment":[{"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=280"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=280"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sxkdz.0ginr.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=280"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}