1 条题解

  • 0
    @ 2025-9-9 23:53:29

    C :

    #include<stdio.h>
    #include<ctype.h>
    #include<string.h>
    int main(void)
    {
    	int n,i,ok,d,c;
    	char a[1000];
    scanf("%d",&n);
    while(n--)
    {
    ok=0;
    scanf("%s",a);
    d=strlen(a);
    if(d<5)  ok=-1;
    for(i=0;i<d;i++)
    {
    
    	c=isdigit(a[i]);
    	if(c)
    	{
    	ok++;
    	break;
    	
    	}
    
    }
    
    for(i=0;i<d;i++)
    {
    
    c=islower(a[i]);
    
    if(c)
    {
    ok++;
    break;
    
    }
    
    
    }
    
    for(i=0;i<d;i++)
    {
    
    c=isupper(a[i]);
    
    if(c)
    {
    ok++;
    break;
    
    }
    
    
    }
    
    if(ok==3)
    printf("Correct\n");
    else
    printf("Too weak\n");
    
    }
    
    
    
    
    }
    

    C++ :

    #include<stdio.h>
    #include<string.h>
    char s[107];
    int main()
    {
        //freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
        int t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%s",s);
            int len=strlen(s);
            bool large=false,small=false,digit=false;
            if(len<5)printf("Too weak\n");
            else
            {
                for(int i=0;i<len;i++)
                {
                    if(s[i]>='a'&&s[i]<='z')small=true;
                    if(s[i]>='A'&&s[i]<='Z')large=true;
                    if(s[i]>='0'&&s[i]<='9')digit=true;
                }
                if(small&&large&&digit)printf("Correct\n");
                else printf("Too weak\n");
            }
        }
        return 0;
    }
    
    

    Java :

    import java.util.Scanner;
    class Main{
    	public static void main(String[] args) {
    		Scanner reader = new Scanner(System.in);
    		int T = reader.nextInt();
    		for (int j = 0; j < T; j++) {
    			String str = reader.next();
    			char[] ch = str.toCharArray();
    			int a = 0, b = 0, c = 0;
    			if (ch.length < 5) {
    				System.out.println("Too weak");
    			} else {
    				for (int i = 0; i < ch.length; i++) {
    					if (ch[i] >= 'A' && ch[i] <= 'Z') {
    						a = a + 1;
    					}
    					if (ch[i] >= 'a' && ch[i] <= 'z'){
    						b = b + 1;
    					}
    					if(ch[i] >= '0' && ch[i] <= '9'){
    						c=c+1;
    					}
    				}
    				if(a>0&&b>0&&c>0){
    					System.out.println("Correct");
    				}
    				else System.out.println("Too weak");
    			}
    		}
    	}
    }
    
    • 1

    信息

    ID
    1665
    时间
    2000ms
    内存
    2048MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者