• <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,這是有層次性,不要搞混,以下是錯誤代碼 
            #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;
              }

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

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

            所以應當用兩個數(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 閱讀(261) 評論(0)  編輯 收藏 引用
            <2009年6月>
            31123456
            78910111213
            14151617181920
            21222324252627
            2829301234
            567891011

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久久艹| 久久大香萑太香蕉av| 精品一区二区久久| 久久精品国产一区二区 | 99精品国产在热久久无毒不卡| 久久99精品国产麻豆| 久久精品无码免费不卡| 亚洲人成无码www久久久| 国产精品久久久久无码av| 国産精品久久久久久久| 91视频国产91久久久| 久久99久久无码毛片一区二区| 亚洲av成人无码久久精品| 久久久久久综合网天天| 7777精品伊人久久久大香线蕉| 精品熟女少妇av免费久久| 欧美与黑人午夜性猛交久久久| 精品久久久无码中文字幕| 亚洲av伊人久久综合密臀性色| 久久黄视频| 国产亚洲美女精品久久久| 欧美一区二区三区久久综合| 久久ZYZ资源站无码中文动漫| 久久婷婷国产综合精品| 欧美一级久久久久久久大| 色综合久久天天综合| 精品久久久久久无码人妻热| 亚洲va国产va天堂va久久| 久久久精品国产| 亚洲AV无码1区2区久久| 久久嫩草影院免费看夜色| 一本色综合久久| 伊人久久综在合线亚洲2019| 国产精品综合久久第一页| 久久性精品| 精品乱码久久久久久夜夜嗨 | 偷窥少妇久久久久久久久| 久久精品国产国产精品四凭| 亚洲精品国产成人99久久| 99久久精品国产毛片| 精品国产综合区久久久久久 |