锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久久精品日本一区二区三区 ,97久久精品人人做人人爽,国产精品青草久久久久福利99http://www.shnenglu.com/zzfmars/category/14380.html琛岃儨浜庤█錛屽琛屾棤鐩婏紝鎬濅負琛屽厛銆傛湁鎵涓猴紝鏈夋墍涓嶄負銆傝繘濡傜櫥錛岄濡傚穿錛屽潥鎸佹墠鑳芥垚闀褲?/description>zh-cnMon, 23 Aug 2010 20:58:44 GMTMon, 23 Aug 2010 20:58:44 GMT60pku1218http://www.shnenglu.com/zzfmars/archive/2010/08/23/124452.htmlKevin_ZhangKevin_ZhangMon, 23 Aug 2010 10:40:00 GMThttp://www.shnenglu.com/zzfmars/archive/2010/08/23/124452.htmlhttp://www.shnenglu.com/zzfmars/comments/124452.htmlhttp://www.shnenglu.com/zzfmars/archive/2010/08/23/124452.html#Feedback0http://www.shnenglu.com/zzfmars/comments/commentRss/124452.htmlhttp://www.shnenglu.com/zzfmars/services/trackbacks/124452.html----------------------------------------------------------------姝ユ涓鴻惀錛屽悇涓嚮鐮?--------------------------------------------------------------
灝辨槸姹備竴涓暟鐨勭害鏁頒釜鏁般傝嫢鏈夊鏁頒釜綰︽暟錛屽紑闂紱鍋舵暟涓紝鍏抽棬銆?br>璁炬湁涓鏁癗鏈夋湁綰︽暟B錛屽垯蹇呮湁鍙︿竴綰︽暟N/B錛屽叾鎬繪槸鎴愬鍑虹幇銆?br>鎯熺嫭瀹屽叏騫蟲柟鏁癗=B*B錛屾鏄彧鏈変竴涓害鏁頒簡錛屽畬鍏ㄥ鉤鏂規暟鐨勭害鏁頒負濂囨暟涓?/p>
#include"iostream"
#include
"stdio.h"
using namespace std;

int a[12],b[12],t,n,asw;

int num(int n)
int i=0;
  
while(n>=b[i])//n<b[i] stop out a[i-1]
 {
  i
++;
 }

  
return a[i-1];

}

int main()
{
    
for(int i=1;i<=12;i++)
    
{a[i-1]=i;
     b[i
-1]=i*i;
    }

    scanf(
"%d",&t);
    
while(t)
    
{scanf("%d",&n);
     asw
=num(n);
     printf(
"%d\n",asw);
     t
--;
    }

    
return 0;
}


]]>
pku1102妯℃嫙http://www.shnenglu.com/zzfmars/archive/2010/08/23/124423.htmlKevin_ZhangKevin_ZhangMon, 23 Aug 2010 08:25:00 GMThttp://www.shnenglu.com/zzfmars/archive/2010/08/23/124423.htmlhttp://www.shnenglu.com/zzfmars/comments/124423.htmlhttp://www.shnenglu.com/zzfmars/archive/2010/08/23/124423.html#Feedback0http://www.shnenglu.com/zzfmars/comments/commentRss/124423.htmlhttp://www.shnenglu.com/zzfmars/services/trackbacks/124423.htmlhttp://acm.pku.edu.cn/JudgeOnline/problem?id=1102 
鏈鐩噸鐐瑰湪浜庤緭鍑虹殑鎺у埗涓婏紝鍥犱負涓嶈兘浠庝笅寰涓婅緭鍑猴紝鍥犳杈撳嚭鏃舵槸浠庡乏寰鍙籌紝鑷笂鑰屼笅鐨勮緭鍑恒傛暟瀛桸鐪嬫垚瀛楃涓叉潵澶勭悊銆備竴鍏卞崄涓瓧絎︼紝濡備綍鎺у埗銆傦棘錛o激杈撳嚭錛屽張鍙竷孌墊暟鐮佺錛岀敱姝ゅ彲浠ュ緱鍒板惎鍙戯紝錛戯紣涓瓧絎︼紝姣忎釜瀛楃錛楁錛屽垯寤轟竴涓紬錛革紤錛愮殑浜岀淮鐭╅樀瀛樺偍絎旂敾淇℃伅錛屼篃灝辨槸涓涓簩緇存暟緇勩傝鍩轟簬錛楁鏁扮爜綆$殑鎬濇兂杈撳嚭銆備簩緇寸煩闃電殑淇℃伅姣旇緝瀹規槗寰楀埌銆?/p>
#include<stdio.h>
#include
<string.h>
void main()
{
    
void dup(char c,int n);
    
char line[7][11]={"- -- -----","|   ||| ||","|||||  |||","  ----- --","| |   | | ","|| |||||||","- -- -- --"};//鎬誨叡7絎旓紝姣忎竴絎斿姣忎竴涓暟瀛楁樉紺轟笉鍚?/span>
    char str[9];//鍒╃敤瀛楃涓插鐞嗘祴璇曟暟鎹皢鐨勫張鏄湪鍙灞忓箷鑳藉涓?涓嶇鏁版嵁澶у皬
    int  s,i,j,k,t;
    
while(scanf("%d%s",&s,str)&&s!=0)//杈撳叆嫻嬭瘯鏁版嵁鐩村埌杈撳叆0 0 涓烘錛屽疄闄呬笂鍙鍒ゆ柇杈撳叆鐨剆涓?鍗沖彲銆?/span>
    {     
        
for(j=0;j<7;j++)//鎸夌瑪鐢昏緭鍑轟負寰幆鏉′歡錛屼竴鍏辮緭鍑?絎旓紝絎旂敾浠?鍒?
        {
            
if(j%3==0)//杈撳嚭絎?nbsp;0 3 6絎旂殑鏃跺欐寜濡備笅鏍煎紡
            {
                
for(k=0;k<strlen(str);k++)
                
{
                    printf(
" ");
                    t
=(int)(str[k]-48);//瀛楃杞崲鎴愬搴旂殑鏁板瓧
                    dup(line[j][t],s);//閲嶅杈撳嚭s涓絎旂敾
                    printf("  ");
                }

                printf(
"\n");//姣忔杈撳嚭涓絎斿悗鎹㈣
            }

            
else  //杈撳嚭絎? 2 4 5 絎旂殑鏃跺欐寜濡備笅鏍煎紡
            {
                
for(i=1;i<=s;i++)//閲嶅杈撳嚭s涓絎旂敾錛屼絾鏄鎹㈣
                {
                    
for(k=0;k<strlen(str);k++)//絎? 2 鍜岀4 5 絎旀槸榪炲湪涓琛岃緭鍑虹殑
                    {
                        t
=(int)(str[k]-48);
                        printf(
"%c",line[j][t]);
                        dup(
' ',s);
                        printf(
"%c",line[j+1][t]);
                        printf(
" ");
                    }

                    printf(
"\n");//姣忔杈撳嚭涓絎斿悗鎹㈣,瀵? 2 4 5 鑰岃█鏄緭鍑?絎斿氨鎹㈣
                }

                j
=j+1;
            }

        }

        printf(
"\n");//涓や釜嫻嬭瘯鏁版嵁鐨勮緭鍑虹粨鏋滄崲琛?絎竴嬈℃彁浜ら敊璇氨鏄姱鍦ㄨ繖鍎?/span>
    }

}


void dup(char c,int n)//閲嶅杈撳嚭瀛楃鍑芥暟錛岀敤浜庨噸澶嶈緭鍑簊涓瓧絎?/span>
{
    
int i;
    
for(i=1;i<=n;i++)
        printf(
"%c",c);
}













錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛濓紳錛?

]]>
pku1068http://www.shnenglu.com/zzfmars/archive/2010/08/20/124106.htmlKevin_ZhangKevin_ZhangFri, 20 Aug 2010 08:27:00 GMThttp://www.shnenglu.com/zzfmars/archive/2010/08/20/124106.htmlhttp://www.shnenglu.com/zzfmars/comments/124106.htmlhttp://www.shnenglu.com/zzfmars/archive/2010/08/20/124106.html#Feedback0http://www.shnenglu.com/zzfmars/comments/commentRss/124106.htmlhttp://www.shnenglu.com/zzfmars/services/trackbacks/124106.htmlhttp://acm.pku.edu.cn/JudgeOnline/problem?id=1068
鍒嗘瀽錛?br>  

(1)    The first element of W-sequence must be 1.

(2)    The matched left parenthesis is the closest unmatched left parenthesis.

(3)    The left must have left parenthesis and the first right parenthiesis matches with the left parenthesis nearest to it.

(4)    If , ,else w[i]=i+1;  the subscript must be from  0.

鏀惰幏錛氬眬閮ㄥ彉閲忓拰鍏ㄥ眬鍙橀噺璋ㄦ厧浣跨敤銆傝繖涓唬鐮佸湪鐢ㄥ叏灞鍙橀噺bool flag鏃跺湪澶栭儴榪涜鍒濆鍖栵紝鍦ㄥ驚鐜綋鍐呴儴鏈垵濮嬪寲錛屽鑷村墠闈㈢殑寰幆褰卞搷鍚庨潰鐨勭粨鏋滆屽嚭閿欍傚洜姝ゅ鍏ㄥ眬鍙橀噺鍦ㄤ綍澶勮繘琛屽垵濮嬪寲蹇呴』鍗佸垎緇嗗績銆?br>浠g爜錛?br>
#include"iostream"
#include
"stdio.h"
using namespace std;

int p[21],w[21],t,n,k;
bool flag;

int main()
{
    scanf(
"%d",&t);
    
for(int i=0;i<t;i++)
    
{
        scanf(
"%d",&n);
        
for(int j=0;j<n;j++)
            scanf(
"%d",&p[j]);
        w[
0]=1;
        
for(int j=1;j<n;j++)
        
{
            flag
=false;
            
for(k=j-1;k>=0;k--)
            
{
                
if(p[j]-p[k]>=j-k)
                
{  
                    w[j]
=j-k;
                    flag
=true;
                    
break;
                }

                
            }

            
if(flag==true)
            
{
                
continue;
            }

            
else
                w[j]
=j+1;

        }

        
for(int i=0;i<n;i++)
            printf(
"%d ",w[i]);
        printf(
"\n");
    }

    
return 0;

}


]]>
pku1051http://www.shnenglu.com/zzfmars/archive/2010/08/19/123912.htmlKevin_ZhangKevin_ZhangWed, 18 Aug 2010 17:45:00 GMThttp://www.shnenglu.com/zzfmars/archive/2010/08/19/123912.htmlhttp://www.shnenglu.com/zzfmars/comments/123912.htmlhttp://www.shnenglu.com/zzfmars/archive/2010/08/19/123912.html#Feedback0http://www.shnenglu.com/zzfmars/comments/commentRss/123912.htmlhttp://www.shnenglu.com/zzfmars/services/trackbacks/123912.html闃呰鍏ㄦ枃

]]>
久久丫忘忧草产品| 人妻少妇精品久久| 亚洲精品高清国产一久久| 夜夜亚洲天天久久| 亚洲精品97久久中文字幕无码| 囯产精品久久久久久久久蜜桃| 亚洲色欲久久久综合网东京热| 久久最新精品国产| 久久人人爽人人爽人人片AV麻烦 | 久久精品亚洲日本波多野结衣| 久久久老熟女一区二区三区| 国产成人精品久久| 99久久精品免费看国产一区二区三区 | 亚洲国产成人久久精品影视| 亚洲精品国产综合久久一线| 久久夜色精品国产网站| 热久久最新网站获取| 色综合久久精品中文字幕首页| 香蕉久久夜色精品国产尤物| 久久亚洲欧美日本精品| 亚洲人成网亚洲欧洲无码久久| 欧美日韩精品久久久久| 99久久国产亚洲高清观看2024| 欧美牲交A欧牲交aⅴ久久| 美女久久久久久| 久久精品国产WWW456C0M| 9191精品国产免费久久| 久久99精品久久久久久久不卡 | 久久天天躁夜夜躁狠狠| 国产91久久综合| 国产精品一区二区久久不卡| 亚洲精品美女久久777777| 国产精品久久久久久五月尺| 欧美激情精品久久久久久久| 久久97久久97精品免视看秋霞| 91精品国产高清久久久久久91| 国产一区二区精品久久 | 亚洲国产精品成人AV无码久久综合影院 | 性做久久久久久久久| 日日狠狠久久偷偷色综合免费 | 欧美激情精品久久久久|