蓝桥杯2016年第七届C++B组

蓝桥杯2016年第七届C++B组

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	int ans = 600;
	for (int i = 0; i <= 300; i ++) {
		for (int j = 0; j <= 300; j ++) {
			if (i * 97 - j * 127 == 1) {
				ans = min(ans, i + j);
			}
		}
	}
	cout << ans << endl;
	return 0;
}

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int maxn = 1 << 10;

vector<int> nums;
int ans = 0;

void check(long long x) {
	int status = 0;
	if (x == 0) status = 1;
	while (x) {
		if ((status & (1 << (x % 10))) != 0) return;
		status != (1 << (x % 10));
		x /= 10;
	}
	nums.push_back(status);
}

void dfs(int x, int y) { // 从第x个合法数字往后取，当前组合状态为y 
	if (y == (1 << 10) - 1) {
		ans ++;
		return;
	}
	for (int i = x; i < nums.size(); i ++) {
		if ((nums[i] & y) == 0) {
			dfs(i + 1, nums[i] | y);
		}
	}
}

int main() {
	for (long long i = 0; i <= 100000; i ++) {
		check(i * i);
	}
	dfs(0, 0);
	cout << ans << endl;
	return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

int m, n;

int nbit(int num) {
	int ans = 0;
	while (num) {
		num = (num - 1) & num;
		ans ++;
	}
	return ans;
}

bool check(int now, int floor) {
	int num_a = 0, num_b = 0;
	for (int i = floor; i >= 1; i --) {
		int count1 = nbit(now);
		num_b += count1;
		num_a += i - count1;
		now ^= now >> 1;
		now &= (1 << (i - 1)) - 1;
		if (num_a > m || num_b >> n) return false;
	}
	return num_a == m && num_b == n;
}

int main()
{
	cin >> m >> n;
	int floor = sqrt((n + m) * 2);
	int ans = 0;
	for (int i = 0; i < (1 << floor); i ++) {
		if (check(i, floor)) ans ++;
	}
	cout << ans << endl;
	return 0;
}

#include<iostream>
#include<math.h>
#include<algorithm>

using namespace std;

struct Point {//点
    int x;
    int y;
}P[1010];
struct Line{//线：两个点构成
    Point a;
    Point b;
}L[1010];
struct I_Y{//线的下标编号，还有对应的纵坐标
    int index;
    double y;
}ans[1010];
int N,sum = 0;//点的总数，方块的总数
bool cmp (struct I_Y a,struct I_Y b)//纵坐标排序
{
    return a.y<b.y;
}
int max(int a,int b)
{
    return a>b?a:b;
}
int min(int a,int b){
    return a>b?b:a;
}
double F_y(struct Line l,double x)//求线l经过横坐标为x的点的纵坐标，简单的几何计算。
{
    double x1 = fabs(l.a.x-l.b.x);
    double x2 = fabs(x - l.a.x);
    double y = (l.b.y-l.a.y)*x2/x1 + l.a.y;
    return y;
}
void solve()
{
    int minx ,maxx,i,j,k,count,ax,bx;
    minx = P[0].x;
    maxx = P[0].x;
    for(i=0;i<N;i++){//寻找最小、大横坐标
        if(P[i].x>maxx){
            maxx = P[i].x;
        }
        if(P[i].x<minx){
            minx = P[i].x;
        }
    }
    for(i=minx+1;i<=maxx;i++){//计算每个小长条中的小正方形数量
        count = 0;
        for(j=0;j<N;j++){
            ax = L[j].a.x;
            bx = L[j].b.x;
            if((ax<=i-1&&bx>=i) || (ax>=i && bx <=i-1)){//当这条线和x = i有交点时，记录线编号和交点纵坐标
                ans[count].index = j;
                ans[count].y = F_y(L[j],(i+i-1)/2.0);
                count++;
            }
        }
        sort(ans,ans+count,cmp);//排序
        for(k=0;k<count/2;k++){//向上取整函数 double ceil(double x) 向下取整是double floor(double x) 在#include<math.h>中
            int y1 = max((int)ceil(F_y(L[ans[k*2].index],i)),(int)ceil(F_y(L[ans[k*2].index],i-1)));
            int y2 = min((int)floor(F_y(L[ans[k*2+1].index],i)),(int)floor(F_y(L[ans[k*2+1].index],i-1)));
        //    printf("y1 = %d ,y2 = %d\n",y1,y2);
            if(y2-y1>0){
                sum+=y2-y1;
            }
        }
    }
    cout<<sum<<endl;
}
int main()
{
    int x,y;
    cin>>N;
    for(int i=0;i<N;i++){
        cin>>x>>y;
        P[i].x = x;
        P[i].y = y;
    }
    L[0].a = P[0];//第一个点和最后一个点构成一条线
    L[0].b = P[N-1];
    for(int i=1;i<N;i++){
        L[i].a = P[i];//相邻两点构成一条线
        L[i].b = P[i-1];
    }
    solve();
    return 0;
}