国产乱色国产精品免费视频 ,欧美裸体xxxx极品少妇,91国产一区

foj1490�Q�五子棋�Q?

飞翔天�� — Thu, 30 Sep 2010 12:24:00 GMT

http://acm.fzu.edu.cn/problem.php?pid=1490
因�ؓ游戏恰好在棋��q��最后一步落子时分出胜负�Q�因此只要看最后一步是谁落子，��是谁胜。而此题规定是黑方先放子，�q�样的话�Q�要判断最后一步是谁下的只要知道��d��下棋的步数的奇偶性，如果是奇数那么就是黑方胜�Q�否则就是白方胜�?

import java.util.*;
import java.io.*;

public class ACM_1490{

    public static void main(String rgs[]) throws Exception
    {
        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
           String s = null;
           int step = 0;
          while((s = stdin.readLine())!=null)
        {
            StringTokenizer st = new StringTokenizer(s);
            while(st.hasMoreTokens()){
                String t = st.nextToken();
                if(t.equals("END")){
                    if(step%2==1)
                        System.out.println("B "+step);
                    else
                        System.out.println("W "+step);
                    step = 0;
                }
                else
                    step++;
            }
        }
    }
}

飞翔天�� 2010-09-30 20:24 发表评论

飞翔天�� — Sun, 26 Sep 2010 12:58:00 GMT

http://acm.fzu.edu.cn/problem.php?pid=1229
判断有N条边的有向图的环的个敎ͼ�
要点�Q�由于每个点只有一个出度，故给每个环都用特定的数��D��行标讎ͼ�

import java.util.*;
import java.io.*;

public class ACM_1229{

    public static void main(String rgs[]) throws Exception
    {
        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
           String s =null;
          while((s = stdin.readLine())!=null)
        {
            int i,j,k,n=Integer.parseInt(s),count=0;
            int[] a=new int[n+1];
            int[] b=new int[n+1];
            int[] flag=new int[n+1];
            s = stdin.readLine();
            StringTokenizer st = new StringTokenizer(s);
            for(i=0;i<n;i++){
                a[i] = Integer.parseInt(st.nextToken());
                flag[i]=0;
            }
            for(i=0;i<n;i++){
                int p=i+1;
                if(flag[i]==0){
                    j=i;
                    k=0;
                    do{
                        flag[j]=p;
                        k++;
                        b[j]=k;
                        j=a[j];
                    }while(flag[j]==0);
                    if(flag[j]==p)
                        count+=k+1-b[j];
                }
            }
            System.out.println(count);
        }
    }
}

飞翔天�� 2010-09-26 20:58 发表评论

飞翔天�� — Tue, 27 Jul 2010 12:59:00 GMT

只有注册用户��d��后才能阅读该文�?a href='http://www.aygfsteel.com/DreamAngel/articles/327253.html'>阅读全文

飞翔天�� 2010-07-27 20:59 发表评论