CodeForces 707-A,B,C

A:

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
const int INF=0x3f3f3f3f;
const int SIZE=32;
int main()
{
    int n,m;
    cin>>n>>m;
    char c;
    bool color=false;
    for (int i=0; i<n; i++)
        for (int j=0; j<m; j++)
        {
            cin>>c;
            if (c=='M'||c=='Y'||c=='C')
                color=true;
        }
    if (!color)
        cout<<"#Black&White" ;
    else
        cout<<"#Color";
    return 0;
}

B:

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAX=100005;
struct Edge
{
    int u,v,l;
    bool operator < (Edge& x)
    {
        return l<x.l;
    }
};
Edge Es[MAX];
bool isK[MAX]= {0};
int main()
{
    cin.sync_with_stdio(false);
    int N,M,K,a;
    cin>>N>>M>>K;
    for (int i=0; i<M; i++)
        cin>>Es[i].u>>Es[i].v>>Es[i].l;
    if (K==0)
        cout<<-1;
    else
    {
        for (int i=0; i<K; i++)
        {
            cin>>a;
            isK[a]=true;
        }
        sort(Es,Es+M);
        int Ans=INF;
        for (int i=0; i<M; i++)
            if ((isK[Es[i].u]&&(!isK[Es[i].v]))||(isK[Es[i].v]&&(!isK[Es[i].u])))
                Ans=min(Ans,Es[i].l);
        if (Ans==INF)
            cout<<-1;
        else
            cout<<Ans;
    }
    return 0;
}

C:

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=100005;
int main()
{
    long long a,b,c,n;
    while (cin>>a)
    {
        if (a%2==0&&a>2)
        {
            n=a/2;
            b=n*n-1;
            c=n*n+1;
            cout<<b<<' '<<c<<endl;
        }
        else if (a%2==1&&a>2)
        {
            n=(a-1)/2;
            b=2*n*n+2*n;
            c=2*n*n+2*n+1;
            cout<<b<<' '<<c<<endl;
        }
        else
            cout<<-1<<endl;
    }
    return 0;
}