锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久久av波多野一区二区,无码人妻久久一区二区三区免费丨 ,久久午夜无码鲁丝片http://www.shnenglu.com/goAheadtw/category/15892.htmlhahazh-cnWed, 19 Jan 2011 03:26:21 GMTWed, 19 Jan 2011 03:26:21 GMT60Timus 1087(recursion game)http://www.shnenglu.com/goAheadtw/articles/138752.htmltwtwTue, 18 Jan 2011 07:23:00 GMThttp://www.shnenglu.com/goAheadtw/articles/138752.htmlhttp://www.shnenglu.com/goAheadtw/comments/138752.htmlhttp://www.shnenglu.com/goAheadtw/articles/138752.html#Feedback0http://www.shnenglu.com/goAheadtw/comments/commentRss/138752.htmlhttp://www.shnenglu.com/goAheadtw/services/trackbacks/138752.html1087. 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" 鈥斺?nbsp;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;
}



tw 2011-01-18 15:23 鍙戣〃璇勮
]]>
Timus 1045 (game on a tree)http://www.shnenglu.com/goAheadtw/articles/138667.htmltwtwMon, 17 Jan 2011 06:13:00 GMThttp://www.shnenglu.com/goAheadtw/articles/138667.htmlhttp://www.shnenglu.com/goAheadtw/comments/138667.htmlhttp://www.shnenglu.com/goAheadtw/articles/138667.html#Feedback0http://www.shnenglu.com/goAheadtw/comments/commentRss/138667.htmlhttp://www.shnenglu.com/goAheadtw/services/trackbacks/138667.html 

#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 1005
struct e{
    
int v; 
    e
* nxt; 
}es[N
*2];
e
* fir[N]; 
int en, n, st, l; 
bool state[N]; 
inline 
void add_e(int u, int v){
    es[en].v 
= v; es[en].nxt = fir[u]; fir[u] = &es[en++]; 
}
bool input(){
    
if(scanf("%d%d"&n, &st) == EOF) return false
    st
--
    
int i, u, v; 
    
for(i = 0; i < n; i++) fir[i] = NULL; 
    en 
= 0
    
for(i = 1; i < n; i++){
        scanf(
"%d%d"&u, &v);
        u
--
        v
--
        add_e(u, v);
        add_e(v, u); 
    }
    
return true
}
void dfs(int u, int fa){
    e
* cur; 
    
int v; 
    
bool hasSon = false
    
for(cur = fir[u]; cur; cur = cur->nxt){
        
if((v = cur->v) != fa){
            hasSon 
= true
            dfs(v, u); 
        }
    }
    
if(!hasSon){
        state[u] 
= false;   //蹇呰觸鎬?/span>
    }else{
        state[u] 
= false
        
for(cur = fir[u]; cur; cur = cur->nxt){
            
if((v = cur->v) != fa){
                
if(!state[v]){
                    
if(u == st){
                        
if(state[u]){
                            
if(l > v + 1) l = v + 1
                        }
else{
                            state[u] 
= true
                            l 
= v + 1
                        }
                    }
else state[u] = true
                }
            }
        }
    }
}
void solve(){
    dfs(st, 
-1); 
    
if(state[st]) printf("First player wins flying to airport %d\n", l);
    
else printf("First player loses\n");
}
int main(){
#ifndef ONLINE_JUDGE
    freopen(
"in.txt""r", stdin); 
    
//freopen("out.txt", "w", stdout); 
#endif 
    
while(input()) solve(); 
    
return 0;
}





tw 2011-01-17 14:13 鍙戣〃璇勮
]]>
Timus 1023(Bash Game)http://www.shnenglu.com/goAheadtw/articles/138665.htmltwtwMon, 17 Jan 2011 05:24:00 GMThttp://www.shnenglu.com/goAheadtw/articles/138665.htmlhttp://www.shnenglu.com/goAheadtw/comments/138665.htmlhttp://www.shnenglu.com/goAheadtw/articles/138665.html#Feedback0http://www.shnenglu.com/goAheadtw/comments/commentRss/138665.htmlhttp://www.shnenglu.com/goAheadtw/services/trackbacks/138665.html// bash 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;
int cal(int a){
 int b, ans;
 ans = inf;
 for(b = 1; b * b <= a; b++){
  if(!(a % b)){
   if(b > 2 && b < ans) ans = b;
   if((a / b) > 2 && (a / b) < ans) ans = (a / b);
  }
 }
 if(ans < inf) return ans - 1;
 else return a - 1;
}
int main(){
#ifndef ONLINE_JUDGE
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
#endif
 init();
 int a;
 while(~scanf("%d", &a)){
  printf("%d\n", cal(a));
 }
 return 0;
}

 

 



tw 2011-01-17 13:24 鍙戣〃璇勮
]]>
国产99精品久久| 国产午夜久久影院| 久久影视综合亚洲| 一级女性全黄久久生活片免费 | 久久影院亚洲一区| 日本五月天婷久久网站| 国产人久久人人人人爽| 国内精品久久久久久久涩爱| 一级女性全黄久久生活片免费 | 久久精品国产亚洲AV高清热| 伊人久久精品线影院| 久久久国产亚洲精品| 久久精品国产精品亚洲精品| 亚洲国产成人精品无码久久久久久综合 | 性高湖久久久久久久久| 国产农村妇女毛片精品久久| 久久久久久国产精品美女| 国产精品久久久99| 国产精品一久久香蕉国产线看观看| 久久精品国产一区二区| 韩国无遮挡三级久久| 亚洲精品白浆高清久久久久久| a级毛片无码兔费真人久久| 久久久一本精品99久久精品66| 亚洲国产成人久久综合一区77 | 国产偷久久久精品专区| 精品一久久香蕉国产线看播放| 97久久久久人妻精品专区| 97香蕉久久夜色精品国产| 欧美国产成人久久精品| 久久电影网| 久久久噜噜噜久久| 久久影院亚洲一区| 欧美午夜A∨大片久久| 久久精品中文字幕第23页| 99久久精品国产一区二区三区| 久久天天躁狠狠躁夜夜96流白浆| 久久精品无码一区二区WWW| 中文字幕久久亚洲一区| 偷窥少妇久久久久久久久| 欧美精品国产综合久久|