目录
1.爱吃素
链接https://ac.nowcoder.com/acm/problem/227310
数学找规律题,注意开long long即可,因为数据太大。
一个为素数另一个为1相乘一定为素数,否则返回NO
#include <iostream>
using namespace std;
#define int long long
bool isprime(int num) {
if (num < 2)
return false;
for (int i = 2; i * i <= num; i++)
if (num % i == 0)
return false;
return true;
}
void solve()
{
int a, b;
cin >> a >> b;
if((isprime(a) && b == 1) || (isprime(b) && a == 1))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
signed main()
{
int t;
cin >> t;
while(t--)
solve();
return 0;
}
2.相差不超过k的最多数
链接https://www.nowcoder.com/practice/562630ca90ac40ce89443c91060574c6?tpId=308&tqId=40490&ru=/exam/oj
观察题目之后,很容易想到用一个滑动窗口包住最大值和最小值不超过k的区间即可
因此为了窗口好滑动,应提前将数组排好序
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, k, ret;
int main() {
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i) cin >> a[i];
sort(a.begin() + 1, a.end());
int l = 1, r = 1;
while (r < n) {
while (a[r] - a[l] > k && l <= n)
l++;
while (a[r] - a[l] <= k && r <= n)
r++;
ret = max(ret, r - l);
}
cout << ret << endl;
return 0;
}
3.最长公共子序列(一)
链接https://www.nowcoder.com/practice/672ab5e541c64e4b9d11f66011059498?tpId=230&tqId=39761&ru=/exam/oj
两个数组之间的dp问题,主要是能搞清楚状态表示,后面就好思考了。
#include <iostream>
using namespace std;
const int N = 1010;
int dp[N][N];
char s1[N];
char s2[N];
int n, m;
int main() {
cin >> n >> m;
for(int i = 1; i <= n; ++i) cin >> s1[i];
for(int i = 1; i <= m; ++i) cin >> s2[i];
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
if(s1[i] == s2[j])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
cout << dp[n][m] << endl;
return 0;
}