HUST Online Judge WebBoard
Problem 2504 >> n
sunyicheng @ 2024-12-14 10:51:45
[ Quote ] [ Edit ] [ Delete ] 1#
/gamemode 1
yinziyang @ 2025-11-08 18:47:11
[ Quote ] [ Edit ] [ Delete ] 2#
https://poki.com/zh/g/puppet-master
yinziyang @ 2025-11-08 18:47:42
[ Quote ] [ Edit ] [ Delete ] 3#
https://cspsjtest.noi.cn/index.php
yinziyang @ 2025-11-14 21:50:42
[ Quote ] [ Edit ] [ Delete ] 4#
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int a=-1,b=-1;
for(int i=0;i<s.size();i++){
if(s[i]=='1'){
a=i;
break;
}
}
for(int i=s.size()-1;i>=0;i--){
if(s[i]=='0'&&i>a){
b=i;
break;
}
}

if(a==-1||b==-1){
cout<<s;
}else{
reverse(s.begin()+a,s.begin()+b+1);
cout<<s;
}

return 0;
}
yinziyang @ 2025-11-14 21:52:01
[ Quote ] [ Edit ] [ Delete ] 5#
#include<bits/stdc++.h>
using namespace std;
int a[105][105];
int main() {
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
for (int j=0;j<m;j++){
cin>>a[i][j];
}
}
long long s=0;
for(int i=0;i<n-1;i++){
for(int j=0;j<m-1;j++){
int x=a[i][j];
int b=a[i][j+1];
int c=a[i+1][j];
int d=a[i+1][j+1];
if(x*d==b*c){
s++;
}
}
}
cout<<s<<endl;

return 0;
}
yinziyang @ 2025-11-14 21:52:24
[ Quote ] [ Edit ] [ Delete ] 6#
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin>>n;
long long a;
long long s=0;
for(int i=1;i<=n;i++){
cin>>a;
long long z=a/1000;
long long b=a/100%10;
long long v=a/10%10;
long long o=a%10;
if(o-v-b-z>0){
s++;
}
}
cout<<s;

return 0;
}
yinziyang @ 2025-11-14 21:57:06
[ Quote ] [ Edit ] [ Delete ] 7#
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int x=0;
int sum=0;
for(int i=0;i<s.size();i++){
if(s[i]=='('){
x++;
}else{
if(x<=0){
sum++;
x++;
}else{
x--;
}
}
}
sum+=x/2;
cout<<sum<<endl;

return 0;
}
yuzihao @ 2025-11-15 17:08:57
[ Quote ] [ Edit ] [ Delete ] 8#
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
yuzihao @ 2025-11-15 17:10:57
[ Quote ] [ Edit ] [ Delete ] 9#
告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!告老师!
yinziyang @ 2025-11-22 19:28:03
[ Quote ] [ Edit ] [ Delete ] 10#
#include<bits/stdc++.h>
using namespace std;
int n;
int a[10005];
int dp[10005];
long long s[10005];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
s[i]=s[i-1]+a[i];
}
if(s[n]<0){
cout<<"Impossible";
return 0;
}
for(int i=1;i<=n;i++){
int mx=0;
for(int k=1;k<=i-1;k++){
if(a[k]<a[i]){
mx=max(dp[k],mx);
}
}
dp[i]=mx+1;
}

for(int i=1;i<=n;i++){
if(s[i]>=0){
int mx=INT_MIN;
for(int j=1;j<i;j++){
if(s[i]){
mx=max(mx)
}
}
}
dp[i]=mx;
}
cout<<dp[n];


return 0;
}
yinziyang @ 2025-11-29 17:35:12
[ Quote ] [ Edit ] [ Delete ] 11#
-2 -5
-1 ?