Codeforces Beta Round #73 (Div. 2 Only)

Codeforces Beta Round #73 (Div. 2 Only)

http://codeforces.com/contest/88

A

模拟

#include<bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define pb push_back
#define eb emplace_back
#define maxn 1000006
#define eps 1e-8
#define pi acos(-1.0)
#define rep(k,i,j) for(int k=i;k<j;k++)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,string>,pii> ppp;
typedef unsigned long long ull;

string s[12]={"C","C#","D","D#","E","F","F#","G","G#","A","B","H"},a,b,c;
int x[12];

int main(){
    #ifndef ONLINE_JUDGE
     //   freopen("input.txt","r",stdin);
    #endif
    std::ios::sync_with_stdio(false);
    cin >> a >> b >> c;
    for(int i=0;i<12;i++){
        if(a==s[i] || b==s[i] || c==s[i])x[i]=1;
    }
    for(int i=0;i<12;i++){
         if(x[i]){
            if(x[(i+4)%12] && x[(i+7)%12]){
                cout << "major" << endl;
                return 0;
            }
            if(x[(i+3)%12] && x[(i+7)%12]){
                cout << "minor" << endl;
                return 0;
            }
         }
    }
    cout << "strange" << endl;
}

B

模拟

#include<bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define pb push_back
#define eb emplace_back
#define maxn 1000006
#define eps 1e-8
#define pi acos(-1.0)
#define rep(k,i,j) for(int k=i;k<j;k++)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,string>,pii> ppp;
typedef unsigned long long ull;

string str;
map<char,int>mp;
string s[55];
map<char,int>book;
vector<pii>ve;

double dis(int a,int b,int c,int d){
    return sqrt(sqr(a-c)+sqr(b-d));
}

int main(){
    #ifndef ONLINE_JUDGE
     //   freopen("input.txt","r",stdin);
    #endif
    std::ios::sync_with_stdio(false);
    int n,m,len;
    double x;
    cin>>n>>m>>x;
    for(int i=0;i<n;i++){
        cin>>s[i];
        for(int j=0;j<m;j++){
            mp[s[i][j]]=1; 
            if(s[i][j]=='S') ve.pb(make_pair(i,j));
        }
    }
    cin>>len>>str;
    int ans=0;
    pii tmp;
    double dist;
    for(int k=0;k<ve.size();k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                dist=dis(ve[k].first,ve[k].second,i,j);
                if(dist<=x)    {
                    book[s[i][j]]=1;
                }
            }
        }
    }
    int i;
    for(i=0;i<len;i++){
        if((str[i]>='A'&&str[i]<='Z'&&!mp[str[i]+32])||(str[i]>='A'&&str[i]<='Z'&&!mp['S'])||(str[i]>='a'&&str[i]<='z'&&!mp[str[i]])) {
            ans=0; 
            break;
        }
        else if(str[i]>='A'&&str[i]<='Z'&&mp['S']){
            if(!book[str[i]+32]) ans++;
        }
    }
    if(i==len&&ans==0) cout<<0<<endl;
    else if(!ans) cout<<-1<<endl;
    else cout<<ans<<endl;
}

C

gcd

#include<bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define pb push_back
#define eb emplace_back
#define maxn 1000006
#define eps 1e-8
#define pi acos(-1.0)
#define rep(k,i,j) for(int k=i;k<j;k++)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,string>,pii> ppp;
typedef unsigned long long ull;


int main(){
    #ifndef ONLINE_JUDGE
     //   freopen("input.txt","r",stdin);
    #endif
    std::ios::sync_with_stdio(false);
    int a,b;
    cin >> a>>b;
    cout <<((abs(a/__gcd(a,b)-b/__gcd(a,b))==1)?"Equal":(a<b?"Dasha":"Masha"))<<endl;
}

D

模拟

#include<bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define pb push_back
#define eb emplace_back
#define maxn 1000006
#define eps 1e-8
#define pi acos(-1.0)
#define rep(k,i,j) for(int k=i;k<j;k++)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<double,double>pdd;
typedef pair<pair<int,string>,pii> ppp;
typedef unsigned long long ull;

map<string,int>mp;
int n,cou;
string a,b,c;
void solve()
{
    cin>>b;
    int ans=0;
    string d="";
    for(int i=0; i<b.size(); i++)
    {
        if(b[i]=='&') ans--;
        else if(b[i]=='*') ans++;
        else d+=b[i];
    }
    cou=mp[d];
    if(cou>0) cou+=ans;
    else cou=0;
    b.clear();
}


int main(){
    #ifndef ONLINE_JUDGE
     //   freopen("input.txt","r",stdin);
    #endif
    std::ios::sync_with_stdio(false);
    mp["void"]=1;
    cin>>n;
    while(n--)
    {
        cin>>a;
        if(a=="typedef")
        {
            solve();
            cin>>c;
            mp[c]=cou;
            c.clear();
        }
        else if(a=="typeof")
        {
            solve();
            if(--cou<0) cout<<"errtype"<<endl;
            else
            {
                cout<<"void";
                for(int i=0; i<cou; i++) cout<<"*";
                cout<<endl;
            }
        }
        a.clear();
    }
}

E

sg函数（照着AC代码打的，没有完全理解）

#include<bits/stdc++.h>
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define maxn 100005
typedef long long ll;
typedef unsigned long long ull;
const ull MOD=257;
/*#ifndef ONLINE_JUDGE
        freopen("1.txt","r",stdin);
#endif */

int ans[maxn],sg[maxn],mex[maxn];

void getsg(int n){

    for(int i=2;i*(i+1)/2<=n;i++){
        if((2*n)%i==0){
            int t=2*n/i-i+1;
            if((t&1)||t<0) continue;
            t/=2;
            mex[sg[t-1+i]^sg[t-1]]=n;
            if((sg[t-1+i]^sg[t-1])==0)
                if(ans[n]==-1)
                    ans[n]=i;
        }
    }
    sg[n]=-1;
    for(int i=0;;i++){
        if(mex[i]!=n){
            sg[n]=i;
            break;
        }
    }
    sg[n]^=sg[n-1];
    return ;
}

int main(){
    #ifndef ONLINE_JUDGE
     //   freopen("1.txt","r",stdin);
    #endif
    std::ios::sync_with_stdio(false);
    int n;
    cin>>n;
    memset(ans,-1,sizeof(ans));
    for(int i=3;i<=n;i++){
        getsg(i);
    }
    cout<<ans[n]<<endl;
}