• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Uriel's Corner

            Research Associate @ Harvard University / Research Interests: Computer Vision, Biomedical Image Analysis, Machine Learning
            posts - 0, comments - 50, trackbacks - 0, articles - 594

            POJ 1747 Expression---遞歸

            Posted on 2009-10-03 01:36 Uriel 閱讀(636) 評論(0)  編輯 收藏 引用 所屬分類: POJ遞歸 & 分治
            暑假集訓(xùn)就看過這題,當(dāng)時(shí)不會。。今天看了下Discuss之后很有感覺。。
            加入下標(biāo)應(yīng)該不用這么麻煩。。sscanf那些神奇的東西都還不會。。就用猥瑣方法硬來了。。。- -||
            大牛們不吝指教。。加下標(biāo)那里怎么改下。。
            /*Problem: 1747  User: Uriel 
               Memory: 1184K  Time: 141MS 
               Language: C++  Result: Accepted
            */
             

            #include
            <stdio.h>
            #include
            <stdlib.h>
            #include
            <string.h>

            char str[105][10000];
            char temp[102][4]={"0","1","2","3","4","5","6","7","8","9","10","11","12","13","14","15","16","17","18","19","20","21","22","23","24","25","26","27","28","29","30",
                               
            "31","32","33","34","35","36","37","38","39","40","41","42","43","44","45","46","47","48","49","50","51","52","53","54","55","56","57","58","59","60",
                               
            "61","62","63","64","65","66","67","68","69","70","71","72","73","74","75","76","77","78","79","80","81","82","83","84","85","86","87","88","89",
                               
            "90","91","92","93","94","95","96","97","98","99","100"}
            ;
            int n,st;

            int min(int a,int b)
            {
                
            return a < b ? a: b;
            }


            void Sov(int a)
            {
                
            if(a==1)return ;
                Sov(a
            -1);
                strcpy(str[a],
            "((A");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            "|B");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            ")|(");
                strcat(str[a],str[a
            -1]);
                strcat(str[a],
            "|((A");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            "|A");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            ")|(B");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            "|B");
                strcat(str[a],temp[a
            -1]);
                strcat(str[a],
            "))))");
            }


            int main()
            {
                scanf(
            "%d",&n);
                memset(str,
            0x00,sizeof(str));
                strcpy(str[
            1],"((A0|B0)|(A0|B0))");
                st
            =1;
                Sov(n);
                
            for(int i=0;i<min(strlen(str[n]),50*n);i++)
                
            {
                    printf(
            "%c",str[n][i]);
                }

                printf(
            "\n");
                
            return 0;
            }


            久久精品欧美日韩精品| 国产成人精品综合久久久| A狠狠久久蜜臀婷色中文网| 国产精品久久自在自线观看| 免费精品99久久国产综合精品| 99久久伊人精品综合观看| 久久精品国产只有精品66| 2019久久久高清456| 久久九九全国免费| 综合久久一区二区三区| AAA级久久久精品无码片| 亚洲国产精品综合久久网络 | 青青草原综合久久大伊人| 国产精品美女久久久久 | 人人狠狠综合久久亚洲高清| 久久久亚洲欧洲日产国码aⅴ | 一本色综合久久| 国产精品久久永久免费| 一本色道久久88精品综合| 久久国产香蕉视频| 26uuu久久五月天| 婷婷伊人久久大香线蕉AV| 精品国产一区二区三区久久蜜臀| 久久香蕉超碰97国产精品 | 欧美国产成人久久精品| 久久国产精品成人片免费| 麻豆av久久av盛宴av| 精品熟女少妇aⅴ免费久久| 丁香狠狠色婷婷久久综合| 久久婷婷五月综合色奶水99啪| 99久久精品国产一区二区| 久久精品国产网红主播| 久久精品人人做人人妻人人玩| 亚洲AV无码一区东京热久久| 精品综合久久久久久98| 99蜜桃臀久久久欧美精品网站| 国产香蕉久久精品综合网| 亚洲精品97久久中文字幕无码| 一本大道久久香蕉成人网| 久久香综合精品久久伊人| 国内精品人妻无码久久久影院导航|