八皇后:
#include"pch.h"
#include<iostream>
#include<cstdio>
using namespace std;
int N;
int queenPos[100];
void NQueen(int k);
void NQueen(int k) {
int i;
if (k == N) {
for (i = 0; i < N; i++) {
cout << queenPos[i] + 1 << " ";
}
cout << endl;
return;
}
for (i = 0; i < N; i++) {
int j;
for (j = 0; j < k; j++) {
if (queenPos[j] == i || abs(queenPos[j] - i) == abs(k - j)) {
break;
}
}
if (j == k) {
queenPos[k] = i;
NQueen(k + 1);
}
}
}
int main() {
cin >> N;
NQueen(0);
return 0;
}
逆波兰表达式
#include"pch.h"
#include<iostream>
#include<cstdio>
using namespace std;
double exp() {
char s[20];
cin >> s;
switch (s[0])
{
case '+': return exp() + exp();
case '-': return exp() - exp();
case '*': return exp()*exp();
case '/': return exp() - exp();
default: return atof(s);
break;
}
}
int main() {
printf("%lf", exp());
return 0;
}