A题:
做法:输出hello world的签到题,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << "hello ygh" << endl;
return 0;
}
D题:
题意:有一个01字符串,需要将他打乱,与原来的不同。
做法:简单模拟,如果不是回文串的话,直接输出反串,否则就正常全1再全0,代码如下:
n=int(input())
s=input()
if s!=s[::-1]:
print(s[::-1])
else:
a1=s.count("1")
a2=s.count("0")
print('1'*a1+'0'*a2)
B题:
题意: n n n个西瓜,每个西瓜有 w i w_i wi重,同时也可以买一半 w i 2 \frac {w_i} 2 2wi,问满足总重量为 w e i g h t ( 1 ≤ w e i g h t ≤ m ) weight(1\leq weight \leq m) weight(1≤weight≤m)的情况下,有多少种情况。
做法:就是一道最基础的01背包,直接背模板就行,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e3 + 10;
int n, m;
int w[N], f[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
f[0] = 1;
for (int i = 1; i <= n; i++)
{
int x;
cin >> x;
for (int j = m; j; j--)
{
if (j >= x)
f[j] = (f[j] + f[j - x]) % mod;
if (j >= x / 2)
f[j] = (f[j] + f[j - x / 2]) % mod;
}
}
for (int i = 1; i <= m; i++)
{
cout << f[i] << " ";
}
cout << endl;
return 0;
}
L题:
做法:一道模拟题,仔细细心就可以,代码如下:
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl 'n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
#define N 1000
#define M 50010
#define BASE 233
#define MOD 998244353
map<string, int> field;
char tmp[M];
int arr[N][M];
int sel[N];
unordered_map<long long, int> mp;
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
{
scanf("%s", tmp);
field[(string)tmp] = i;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
scanf("%d", &arr[i][j]);
}
}
getchar();
scanf("%[^\n]s", tmp);
int len = strlen(tmp);
int add = 36, num = 0;
while (add < len)
{
int adds = add + 1;
while (tmp[adds] != ',' && tmp[adds] != ';')
adds++;
tmp[adds] = 0;
sel[field[(string)(tmp + add)]] = true;
add = adds + 1;
num++;
}
for (int i = 0; i < n; i++)
{
long long val = 0;
for (int j = 0; j < m; j++)
{
if (sel[j])
{
val = val * BASE + arr[i][j] % MOD;
}
}
mp[val]++;
}
printf("%d\n", mp.size());
for (auto &it : mp)
{
printf("%d ", it.second);
}
return 0;
}