4 solutions

  • 0
    @ 2025-1-22 11:49:19
    #include<bits/stdc++.h>
    using namespace std;
    const int N=110;
    double a[N][N],b[N][N]; 
    int main()
    {
    	int n,m;
    	cin>>n>>m;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=m;j++)
    		{
    			cin>>a[i][j];
    		}
    	}
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=m;j++)
    		{
    			cin>>b[i][j];
    		}
    	}
    	int cnt=0;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=m;j++)
    		{
    			if(a[i][j]==b[i][j])
    			{
    				cnt++;
    			}
    		}
    	}
    	int res=n*m;
    	cout<<fixed<<setprecision(2)<<cnt*1.0/res*100;
    	return 0;
    }
    
    • -1
      @ 2024-7-19 16:07:08
      #include<bits/stdc++.h>
      using namespace std;
      const int N=110;
      int a[N][N],b[N][N];
      int main(){
           int n,m;
           cin>>n>>m;
           for(int i=1;i<=n;i++){
                for(int j=1;j<=m;j++) cin>>a[i][j];
           }
           for(int i=1;i<=n;i++){
                for(int j=1;j<=m;j++) cin>>b[i][j];
           }
           int cnt=0;
           for(int i=1;i<=n;i++){
                for(int j=1;j<=m;j++){
                     if(a[i][j]==b[i][j]) cnt++;
                }
           }
           int res=n*m;
           printf("%.2lf",cnt*1.0/res*100);
           return 0;
      }
      
      • -3
        @ 2024-9-16 11:22:23
        #include <bits/stdc++.h>
        using namespace std;
        int const N=105;
        int a[N][N],b[N][N];
        int main()
        {
        	int m,n;
        	double h=0,z=0,v;
        	cin>>m>>n;
        	for(int i=1;i<=m;i++)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			cin>>a[i][j];
        			z++;
        		 } 
        	}
        	for(int i=1;i<=m;i++)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			cin>>b[i][j];
        		 } 
        	}
        	for(int i=1;i<=m;i++)
        	{
        		for(int j=1;j<=n;j++)
        		{
        			if(a[i][j]==b[i][j])h++;
        		 } 
        	}
        	v=100.0/(z/h);
        	printf("%.2lf",v);
        }
        
        • -4
          @ 2024-7-19 16:05:39

          d,gfsdkhfsd

          • 1

          Information

          ID
          905
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          95
          Accepted
          36
          Uploaded By