Code forces Round #292 div2

A：水题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
#include <math.h>
using namespace std;

int main()
{
    int n, m, k;
    cin>>n>>m>>k;
    int tmp = abs(n) + abs(m);
    if(k < tmp){
        cout<<"No"<<endl;
        return 0;
    }
    if(tmp & 1){
        if(k & 1){
            cout<<"Yes"<<endl;
        }
        else {
            cout<<"No"<<endl;
        }
    }
    else {
        if(k & 1){
            cout<<"No"<<endl;
            return 0;
        }
        else {
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    return 0;
}

B：循环节是m*n，直接暴力模拟也过

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
#include <math.h>
using namespace std;

int main()
{
    int a, b;
    int as[105], ss[105];
    int n, m;
    memset(as, 0, sizeof(as));
    memset(ss, 0, sizeof(ss));
    cin>>a>>b;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        int tmp;
        cin>>tmp;
        as[tmp] = 1;
    }
    cin>>m;
    for(int i = 0; i < m; i++)
    {
        int tmp;
        cin>>tmp;
        ss[tmp] = 1;
    }
    
    
    for(int i = 0; i <= 1000000; i++)
    {
        if(as[i % a] || ss[i % b]) {
            as[i % a] = ss[i % b] = 1;
        }
    }
    
    for(int i = 0;i < a; i++)
    {
        if(as[i] == 0) {
            cout<<"No"<<endl;
            return 0;
        }
        
    }
    for(int i = 0; i < b; i++)
    {
        if(ss[i] == 0){
            cout<<"No"<<endl;
            return 0;
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}

C：打个关于 每个数字用其他最长数字代替的表就好了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
#include <math.h>
using namespace std;
int ss[100005];
int cmp(int a, int b)
{
    return a > b;
}

int main()
{
    int t;
    cin>>t;
    int ans = 1, cnt = 0;
    for(int i = 0; i < t; i++)
    {
        int tmp;
        scanf("%1d", &tmp);
        if(tmp == 2){
            ss[cnt++] = 2;
        }
        else if(tmp == 3){
            ss[cnt++] = 3;
        }
        else if(tmp == 4){
            ss[cnt++] = 3;
            ss[cnt++] = 2;
            ss[cnt++] = 2;
        }
        else if(tmp == 5){
            ss[cnt++] = 5;
        }
        else if(tmp == 6){
            ss[cnt++] = 5;
            ss[cnt++] = 3;
        }
        else if(tmp == 7){
            ss[cnt++] = 7;
        }
        else if(tmp == 8){
            ss[cnt++] = 7;
            ss[cnt++] = 2;
            ss[cnt++] = 2;
            ss[cnt++] = 2;
        }
        else if(tmp == 9){
            ss[cnt++] = 7;
            ss[cnt++] = 3;
            ss[cnt++] = 3;
            ss[cnt++] = 2;
        }
    }
    sort(ss, ss + cnt, cmp);
    for(int i = 0; i < cnt; i++)
    {
        cout<<ss[i];
    }
    cout<<endl;
    return 0;
}

D：因为无法填满和填充方法多样都不需要考虑直接输出就好，所以只要考虑方法唯一的这种，拓扑排序，ans数组统计每个‘.’共有多少个可以到达的点，每次弹出一个ans = 1的点，并更新ans数组即可。

//
//  main.cpp
//  clanss
//
//  Created by Adam on 16/5/7.
//  Copyright © 2016年 Adam. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
#include <math.h>
#include <queue>
using namespace std;
const int maxn = 2005;
char ss[maxn][maxn];
int ans[maxn][maxn];
int vis[maxn][maxn];
char mm[maxn][maxn];
int dir[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
int n, m;
struct node{
    int x;
    int y;
};
void paint(int x, int y, int d)
{
    if(d == 0){
        mm[x][y] = '^';
        mm[x + 1][y] = 'v';
    }
    else if(d == 1){
        mm[x][y] = 'v';
        mm[x - 1][y] = '^';
    }
    else if(d == 2){
        mm[x][y] = '<';
        mm[x][y + 1] = '>';
    }
    else {
        mm[x][y] = '>';
        mm[x][y - 1]= '<';
    }
}
int isin(int a, int b)
{
    return a >= 0 && a < n && b >= 0 && b < m;
}
int main()
{
    cin>>n>>m;
    int cont = 0;
    for(int i = 0; i < n; i++)
        cin>>ss[i];
    queue<node> que;
    memset(ans, 0, sizeof ans);
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
        {
            if(ss[i][j] == '.'){
                if(isin(i + 1, j)){
                    if(ss[i + 1][j] == '.')
                    {
                        ans[i][j]++;
                        ans[i + 1][j]++;
                    }
                }
                if(isin(i, j + 1)){
                    if(ss[i][j + 1] == '.')
                    {
                        ans[i][j]++;
                        ans[i][j + 1]++;
                    }
                }
                if(ans[i][j] == 1)
                {
                    node tmp;
                    tmp.x = i;
                    tmp.y = j;
                    que.push(tmp);
                }
                cont++;
            }
            else mm[i][j] = '*';
        }
    int cnt = 0;
    memset(vis, 0, sizeof vis);
    while(!que.empty())
    {
        node tmp = que.front();
        int nx = tmp.x, ny = tmp.y;
        que.pop();
        if(vis[nx][ny]) continue;
        vis[nx][ny] = 1;
        for(int i = 0; i < 4; i++)
        {
            int dx = nx + dir[i][0];
            int dy = ny + dir[i][1];
            if(isin(dx, dy) && !vis[dx][dy] && ss[dx][dy] == '.'){
                vis[dx][dy] = 1;
                cnt += 2;
                paint(nx, ny, i);
                for(int k = 0; k < 4; k++)
                {
                    int tx = dx + dir[k][0];
                    int ty = dy + dir[k][1];
                    if(isin(tx, ty) && !vis[tx][ty] && ss[dx][dy] == '.'){
                        ans[tx][ty]--;
                        if(ans[tx][ty] == 1){
                            node tt;
                            tt.x = tx;
                            tt.y = ty;
                            que.push(tt);
                        }
                    }
                }
                break;
            }
        }
    }
    if(cont == cnt){
        for(int i = 0; i < n; i++)
        {
            for(int j = 0;j < m; j++)
            {
                cout<<mm[i][j];
            }
            cout<<endl;
        }
    }
    else
        cout<<"Not unique"<<endl;
    return 0;
}