今后告别ACM类竞赛了,编程的算法“内功”修炼告一段落
投入计算机视觉门派了,伴着ML、DL走一遭
之前一些存在草稿箱的OJ题,合在一起总结一下,或许今后还用得到
HDU 1023 Train Problem II [ 高精度乘除单精度 + Catalan ]
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int L=100005;
const int MAXN = 1e2 + 10;
int na[L];
string mul(string a, int b) { //高精度a乘单精度b
string ans;
int La = (int)a.size();
fill(na, na + L, 0);
for(int i = La - 1; i >= 0; i--) na[La - i - 1] = a[i] - '0';
int w = 0;
for(int i = 0; i < La; i++) na[i] = na[i] * b + w, w = na[i] / 10, na[i] = na[i] % 10;
while(w) na[La++] = w % 10, w /= 10;
La--;
while(La >= 0) ans += na[La--] + '0';
return ans;
}
string div(string a, int b) { //高精度a除以单精度b
string r, ans;
int d = 0;
if(a == "0") return a; //特判
for(int i = 0; i < a.size(); i++) {
r += (d * 10 + a[i] - '0') / b+ '0'; //求出商
d = (d * 10 + (a[i] - '0')) % b; //求出余数
}
int p = 0;
for(int i = 0; i < r.size(); i++)
if(r[i] != '0') {p = i; break;}
return r.substr(p);
}
int main()
{
string Cal[MAXN];
Cal[0] = "1";
for (int i = 1; i <= 100; i++) {
Cal[i] = mul(Cal[i - 1], (4 * i - 2));
Cal[i] = div(Cal[i], i + 1);
}
int n;
while(scanf("%d", &n) != EOF) {
cout<<Cal[n]<<endl;
}
return 0;
}
LightOJ 1027 A Dangerous Maze [ 概率 ]
#include <stdio.h>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
return (b == 0) ? a : gcd(b, a % b);
}
int main() {
int T;
scanf("%d", &T);
for (int k = 1; k <= T; k++) {
int n, sum = 0, cnt = 0, x;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
sum += abs(x);
if (x > 0)
cnt ++; //cnt表示正数的个数
}
if (cnt) {
int temp = gcd(sum, cnt);
printf("Case %d: %d/%d\n", k, sum / temp, cnt / temp);
}
else printf("Case %d: inf\n", k);
}
}
Gym 100712G Heavy Coins [ 二进制枚举子集 ]
#include <stdio.h>
#include <math.h>
using namespace std;
const int MAXN = 1e1 + 10;
int v[MAXN];
int main() {
int T;
scanf("%d", &T);
while(T--) {
int n,s;
scanf("%d%d", &n, &s);
for (int i = 0; i < n; i++)
scanf("%d", v + i);
int N = 1 << n, ans = -1;
for (int i = 0; i < N; i++) {
int cnt = 0, sum = 0, Min = 1000;
for (int j = 0; j < n; j++) {
if (i & (1 << j)) {
sum += v[j];
cnt ++;
Min = fmin(Min, v[j]);
}
}
if (sum - Min < s && sum >= s)
ans = fmax(ans, cnt);
}
printf("%d\n", ans);
}
}
UVA 10325 The Lottery [ 容斥原理 + 二进制枚举 ]
#include <stdio.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e1 + 10;
ll v[MAXN];
ll gcd(ll a, ll b) {
return b > 0 ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int main() {
int m;
ll n;
while(scanf("%lld%d", &n, &m) != EOF) {
for (int i = 0; i < m; i++)
scanf("%lld", v + i);
ll ans = 0;
int N = 1 << m;
for (int i = 1; i < N; i++) { //先用二进制枚举来算容斥定理,算出反面的总数
int cnt = 0;
ll temp = 1;
for (int j = 0; j < m; j++)
if (i & (1 << j)) {
cnt ++;
temp = lcm(temp, v[j]);
}
if (cnt % 2)
ans += n / temp;
else
ans -= n / temp;
}
printf("%lld\n", n - ans);
}
}
牛客练习赛29 B
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
int s[5][5];
int x[2][5]; //0 表式向左, 1 表式向右, 存储最大的前后缀
int y[2][5]; //0 表式向上, 1 表式向下, 存储最大的前后缀
int cntx[5]; //0 表式向左, 1 表式向右, 存储长度为4的个数
int cnty[5]; //0 表式向上, 1 表式向下, 存储长度为4的个数
int tempx[2][5], tempy[2][5]; //存储次大的前后缀
int main () {
int n;
scanf("%d", &n);
for (int k = 0; k < n; k++) {
for (int i = 0; i < 4; i ++)
for (int j = 0; j < 4; j ++)
scanf("%d", s[i] + j);
//求 x
int sum, flag;
for (int i = 0; i < 4; i ++) {
sum = 0, flag = 0;
for (int j = 0; j < 4; j ++) {
if (s[i][j]) sum++;
else break;
}
if (sum == 4)
cntx[i] ++;
else {
if (sum > x[0][i]) {
tempx[0][i] = x[0][i];
x[0][i] = sum;
flag = 1;
}
}
sum = 0;
for (int j = 3; j >= 0; j --) {
if (s[i][j]) sum++;
else break;
}
if (sum != 4 && sum > x[1][i]) {
if (!flag) x[1][i] = sum;
else {
if (sum > x[0][i]) {
x[0][i] = tempx[0][i];
x[1][i] = sum;
}
}
}
}
//求 y
for (int i = 0; i < 4; i ++) {
sum = 0, flag = 0;
for (int j = 0; j < 4; j ++) {
if (s[j][i]) sum++;
else break;
}
if (sum == 4)
cnty[i] ++;
else
if (sum > y[0][i]) {
tempy[0][i] = y[0][i];
y[0][i] = sum;
flag = 1;
}
sum = 0;
for (int j = 3; j >= 0; j --) {
if (s[j][i]) sum++;
else break;
}
if (sum != 4 && sum > y[1][i]){
if (!flag) y[1][i] = sum;
else {
if (sum > y[0][i]) {
y[0][i] = tempy[0][i];
y[1][i] = sum;
}
}
}
}
}
int Max = -1;
//y方向
int sum;
for (int i = 0; i < 4; i++) {
sum = 0;
sum = y[0][i] + y[1][i];
sum += 4 * cnty[i];
Max = max(Max, sum);
}
for (int i = 0; i < 4; i++) {
sum = 0;
sum = x[0][i] + x[1][i];
sum += 4 * cntx[i];
Max = max(Max, sum);
}
printf("%d\n", Max);
}