![](https://i-blog.csdnimg.cn/blog_migrate/9e08cc8e06c1cd85166498ba68bd2e16.jpeg)
A第几天
125
B明码
#include<bits/stdc++.h>
using namespace std;
bitset<8> word;//将存放一个字节的二进制数字0,1.
string s;
int num,arr[40][10];
int main(){
for(int i = 0; i < 10;i++)
{
for(int i = 0;i < 32;i++) {
cin>>num;
word = num;
s = word.to_string();
for(int j = 0;j < 8;j++)
{
arr[i][j] = s[j] - '0';//0==>0 1==>1
}
}
for(int i = 0;i < 32;i++)
{
for(int j = 0;j <8;j++)
{
if(arr[i][j])
cout<<"*";
else
cout<<" ";
}
if((i+1)%2==0)
cout<<endl;
}
cout<<endl;
}
long long int ans = pow(9,9);
cout<<ans<<endl;
return 0;
}
C测试次数
#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
const int INF = 0x7fffffff;
int n,m,dp[N][N] = {0};/
int main() {
cin>>n>>m;
for(int i = 1; i<=n; i++)
dp[i][1] = i;
for(int j = 1; j <= m; j++)
dp[1][j] = 1;
for(int i = 2; i <= n; i++)
{
for(int j = 2; j<=m; j++)
{
dp[i][j] = INF;
for(int k = 1; k<=i; k++)
{
dp[i][j] = min(dp[i][j],max(dp[k-1][j-1],dp[i-k][j])+1);
}
}
}
cout<<dp[n][m]<<endl;
return 0;
}
D递增三元组
#include<iostream>
#include<algorithm>
using namespace std;
int a[100010];
int b[100010];
int c[100010];
int n;
long long ans = 0;
int main(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
for(int i=1;i<=n;i++)
cin>>c[i];
sort(a+1,a+n+1);
sort(b+1,b+n+1);
sort(c+1,c+n+1);
int j = 1;
int k = 1;
for(int i=1;i<=n;i++)
{
while(j<=n && a[j] < b[i]) j++;
while(k<=n && c[k] <= b[i]) k++;
ans += (long long)(j-1) * (n-k+1);
}
cout<<ans<<endl;
}
E乘积尾零
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
const int N = 2e5 + 10;
int n,m;
string a,b;
d.resize(n+m+1);
for(i=n; i>=0; i--)
cout << d[i] ;
int main()
{
int ans = 31;
cout << ans << endl;;
return 0;
}
F全球变暖
typedef pair<int,int> PII;
int n,m;
char a[1010][1010];
int fx[] = {1,-1,0,0};
int fy[] = {0,0,1,-1};
bool st[1010][1010];
PII bfs(int x,int y)
{
int l = 0,r = 1;
queue<PII> q;
q.push({x,y});
st[x][y] = true;
while(!q.empty())
{
int dx = q.front().first;
int dy = q.front().second;
q.pop();
bool is_l = false;
for(int i = 0; i < 4; i ++)
{
int lx = dx + fx[i];
int ly = dy + fy[i];
if(a[lx][ly] == '.') is_l = true;
if(a[lx][ly] == '#' && !st[lx][ly])
{
st[lx][ly] = true;
q.push({lx,ly});
r ++;
}
}
if(is_l) l ++;
}
return {l,r};
}
int main()
{
cin >> n;
for(int i = 1; i <= n; i ++)
cin >> a[i];
int ans = 0;
for(int i = 1; i <= n; i ++)
{
for(int j = 0; j < n; j ++)
{
if(a[i][j] == '#' && !st[i][j])
{
PII t = bfs(i,j);
if(t.first == t.second)
ans ++;
}
}
}
cout << ans << endl;
return 0;
}
G日志统计
思路:
对于每个id的t存入vector中,每一个vector从小到大排序,如果存在a[i+k-1]-a[i]<D则为热帖
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,d,k;
void slove()
{
cin>>n>>d>>k;
int cnt=0;
unordered_map<int,int>mp;
vector<vector<int>>a;
for(int i=1;i<=n;i++)
{
int t,id;
cin>>t>>id;
if(!mp.count(id))
{
mp[id]=cnt++;
vector<int>b;
a.push_back(b);
}
a[mp[id]].push_back(t);
}
vector<int>ans;
for(auto [id,i]:mp)
{
int m=a[i].size();
if(m<k)continue;
sort(a[i].begin(),a[i].end());
for(int j=0;j+k-1<m;j++)
{
if(a[i][j+k-1]-a[i][j]<d)
{
ans.push_back(id);
break;
}
}
}
sort(ans.begin(),ans.end());
for(auto id:ans)
cout<<id<<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int T=1;
while(T--)
{
slove();
}
return 0;
}
H乘积最大
思路:
当k为偶数时
答案一定为非负数,只需要将数组排序后从前后2个2个取比大小即可得
若k为奇数时
1.全为负数则答案为负数
2.选取一个非负数后当作k为偶数的情况
代码:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define int long long
const int mod = 1000000009;
const int N = 2e5 + 10;
int n,m,k;
int a[N];
signed main()
{
cin >> n >> k;
int ans = 1;
for(int i = 1 ; i <= n; i ++)
{
cin >> a[i];
}
sort(a + 1,a + n +1);
int l = 1,r = n;
int sig = 1, mn = 1;
if(k & 1)
{
ans = a[r];
if(ans < 0) sig = -1;
r --;
k --;
}
while(k)
{
int ll = a[l] * a[l + 1];
int rr = a[r] * a[r - 1];
if((ll * sig) >= (rr * sig))
{
ans = (ll % mod) * (ans % mod);
l += 2;
}
else
{
ans = (rr % mod) * (ans % mod);
r -= 2;
}
k -= 2;
}
cout << ans % mod << endl;
return 0;
}