蓝桥杯——8

机器人：

#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;

int main() {
	int n;
	cin >> n;
	int x = 0, y = 0;
	string zhiling = "";
	int len = 0;
	int toward = 0;   //0,1,2,3是四个朝向
	for (int i = 0; i < n; i++) {
		cin >> zhiling >> len;
		if (zhiling == "forward") {
			if (toward == 0) {
				x += len;
			}
			if (toward == 1) {
				y += len;
			}
			if (toward == 2) {
				x -= len;
			}
			if (toward == 3) {
				y -= len;
			}
		}
		if (zhiling == "back") {
			toward = (toward + 2) % 4;
			if (toward == 0) {
				x += len;
			}
			if (toward == 1) {
				y += len;
			}
			if (toward == 2) {
				x -= len;
			}
			if (toward == 3) {
				y -= len;
			}
		}
		if (zhiling == "left") {
			toward = (toward + 1) % 4;
			if (toward == 0) {
				x += len;
			}
			if (toward == 1) {
				y += len;
			}
			if (toward == 2) {
				x -= len;
			}
			if (toward == 3) {
				y -= len;
			}
		}
		if (zhiling == "right") {
			toward = (toward - 1 + 4) % 4;
			if (toward == 0) {
				x += len;
			}
			if (toward == 1) {
				y += len;
			}
			if (toward == 2) {
				x -= len;
			}
			if (toward == 3) {
				y -= len;
			}
		}
	}
	cout << x << " " << y << endl;
	return 0;
}

枚举：

Q：枚举n到m之间的所有质数

#include<iostream>
#include<cmath>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	bool is_prime = true;
	for (int i = n; i <= m; i++) {
		if (i == 1) continue;
		for (int j = 2; j <= sqrt(i); j++) {
			if (i % j == 0) {
				is_prime = false;
				break;
			}
		}
		if (is_prime)
			cout << i << '\n';
		is_prime = true;
	}
	return 0;
}

Q;回文数字

#include<iostream>
#include<cmath>
using namespace std;
bool is_n(int i, int n) {
	int sum = 0;
	while (i) {
		sum += i % 10;
		i /= 10;
	}
	if (n == sum) return true;
	else return false;
}
bool is_huiwen(int i) {
	int j = i;
	int a = 0;
	while (i) {
		a = a * 10 + i % 10;
		i /= 10;
	}
	if (j == a)
		return true;
	else return false;
}
int main() {
	int n;
	cin >> n;
	int flag = 0;
	for (int i = 10000; i <= 999999; i++) {
		if (is_n(i,n)) {
			if (is_huiwen(i)) {
				cout << i << endl;
				flag = 1;
			}
		}
	}
	if (flag == 0)
		cout << "-1" << '\n';
	return 0;
}

Q：四叶玫瑰

#include<iostream>
#include<cmath>
using namespace std;
bool is(int n) {
	int a = n % 10;
	int b = (n / 10) % 10;
	int c = (n / 100) % 10;
	int d = (n / 1000) % 10;
	a = a * a * a * a;
	b = b * b * b * b;
	c = c * c * c * c;
	d = d * d * d * d;
	int sum = a + b + c + d;
	if (sum == n)
		return true;
	else
		return false;
}
int main() {
	int n;
	cin >> n;
	if (n < 1000 || n>9999) {
		cout << "error!";
	}
	else {
		for (int i = 1000; i <= n; i++) {
			if (is(i))
				cout << i << endl;
		}
	}

	return 0;
}

Q：生日蜡烛

#include<iostream>
#include<cmath>
using namespace std;
int is(int i) {
	int num = 0;
	for (int j = i; j <= 200; j++) {
		num += j;
		if(num==236) return 1;
		if (num > 236) return 0;
		else return 0;
	}	
}
int main() {
	for (int i = 1; i <= 200; i++) {
		if (is(i))
			cout << i << endl;
	}
	return 0;
}

Q：奖券数目

#include<iostream>
#include<cmath>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	int sum = 0;
	for (int i = n; i <= m; i++) {
		if (i / 10000 == 4)
			continue;
		if ((i / 1000) % 10 == 4)
			continue;
		if ((i / 100) % 10 == 4)
			continue;
		if ((i / 10) % 10 == 4)
			continue;
		if (i % 10 == 4)
			continue;
		sum++;
	}
	cout << sum << endl;
	return 0;
}

Q：枚举

#include<iostream>
#include<cmath>
using namespace std;

int main() {
	int vis[14] = { 0 };
	int sum = 0;
	for (int a1 = 1; a1 <= 13; a1++) {
		vis[a1] = 1;
		for (int a2 = 1; a2 <= 13; a2++) {
			if (vis[a2] || a1+a2>13 || vis[a1+a2]) continue;
			vis[a2] = 1;
			vis[a1 + a2] = 1;
			for (int a3 = 1; a3 <= 13; a3++) {
				if (vis[a3]) continue;
				vis[a3] = 1;
				for (int a4 = 1; a4 <= 13; a4++) {
					if (vis[a4] || a3 - a4 < 1 || a3-a4>14 || vis[a3 - a4]||a4==a3-a4) continue;
					vis[a4] = 1;
					vis[a3 - a4] = 1;
					for (int a5 = 1; a5 <= 13; a5++) {
						if (vis[a5]) continue;
						vis[a5] = 1;
						for (int a6 = 1; a6 <= 13; a6++) {
							if (vis[a6] || a5 * a6 > 13 || vis[a5 * a6]|| a6==a5*a6) continue;
							vis[a6] = 1;
							vis[a5 * a6] = 1;
							for (int a7 = 1; a7 <= 13; a7++) {
								if (vis[a7]) continue;
								vis[a7] = 1;
								for (int a8 = 1; a8 <= 13; a8++) {
									if (vis[a8] || a7<a8 ||a7 % a8 != 0 || vis[a7 / a8] || a8==a7/a8) continue;
									cout << a1 << "+" << a2 << "=" << a1 + a2 << '\n';
									cout << a3 << "-" << a4 << "=" << a3 - a4 << '\n';
									cout << a5 << "*" << a6 << "=" << a5 * a6 << '\n';
									cout << a7 << "/" << a8 << "=" << a7 / a8 << '\n';
									sum++;
								}
								vis[a7] = 0;
							}
							vis[a6] = 0;
							vis[a5 * a6] = 0;
						}
						vis[a5] = 0;
					}
					vis[a4] = 0;
					vis[a3 - a4] = 0;
				}
				vis[a3] = 0;
			}
			vis[a2] = 0;
			vis[a1 + a2] = 0;
		}
		vis[a1] = 0;
	}
	cout << '\n';
	cout << sum << endl;;

	return 0;
}

Q：方程的解

#include <iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int i = 1; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                if (i * i + j * j + k * k == n)
                    cout << i << " " << j << " " << k << endl;
            }
        }
    }
    return 0;
}

更优的

#include <iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int i = 1; i*i < n; i++) {
        for (int j = i + 1; j*j+i*i < n; j++) {
            for (int k = j + 1; i * i + j * j + k * k <= n; k++) {
                if (i * i + j * j + k * k == n)
                    cout << i << " " << j << " " << k << endl;
            }
        }
    }
    return 0;
}

————————————————————————

吃午饭去啦！！

下午继续！！！