The 7th Zhejiang Provincial Collegiate Programming Contest

A - Who is Older?

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;


int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int y1,y2,m1,m2,d1,d2;
        cin>>y1>>m1>>d1>>y2>>m2>>d2;
        if(y1<y2)
            cout<<"javaman"<<endl;
        else if(y1>y2)
            cout<<"cpcs"<<endl;
        else if(y1==y2){
            if(m1<m2)
            cout<<"javaman"<<endl;
            else if(m1>m2)
            cout<<"cpcs"<<endl;
            else if(m1==m2){
                if(d1<d2)
                cout<<"javaman"<<endl;
                else if(d1>d2)
                cout<<"cpcs"<<endl;
                else if(d1==d2)
                    cout<<"same"<<endl;
            }
        }
    }

    return 0;

}

B - Somali Pirates

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;


int main()
{
    int t;
    string s;
    cin>>t;
    while(t--)
    {
        cin>>s;
        for(int i=0;i<s.size();i++)
            if(isalpha(s[i]))
                cout<<s[i];
        cout<<endl;
    }

    return 0;

}

E - An Awful Problem

题目大意:求两个日期之间,月份是素数而且日期是素数的有哪几天，当时模拟赛现场做的人都要爆炸了，试了各种方法还是没有解决，最后的时候破罐子破摔，统一把日期推到当年1月1日才完成

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;
int Prime[]= {2,3,5,7,11,13,17,19,23,29,31};
int day[2][12]=
{
    31,28,31,30,31,30,31,31,30,31,30,31,
   31,29,31,30,31,30,31,31,30,31,30,31
};
bool isPrime(int x){
    int flag=0;
    for(int i=0;i<11;i++){
        if(x==Prime[i]){
            flag=1;
            break;
        }
    }
    return flag;
}
bool isLeap(int x){
  if(((x%4==0)&&(x%100!=0))||(x%400==0))
    return 1;
  return 0;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int y1,y2,m1,m2,d1,d2;
        cin>>y1>>m1>>d1>>y2>>m2>>d2;
        int cnt=0;
         if(isPrime(m1)&&isPrime(d1))
            cnt++;
        while(1)
        {
            if(isPrime(m1)&&isPrime(d1)){
                cnt--;
                //cout<<y1<<" "<<m1<<" "<<d1<<endl;
            }
            if(m1==1&&d1==1)
                break;
            d1--;
            if(d1<0){
                m1--;
                d1=day[isLeap(y1)][m1-1];
            }
        }//推到当年1月1
        //cout<<cnt<<endl;
        for(int i=y1;i<y2;i++){
            if(isLeap(i))
                cnt+=53;
            else cnt+=52;
        }
        y1=y2;
        //cout<<y1<<" "<<m1<<" "<<d1<<" "<<cnt<<endl;
        while(1)
        {
            if(isPrime(m1)&&isPrime(d1)){
                cnt++;
                //cout<<y1<<" "<<m1<<" "<<d1<<endl;
            }
            if(y1==y2&&m1==m2&&d1==d2)
                break;
            d1++;
            if(d1>day[isLeap(y1)][m1-1]){
                d1=1;
                m1++;
                if(m1>12){
                    m1=1;
                    y1++;
                }
            }
        }
        cout<<cnt<<endl;
    }

    return 0;

}

G - Wu Xing

 #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;


int main()
{
    int x;
    while(cin>>x,x){
        cout<<x/2<<endl;
    }
    return 0;

}

H - One Person Game

http://blog.csdn.net/tinyguyyy/article/details/51066923

J - Process the Tasks

http://blog.csdn.net/tinyguyyy/article/details/51066991

K - Strange Country II

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;
int G[105][105];
int shunxu[105],vis[105];
int n;
int flag;
void dfs(int st,int cnt)
{
    shunxu[cnt] = st;
    if(cnt == n)
    {
        flag = 1;
        return;
    }
    for(int i= 1; i<= n; i++)
    {
        if(!vis[i] && G[st][i] == 1)
        {
            vis[i] = 1;
            dfs(i,cnt+1);
            if(flag == 1)
                return;
            vis[i] = 0;
        }
    }
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        flag=0;
        memset(G,0,sizeof(G));
        memset(vis,0,sizeof(vis));
        memset(shunxu,0,sizeof(shunxu));
        cin>>n;
        for(int i=0; i<n*(n-1)/2; i++)
        {
            int x,y;
            cin>>x>>y;
            G[x][y]=1;
        }
        for(int i=1; i<=n; i++)
        {
            vis[i]=1;
            dfs(i,1);
            vis[i]=0;
            if(flag)
                break;
        }
        if(flag==0)
            cout<<"Impossible";
        else
        {
            for(int i=1; i<=n; i++)
            {
                if(i!=1)
                    cout<<" ";
                cout<<shunxu[i];
            }
        }
        cout<<endl;
    }
    return 0;
}

L - Guess the Price

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<queue>
#define mod 1e9+7
#define ll long long
#define MAXSIZE 100005
#define inf 0x3f3f3f3f
#define eps 1e-7
#define PI acos(-1.0)
#define N 200
using namespace std;


int main()
{
    int t,x,a,b;
    cin>>t;
    while(t--)
    {
       cin>>x>>a>>b;
       if(abs(x-a)<abs(x-b))
        cout<<"A"<<endl;
       else cout<<"B"<<endl;
    }

    return 0;

}