5 solutions

  • 2
    @ 2024-11-9 15:02:26
    #include<bits/stdc++.h>
    using namespace std;
    const int N=600;
    char s1[N],s2[N];
    int main()
    {
    	double m,n;
    	cin>>m;
    	cin>>s1>>s2;
    	double l=strlen(s1);
    	for(int i=0;i<l;i++)
    	{
    		if(s1[i]==s2[i])
    		{
    			n+=1;
    		}
    	}
    	double c=n/l;
    	if(c>=m)
    	{
    		cout<<"yes";
    	}
    	else
    	{
    		cout<<"no";
    	}
    	return 0;
    }
    
    • 1
      @ 2024-7-12 14:36:35
      #include<bits/stdc++.h>
      using namespace std;
      const int N=600;
      char s1[N],s2[N];
      int main()
      {
          double m,n;
          cin>>m;
          cin>>s1>>s2;
          double l=strlen(s1);
          for(int i=0;i<l;i++)
          {
              if(s1[i]==s2[i])
              {
                  n+=1;
              }
          }
          double c=n/l;
          if(c>=m)
          {
              cout<<"yes";
          }
          else
          {
              cout<<"no";
          }
          return 0;
      }
      
      • 0
        @ 2025-3-17 18:15:41
        #include<bits/stdc++.h>
        using namespace std;
        const int N=1e2*5+10;
        char a[N],b[N];
        int main()
        {
            int res=0;
            double y;
            cin>>y>>a>>b;
            int x;
            x=strlen(a);
            for(int i=0;i<x;i++)
            {
                if(a[i]==b[i])
                {
                    res++;
                }
            }
            double n;
            n=res*1.0/x;
            if(n>y)
            {
                cout<<"yes";
            }
            else if(n<y)
            {
                cout<<"no";
            }
            else
            {
                cout<<"yes";
            }
            return 0;
        }
        
      • -1
        @ 2025-1-20 10:24:55
        #include<bits/stdc++.h>
        using namespace std;
        const int N=600;
        char s1[N],s2[N];
        int main()
        {
            double m,n;
            cin>>m;
            cin>>s1>>s2;
            double l=strlen(s1);
            for(int i=0;i<l;i++)
            {
                if(s1[i]==s2[i])
                {
                    n+=1;
                }
            }
            double c=n/l;
            if(c>=m)
            {
                cout<<"yes";
            }
            else
            {
                cout<<"no";
            }
            return 0;
        }
        
        
        • -2
          @ 2024-11-2 15:57:18
          
           jike1994 LV 1 SU @ 3 个月前 
          #include<bits/stdc++.h>
          using namespace std;
          const int N=600;
          char s1[N],s2[N];
          int main()
          {
              double m,n;
              cin>>m;
              cin>>s1>>s2;
              double l=strlen(s1);
              for(int i=0;i<l;i++)
              {
                  if(s1[i]==s2[i])
                  {
                      n+=1;
                  }
              }
              double c=n/l;
              if(c>=m)
              {
                  cout<<"yes";
              }
              else
              {
                  cout<<"no";
              }
              return 0;
          }
          
          • 1

          Information

          ID
          914
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          83
          Accepted
          40
          Uploaded By