CSP-J 2024 模拟题2（较简单）答案

1.

#include <bits/stdc++.h>
using namespace std;
int s1=0,s2=0,s3=0,s4=0;
int main(){
    char a[20];
    cin>>a;
    if(strlen(a)<8 || strlen(a)>16)
        cout<<"No";
    else{
    for(long unsigned i=0;i<strlen(a);i++){
        if('A'<=a[i] && a[i]<='Z'){s1=1;}
        else if('0'<=a[i] && a[i]<='9'){s2=1;}
        else if('a'<=a[i] && a[i]<='z'){s3=1;}
        else {s4=1;}
    }
    if(s1==1 && s2==1 && s3==1 && s4==1)
        cout<<"Yes";
    else 
        cout<<"No";
    }
    return 0;
}

2.

#include <bits/stdc++.h>
using namespace std;
int x, y;
string s;
int main() {
	cin >> s;
	for (int i = 0; i < s.length(); i++) {
		if (s[i] == 'R')
			x++;
		if (s[i] == 'L')
			x--;
		if (s[i] == 'U')
			y++;
		if (s[i] == 'D')
			y--;
	}
	cout << abs(0 - x) + abs(0 - y);
	return 0;
}

3.

#include <bits/stdc++.h>
using namespace std;
#include <stdio.h>
int main()
{ 
  long int a[101],s[30000],m,n,i,j,t,max1=0,maxsl;
  cin>>n>>m;
  for(i=1;i<=m;i++)
  {cin>>a[i];
  if(max1<a[i])max1=a[i]; 
  }
  s[0]=0;maxsl=n*max1; 
  for(i=1;i<=n*max1;i++) 
  {   t=n+1;
  	for(j=1;j<=m;j++)
  	if((i-a[j])>=0)
  	{ s[i]=1+s[i-a[j]]; 
  	   if(t>s[i])t=s[i]; 
  	}                  
  	s[i]=t; 
  	if(s[i]>n){ maxsl=i-1;break; }
  }                   
  cout<<maxsl;
	return 0;
}