卡片
#include<iostream>
using namespace std;
const int N = 2021;
int a[10];
int main(){
int d = 1, x, t;
for(int i = 0; i < 10; i++){
a[i] = N;
}
while(1){
t = d;
while(t){
x = t % 10;
if(!a[x]){
printf("%d", d - 1);//3181
return 0;
}
a[x]--;
t /= 10;
}
d++;
}
return 0;
}
打卡题
直线
#include<iostream>
using namespace std;
const int X = 20, Y = 21, maxn = 1e6;
typedef long long ll;
struct line{
double k, b;
}lines[maxn];
int main(){
ll num = 0, ans = 0, flag;
double k, b;
for(int x1 = 0; x1 < X; x1++){
for(int y1 = 0; y1 < Y; y1++){
for(int x2 = 0; x2 < X; x2++){
for(int y2 = 0; y2 < Y; y2++){
if(x1 != x2){
flag = 1;
k = (y1 - y2) / (x1 - x2);
b = (y1 * x2 - x1 * y2) / (x2 - x1);
for(int i = 0; i < num; i++){
if(lines[i].k == k && lines[i].b == b){
flag = 0;
break;
}
}
if(flag){
lines[num].k = k;
lines[num].b = b;
num++;
ans++;
}
}
}
}
}
}
// for(int i = 0; i < num; i++){
// printf("%f %f\n", lines[i].k, lines[i].b);
// }
printf("%lld", ans + X);//4501
return 0;
}
答案错误
int进行运算再转化为double,其中涉及整除显然错误,会丢掉很多解而且求的k,b也并不正确
#include<iostream>
using namespace std;
const int X = 20, Y = 21, maxn = 1e6;
typedef long long ll;
struct line{
double k, b;
}lines[maxn];
int main(){
ll num = 0, ans = 0, flag;
double k, b;
for(double x1 = 0; x1 < X; x1++){
for(double y1 = 0; y1 < Y; y1++){
for(double x2 = 0; x2 < X; x2++){
for(double y2 = 0; y2 < Y; y2++){
if(x1 != x2){
flag = 1;
k = (y1 - y2) / (x1 - x2);
b = (y1 * x2 - x1 * y2) / (x2 - x1);
for(int i = 0; i < num; i++){
if(lines[i].k == k && lines[i].b == b){
flag = 0;
break;
}
}
if(flag){
lines[num].k = k;
lines[num].b = b;
num++;
ans++;
}
}
}
}
}
}
// for(int i = 0; i < num; i++){
// printf("%f %f\n", lines[i].k, lines[i].b);
// }
printf("%lld", ans + X);//40257
return 0;
}
用set实现去重计数;pair免去定义结构体数对
#include<iostream>
#include<set>
#include<map>
using namespace std;
const int X = 20, Y = 21;
int main(){
double k, b;
set<pair<double, double> > count;
for(double x1 = 0; x1 < X; x1++){
for(double y1 = 0; y1 < Y; y1++){
for(int x2 = x1 + 1; x2 < X; x2++){
for(int y2 = 0; y2 < Y; y2++){
k = (y1 - y2) / (x1 - x2);
b = (x1 * y2 - y1 * x2) / (x1 - x2);
count.insert({k, b});
}
}
}
}
cout << count.size() + X;//40257
return 0;
}
货物摆放
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn = 1e8;
ll p[maxn];
int main(){
// ll n = 4, num = 0, sqr = sqrt(n), ans = 0;
ll n = 2021041820210418LL, num = 0, sqr = sqrt(n), ans = 0;
for(int i = 1; i <= sqr; i++){
if(n % i == 0){
p[num++] = i;
if(i * i != n) p[num++] = n / i;
}
}
for(int l = 0; l < num; l++){
for(int w = 0; w < num; w++){
for(int h = 0; h < num; h++){
if(p[l] * p[w] * p[h] == n) ans++;
}
}
}
printf("%lld", ans);//2430
return 0;
}
数的拆分
路径
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long ll;
const int N = 2022, M = 21;
ll dp[N];
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main(){
ll x;
memset(dp, -1, sizeof(dp));
dp[1] = 0;
for(int i = 1; i < N; i++){
for(int j = i + 1; j <= i + 21 && j < N; j++){
x = i * j / gcd(i, j);
if(dp[j] == -1) dp[j] = x;
else dp[j] = min(dp[j], x);
}
}
printf("%lld", dp[2021]);//4042000
return 0;
}
答案错误
只记录了i到j的最短距离,而不是从起点到j的最短路径,动规还是没有真正掌握
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 2022, M = 21;
ll dp[N] = {0};//dp[i]记录从1到i的最短路径
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main(){
for(int i = 1; i < N; i++){//从结点i出发
for(int j = i + 1; j <= i + 21 && j < N; j++){//更新可到达结点的最短路径
ll x = i * j / gcd(i, j);
if(dp[j] == -1) dp[j] = x + dp[i];//之前不通,则更新为能连通
else dp[j] = min(dp[j], x + dp[i]);//已有路径,则取更短路径
}
}
printf("%lld", dp[2021]);//10266837
return 0;
}
回路计数
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
const int N = 25;
int visit[N], ans = 0;
ll gcd(ll a, ll b){
if(!b) return a;
return gcd(b, a % b);
}
void dfs(int n, int start, int cnt){
visit[n] = 1;
cnt++;
int flag = 1;
if(cnt >= 21){
if(cnt == 21 && gcd(n, start) == 1) ans++;
return;
}
for(int i = 1; i < 22; i++){
if(!visit[i] && gcd(i, n) == 1) {
dfs(i, start, cnt + 1);
flag = 0;
}
}
if(flag) return;
}
int main(){
visit[0] = 1;
for(int i = 1; i < 22; i++){
memset(visit, 0, sizeof(visit));
dfs(i, i, 0);
}
cout << ans;//118
return 0;
}
答案错误
时间显示
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll t;
scanf("%lld", &t);
t /= 1000;
printf("%02lld:%02lld:%02lld", t / 3600 % 24, t / 60 % 60, t % 60);
return 0;
}
时间处理的打卡版本
砝码称重
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110, W = 1e5 + 10;
int dp[N][W] = {0}, w[N];
int main(){
int n, sum = 0, ans = 0;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", w + i);
sum += w[i];
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= sum; j++){
if(dp[i - 1][j] || w[i] == j || dp[i - 1][j + w[i]] || dp[i - 1][abs(j - w[i])]) dp[i][j] = 1;
}
}
// for(int i = 1; i <= n; i++){
// for(int j = 1; j <= sum; j++){
// printf("%d %d %d, ", i, j, dp[i][j]);
// }
// printf("\n");
// }
for(int i = 1; i <= sum; i++){
if(dp[n][i]) ans++;
}
printf("%d", ans);
return 0;
}
dp的一个典型应用
异或数列
#include<iostream>
using namespace std;
int main(){
int t, n, x;
scanf("%d", &t);
while(t--){
int d[31] = {0}, num = 0, high = 0, ans = 0;
scanf("%d", &n);
while(n--){
scanf("%d", &x);
while(x){
d[num++] += x % 2;
x /= 10;
}
if(num > high) high = num;
}
for(int i = num - 1; i >= 0; i--){
if(d[i] % 2 == 1){
ans = 1;
break;
}
}
printf("%d\n", ans);
}
return 0;
}
通过0%
这题错得相当离谱
- 多个数进行十进制转p进制,注意数组下标num对于每个十进制数都要初始化为0;保留最高位下标
- 十进制n转二进制
d[maxn];
num = 0;
do{
d[num++] = n % 2;
n /= 2;
}while(n);//处理为0的情况
- p进制n转10进制m
poewr = 1;
while(n){
m += (n % 10) * power;//获取个位数并乘以权重
power *= p;//下一权重
n /= 10;//去掉n的个位
}
修正版:
#include<iostream>
using namespace std;
int main(){
int t, n, x;
scanf("%d", &t);
while(t--){
int d[31] = {0}, num = 0, high = 0, ans = 0;
scanf("%d", &n);
for(int i = 0; i < n; i++){
num = 0;
scanf("%d", &x);
while(x){
d[num++] += x % 2;
x /= 2;
}
if(num > high) high = num;
}
for(int i = high - 1; i >= 0; i--){
if(d[i] % 2 == 1){
if(d[i] == 1 || n % 2 == 1) ans = 1;
else ans = -1;
break;
}
}
printf("%d\n", ans);
}
return 0;
}
双向排序
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn];
bool cmp(int x, int y){
return x > y;
}
int main(){
int n, m, p, q;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++){
a[i] = i;
}
while(m--){
scanf("%d%d", &p, &q);
if(p) sort(a + q, a + n + 1);
else sort(a + 1, a + q + 1, cmp);
}
for(int i = 1; i <= n; i++){
printf("%d ", a[i]);
}
return 0;
}
通过60%