codeforces #328 div2

A

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<set>
#define Maxn
#define MOD
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
char board[9][9];
int mina,minb;
bool flaga,flagb;
int main()
{   int i,j;
    while(~scanf("%s",&board[0]))
    {   mina=minb=inf;
        flaga=flagb=false;
        FOR(i,1,7)
        scanf("%s",board[i]);
        for(i=0;i<8;i++)
        {for(j=0;j<8;j++)
            if(board[i][j]=='W')
            {
                flaga=true;
                for(int k=i-1;k>=0;k--){if(board[k][j]!='.')flaga=false;}

                if(flaga)
                {   if(mina>i)
                    mina=i;

                }
            }
          else  if(board[i][j]=='B')
            {   flagb=true;
                for(int k=i+1;k<=7;k++){if(board[k][j]!='.')flagb=false;}

                if(flagb)
                {   if(minb>7-i)
                    minb=7-i;

                }

            }
            else  if(board[i][j]=='.')continue;
        }
        if(mina<=minb) printf("A\n");

        else
            printf("B\n");

    }
    return 0;
}

B

找规律

n  ans

3    1

 4     4

 5     9

  6   16

 7    25

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<set>
#define Maxn
#define MOD
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
int main()
{   ll n;
    while(cin>>n)
    {   n=(n-2)*(n-2);
        cout<<n<<endl;}
    return 0;
}