• <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>
            posts - 195,  comments - 30,  trackbacks - 0

            Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. There are eight possible expressions:

            17 + 5 + -21 + 15 =  16
            17 + 5 + -21 - 15 = -14
            17 + 5 - -21 + 15 =  58
            17 + 5 - -21 - 15 =  28
            17 - 5 + -21 + 15 =   6
            17 - 5 + -21 - 15 = -24
            17 - 5 - -21 + 15 =  48
            17 - 5 - -21 - 15 =  18
            

            We call the sequence of integers divisible by K if + or - operators can be placed between integers in the sequence in such way that resulting value is divisible by K. In the above example, the sequence is divisible by 7 (17+5+-21-15=-14) but is not divisible by 5.

            You are to write a program that will determine divisibility of sequence of integers.

            Input

            There are multiple test cases, the first line is the number of test cases.
            The first line of each test case contains two integers, N and K (1 ≤ N ≤ 10000, 2 ≤ K ≤ 100) separated by a space.

            The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it's absolute value.

            Output

            Write to the output file the word "Divisible" if given sequence of integers is divisible by K or "Not divisible" if it's not.

            Sample Input

            2
            4 7
            17 5 -21 15
            4 5
            17 5 -21 15
            

            Sample Output

            Divisible
            Not divisible
            
            啟發(fā):1,涉及整除就要聯(lián)想取模!!!!!!!!
                        2,這是有層次性,不要搞混,以下是錯(cuò)誤代碼 
            #include<iostream>
            #include
            <cstdlib>
            using namespace std;
              
              
            int main()
              
            {
              freopen(
            "s.txt","r",stdin);
              freopen(
            "key.txt","w",stdout);
              
            int testnum;
              
            int num,pos;
              cin
            >>testnum;
              
            int a[101],temp,i,j;
              
            while(testnum--)
              
            {
                    memset(a,
            0,sizeof(a));
                    cin
            >>num>>pos;
                    cin
            >>temp;
                    temp
            %=pos;
                    
            if(temp<0)temp+=pos;
                    a[temp]
            =1;    
                    
            for(i=1;i<num;i++)
                    
            {
                        cin
            >>temp;
                        temp
            %=pos;
                        
            if(temp<0)temp+=pos;//temp%pos¿ÉÄÜÊǸºÊý 
                        for(j=0;j<pos;j++)
                        
            {
                            
            if(a[j]>0)
                              
            {
                                    a[(j
            +temp)%pos]++;
                                    
            if((j-temp)<0)
                                    
            {
                                        a[(j
            -temp)+pos]++;
                                    }

                                    
            else
                                    
            {
                                    a[j
            -temp]++;
                                    }

                                    
            if(temp!=0)
                                    a[j]
            =0;
                              }

                        }

                    }

                    
            if(a[0]>0)cout<<"Divisible"<<endl;
                    
            else cout<<"Not divisible"<<endl;
                }


              
            //system("PAUSE");
              return   0;
              }

            這是有層次性,再添加一個(gè)元素時(shí),只能改變前一組a[j]的值

             if(a[j]>0)//
                  {
                  a[(j+temp)%pos]++;//這里的修改應(yīng)該不應(yīng)添加到前面的a[j]中去。
                        if((j-temp)<0)

            所以應(yīng)當(dāng)用兩個(gè)數(shù)組。

            #include<iostream>
            #include
            <cstdlib>
            using namespace std;
              
              
            int main()
              {
              freopen(
            "s.txt","r",stdin);
              freopen(
            "key.txt","w",stdout);
              
            int testnum;
              
            int num,pos;
              cin
            >>testnum;
              
            int a[101],temp,i,j;
              
            int b[101];
              
            while(testnum--)
              {
                    memset(a,
            0,sizeof(a));
                    memset(a,
            0,sizeof(b));
                    cin
            >>num>>pos;
                    cin
            >>temp;
                    temp
            %=pos;
                    
            if(temp<0)temp+=pos;
                    a[temp]
            =1;    
                    
            for(i=1;i<num;i++)
                    {
                        cin
            >>temp;
                        temp
            %=pos;
                        
            if(temp<0)temp+=pos;//temp%pos¿ÉÄÜÊǸºÊý 
                        for(j=0;j<pos;j++)
                        {
                            
            if(a[j]>0)
                              {
                                    b[(j
            +temp)%pos]++;
                                    
            if((j-temp)<0)
                                    {
                                        b[(j
            -temp)+pos]++;
                                    }
                                    
            else
                                    {
                                    b[j
            -temp]++;
                                    }
                              }
                        }      
                              memset(a,
            0,sizeof(a));
                              
            for(j=0;j<pos;j++)
                              {
                                    
            if(b[j]>0)
                                    a[j]
            =1;
                              }
                              memset(b,
            0,sizeof(b));
                    }
                    
            if(a[0]>0)cout<<"Divisible"<<endl;
                    
            else cout<<"Not divisible"<<endl;
                }

              
            //system("PAUSE");
              return   0;
              }
            posted on 2009-06-30 22:20 luis 閱讀(262) 評(píng)論(0)  編輯 收藏 引用

            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2011年2月>
            303112345
            6789101112
            13141516171819
            20212223242526
            272812345
            6789101112

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            热综合一本伊人久久精品| 国产Av激情久久无码天堂| 久久久久久A亚洲欧洲AV冫 | 日本欧美国产精品第一页久久| 超级碰久久免费公开视频| 久久久免费观成人影院| 中文字幕乱码人妻无码久久| AV色综合久久天堂AV色综合在| 久久久中文字幕| 伊人久久大香线焦AV综合影院 | 久久综合给合久久狠狠狠97色 | 欧美精品一区二区久久| 久久精品国产2020| 精品国产综合区久久久久久| 久久精品国产亚洲av麻豆图片| 国产精品久久久久久| 亚洲午夜久久久影院| 色综合久久综合网观看| 久久九九精品99国产精品| 久久久这里只有精品加勒比| 久久99精品综合国产首页| 久久亚洲日韩看片无码| 欧美日韩精品久久久久| 996久久国产精品线观看| 精品久久久久久无码不卡| 日本精品久久久久久久久免费| 婷婷久久综合九色综合98| 久久久久久久人妻无码中文字幕爆| 亚洲精品国产自在久久| 欧洲性大片xxxxx久久久| 品成人欧美大片久久国产欧美...| 久久精品亚洲日本波多野结衣| 欧洲成人午夜精品无码区久久| 久久人人爽人人爽人人片AV高清| 久久午夜综合久久| 久久精品成人免费国产片小草| 国产精品成人精品久久久| 狠狠色伊人久久精品综合网| 精品久久久久久无码人妻热 | 国产精品欧美久久久久天天影视| 色成年激情久久综合|