A.
https://ac.nowcoder.com/acm/contest/3004/A
题意:给定一个迷宫 迷宫上有R D B 三种字符分别代表 只能向右 下 右或者下均可 走 问走到迷宫n,m有多少种方法
思路:经典的走格子dp问题 分情况来判别即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL ;
typedef pair<int,int> pii;
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1);
const int N = 10005;
const int M = 1005;
const int mod = 1e9+7;
LL dp[55][55];
char s[55][55];
int n,m;
int main()
{
cin >> n >> m;
for(int i = 1;i <= n;i ++)
cin >> s[i]+1;
dp[1][1] = 1;
for(int i = 1;i <= n;i ++)
{
for(int j = 1;j <= m;j ++)
{
if(s[i][j] == 'R')///转移到右边
dp[i][j+1] = (dp[i][j+1]+dp[i][j])%mod;
if(s[i][j] == 'D')///转移到下边
dp[i+1][j] = (dp[i+1][j]+dp[i][j])%mod;
if(s[i][j] == 'B')///都转移
{
dp[i+1][j] = (dp[i+1][j]+dp[i][j])%mod;
dp[i][j+1] = (dp[i][j+1]+dp[i][j])%mod;
}
}
}
cout << dp[n][m] << '\n';///输出即可
return 0;
}
C.https://ac.nowcoder.com/acm/contest/3004/C
题意:给定一个n,m大小的数组 和n个赋值方式 判断数组是否有越界和非法访问行为
思路:模拟即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL ;
typedef pair<int,int> pii;
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1);
const int N = 1000005;
const int M = 1005;
const int mod = 1e9+7;
int a[N];
int maxx;
int n,m;
int calc(int x,int y)///根据题给公式计算位置
{
if(x*m+y >= maxx || x*m+y < 0)///如果超出n*m 或者 小于0则代表数组越界
return -1;
return x*m+y;
}
int main()
{
int t;
cin >> t;
while(t--)
{
bool flag1 = 1;
bool flag2 = 1;
int p;
cin >> n >> m >> p;
maxx = n*m;
for(int i = 0;i < maxx;i ++)
a[i] = 0;
int x,y,val;
while(p --)
{
cin >> x >> y >> val;
if(x >= n || y >= m || x < 0 || y < 0)
flag2 = 0;///非法访问
int pos = calc(x,y);
if(pos != -1)
a[pos] = val;
else
flag1 = 0;///数组越界
}
if(flag1)
{
for(int i = 0;i < n;i ++)
{
for(int j = 0;j < m;j ++)
{
printf("%d%c",a[calc(i,j)],j == m-1?'\n':' ');
}
}
if(flag2)
{
printf("Accepted\n");
}
else
{
printf("Undefined Behaviour\n");
}
}
else
printf("Runtime error\n");
}
return 0;
}
D.https://ac.nowcoder.com/acm/contest/3004/D
题意:判别二叉树的大小 根节点 每个节点的父节点和左右孩子
思路 :使用结构体来封装每个节点的信息 然后根据数组之间的关系模拟即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL ;
typedef pair<int,int> pii;
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1);
const int N = 2e5+5;
const int M = 1005;
const int mod = 1e9+7;
int a[N];
struct node
{
int f,l,r;
}t[N];
int main()
{
int n;
cin >> n ;
for(int i = 0;i <= 2*n+1;i ++)///初始化为-1代表不存在
a[i] = -1;
int num = 0;///计算有效节点个数
for(int i = 1;i <= n;i ++)
{
cin >> a[i];
if(a[i] != -1)
num ++;
}
printf("The size of the tree is %d\n",num);
printf("Node %d is the root node of the tree\n",a[1]);///根节点为第一个
num = 0;///计算存在节点的个数
for(int i = 1;i <= n;i ++)
{
if(a[i] != -1)
{
num ++;
///a[i] 为序号
t[a[i]].f = a[i/2];///父节点
t[a[i]].l = a[i*2];///左孩子
t[a[i]].r = a[i*2+1];///右孩子
}
}
for(int i = 1;i <= num;i ++)
printf("The father of node %d is %d, the left child is %d, and the right child is %d\n",i,t[i].f,t[i].l,t[i].r);
return 0;
}
F.https://ac.nowcoder.com/acm/contest/3004/F
题意:一个0,1字符串 将两个1的距离可以贡献给答案
思路 : 处理前缀和距离 遇到1的时候增加答案
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL ;
typedef pair<int,int> pii;
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1);
const int N = 2e5+5;
const int M = 1005;
const int mod = 1e9+7;
int a[N];
struct node
{
int f,l,r;
}t[N];
int main()
{
int n;
cin >> n;
string s;
cin >> s;
LL sum,cnt,res;///cnt为1的个数 sum 为前缀和距离
sum = cnt = res = 0;
for(int i = 0;i < n;i ++)
{
sum = (sum+cnt)%mod;///前缀和距离
if(s[i] == '1')///如果遇到1
{
res = (res+sum)%mod;
cnt ++ ;///个数相加
}
}
cout << res << '\n';
return 0;
}
H.
https://ac.nowcoder.com/acm/contest/3004/H
题意:求1~n中 有k个合数因子的数有多少
思路:先从埃式筛排除质数 之后再预处理k个因子的数有多少 数组标记离线回答
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL ;
typedef pair<int,int> pii;
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1);
const int N = 1e5+5;
const int M = 1005;
const int mod = 1e9+7;
int vis[N],prime[N],a[N];
void init()///埃式筛质数
{
int top = 0;
for(int i = 2; i < N; i ++)
{
if(!vis[i])
prime[top++]=i;
for(int j = 0; prime[j]*i < N; j++)
{
vis[prime[j]*i]=1;
if(i % prime[j]==0)
break;
}
}
}
void calc(int x)///计算因子个数
{
int cnt = 0;///因子个数
for(int i = 1;i * i <= x;i ++)///完全平方数
{
if(x % i == 0)///整除代表是因子
{
if(x / i == i)///如果是完全平方根只要加一次即可
{
if(vis[i] == 1)///判断这个因子是不是质数
cnt++;
}
else
{
if(vis[i] == 1)
cnt ++;
if(vis[x/i] == 1)///判断另一个因子是不是质数
cnt ++;
}
}
}
a[cnt]++;//对应k因子的数增加
}
int main()
{
init();
int n,m;
cin >> n >> m;
for(int i = 2;i <= n;i ++)
calc(i);
while(m --)///离线获得答案
{
int x;
cin >> x;
cout << a[x] << '\n';
}
return 0;
}