Codeforces Round #151 (Div. 2) A B C D

A - Buggy Sorting 给出一组使描述中程序出错的数据。可知n <= 2时一定为-1，其他的从n到1输出即可

int n, k;
int a[55];

int main()
{
    int n;
    while( ~scanf("%d", &n) ) {
        if( n == 1 || n == 2 )
            puts("-1");
        else {
            while( n )
                printf("%d ", n--);
            printf("\n");
        }
    }
    return 0;
}

B - Increase and Decrease 给出n个数的数组，每次可选出不同的两个数 a++，b--。在一定次数操作之后问最后有多少个一样的数。

首先可以知道最少一定有n-1个数一样，剩下那个一不一样就看前面的数累计的差值加在他身上有没有和前面的数一样

const int N = 100010;

int a[N];

int main()
{
    int n;
    while( ~scanf("%d", &n) ) {
        ll sum = 0;
        for( int i = 1; i <= n; ++i ) {
            scanf("%d", &a[i]);
            sum += ( 1LL * a[i] );
        }
        if( sum % (1LL*n) == 0 ) {
            printf("%d\n", n);
            continue;
        }
        int cur = a[1], tmp = 0, ans = n-1;
        for( int i = 2; i < n; ++i ) {
            tmp += a[i] - cur;
        }
        a[n] += tmp;
        if( a[n] == cur )
            ans++;
        printf("%d\n", ans);
    }
    return 0;
}

C - Beauty Pageant 给出n个不一样的数选出一些数构造出k组不同的集合，使集合内的和不一样

暴力由大到小枚举即可

int n, k;
int a[55];

int main()
{
    while( ~scanf("%d%d", &n, &k) ) {
        for( int i = 1; i <= n; ++i )
            scanf("%d", &a[i]);
        sort( a+1, a+1+n );
        int cnt = 0;
        for( int i = 1; i <= n && cnt < k; ++i ) {
			printf("1 %d\n", a[i]);
			++cnt;
		}
		if( cnt == k ) 
			continue;
		for( int i = 1; i <= n-1 && cnt < k ; ++i ) {
			printf("2 %d %d\n", a[i], a[n]);
			cnt++;
		}
		if( cnt == k )
			continue;
        for( int i = n; i >= 1 && cnt < k; --i ) {
        	if( cnt == k )
        		break;
            for( int j = i-1; j >= 1 && cnt < k; --j ) {
            	if( cnt == k )
            		break;
            	for( int kk = 1; kk < j; ++kk ) {
            		printf("%d", n-j+2);
            		for( int o = i; o >= j; --o )
            			printf(" %d", a[o]);
            		printf(" %d\n", a[kk]);
            		cnt++;
            		if( cnt == k )
            			break;
				}
            }
        }
    }
    return 0;
}

D - Colorful Graph 给出一张图，每个点都有一种颜色。从里面选出一种颜色k，使k颜色的点相连的点的颜色数目最多。

记录下每种颜色相连的点的颜色，遍历找最大即可

#include <bits/stdc++.h>
#define asd cout << 321321321 << endl;
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 100010;

int n, m;
set <int> s[N];
int col[N];

int main()
{
	while( ~scanf("%d%d", &n, &m) ) {
		for( int i = 1; i <= N-10; ++i )
			s[i].clear();
		int ans, maxx = 0;
		for( int i = 1; i <= n; ++i ) {
			scanf("%d", &col[i]);
			maxx = max( maxx, col[i] );
			ans = min( ans, col[i] );
		}
		for( int i = 1; i <= maxx; ++i )
			s[i].clear();
		for( int i = 1, u, v; i <= m; ++i ) {
			scanf("%d%d", &u, &v);
			if( col[u] != col[v] ) {
				s[col[u]].insert( col[v] );
				s[col[v]].insert( col[u] ); 
			}
		}
		for( int i = 1; i <= maxx; ++i ) {
			if( s[i].size() == 0 )
				continue;
			if( s[i].size() > s[ans].size() || s[i].size() == s[ans].size() && i < ans )
				ans = i;
		}
		printf("%d\n", ans);
	}
	return 0;
}