• <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>

            Timus 1087(recursion game)

            1087. The Time to Take Stones

            Time Limit: 1.0 second
            Memory Limit: 16 MB
            You probably know the game where two players in turns take 1 to 3 stones from a pile. Looses the one who takes the last stone. We'll generalize this well known game. Assume that both of the players can take not 1, 2 or 3 stones, but k1, k2, …, km ones. Again we'll be interested in one question: who wins in the perfect game. It is guaranteed that it is possible to make next move irrespective to already made moves.

            Input

            The first line contains two integers: n and m (1 ≤ n ≤ 10000; 1 ≤ m ≤ 50) — they are an initial amount of stones in the pile and an amount of numbers k1, …, km. The second line consists of the numbers k1, …, km, separated with a space (1 ≤ kin).

            Output

            Output 1, if the first player (the first to take stones) wins in a perfect game. Otherwise, output 2.

            Sample

            input output
            17 3
                        1 3 4
                        
            2
                        
            Problem Author: Anton Botov
            Problem Source: The 3rd high school children programming contest, USU, Yekaterinburg, Russia, March 4, 2001



            /*
            "Looses the one who takes the last stone" —— the one takes the last 
            stone loses the game ! 
            */ 
            #include 
            <stdio.h>
            #include 
            <memory>
            #include 
            <iostream>
            #include 
            <algorithm>
            #include 
            <cstring>
            #include 
            <vector>
            #include 
            <map>
            #include 
            <cmath>
            #include 
            <set>
            #include 
            <queue>
            #include 
            <time.h> 
            #include 
            <limits>
            using namespace std; 
            #define N 10005
            #define M 55
            int step[M], n, m; 
            bool state[N]; 
            bool input(){
                
            if(scanf("%d%d"&n, &m) == EOF) return false
                
            int i; 
                
            for(i = 0; i < m; i++) scanf("%d", step+i);
                
            return true
            }
            void solve(){
                memset(state, 
            0sizeof(bool* (n+1)); 
                
            int i, j, u; 
                
            for(i = 1; i <= n; i++){
                    
            for(j = 0; j < m; j++){
                        
            if((u = i - step[j]) >= 0){
                            
            if(u == 0){
                                state[i] 
            = false
                            }
            else{
                                
            if(!state[u]){
                                    state[i] 
            = true
                                    
            break
                                }
                            }
                        }
                    }
                }
                
            //for(i = 0; i <= n; i++) printf("s[%d]=%d\n", i, state[i]);
                if(state[n]) printf("1\n");
                
            else printf("2\n");
            }
            int main(){
            #ifndef ONLINE_JUDGE
                freopen(
            "in.txt""r", stdin); 
                
            //freopen("out.txt", "w", stdout); 
            #endif 
                
            while(input()) solve(); 
                
            return 0;
            }

            posted on 2011-01-18 15:23 tw 閱讀(137) 評論(0)  編輯 收藏 引用 所屬分類: Timus題解

            <2025年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            導航

            統計

            常用鏈接

            留言簿

            文章分類

            文章檔案

            搜索

            最新評論

            久久综合久久美利坚合众国| 久久久久人妻一区二区三区| 久久精品国产99国产精品澳门| 久久99毛片免费观看不卡| 色成年激情久久综合| 日韩亚洲国产综合久久久| 亚洲AV日韩AV天堂久久| 99久久无码一区人妻| 人人妻久久人人澡人人爽人人精品| 国产人久久人人人人爽| 久久WWW免费人成—看片| 中文字幕乱码久久午夜| 国产午夜电影久久| 中文国产成人精品久久不卡| 丁香久久婷婷国产午夜视频| 新狼窝色AV性久久久久久| 欧美日韩中文字幕久久久不卡| 久久国产精品99精品国产| 日本精品久久久久久久久免费| 久久久噜噜噜www成人网| 久久久久久免费视频| 国产视频久久| 精品久久人人爽天天玩人人妻| 久久久无码精品亚洲日韩蜜臀浪潮| 性做久久久久久免费观看| 国产精品热久久毛片| 97久久精品无码一区二区| 亚洲AV无码成人网站久久精品大| 久久996热精品xxxx| 国产A级毛片久久久精品毛片| 97久久精品午夜一区二区| 久久亚洲私人国产精品| 亚洲精品乱码久久久久久蜜桃图片 | 97视频久久久| 武侠古典久久婷婷狼人伊人| 国内精品久久久久影院网站| 久久国产香蕉一区精品| 久久久久国产精品三级网| 久久天天躁狠狠躁夜夜2020| 久久有码中文字幕| 婷婷久久五月天|