2 solutions

  • 0
    @ 2026-7-31 22:07:14
    #include<bits/stdc++.h>
    using namespace std;
    const int N=110;
    char a[N][N],b[N][N];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=n;j++)
    		{
    			cin>>a[i][j];
    		}
    	}
    	for(int i=1;i<=n;i++) 
    	{
    		for(int j=1;j<=n;j++)
    		{
    			cin>>b[i][j];
    		}
    	}
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=n;j++)
    		{
    			if(a[i][j]!=b[i][j])
    			{
    				cout<<i<<" "<<j<<endl; 
    			}
    		}
    	}
    	return 0;	
    }
    • 0
      @ 2025-4-15 17:16:17
      #include<bits/stdc++.h>
      using namespace std;
      const int N=110;
      char a[N][N],b[N][N];
      int main()
      {
      	int n;
      	cin>>n;
      	for(int i=1;i<=n;i++) //输入第一个二维字符数组 
      	{
      		for(int j=1;j<=n;j++)
      		{
      			cin>>a[i][j];
      		}
      	}
      	for(int i=1;i<=n;i++) //输入第二个二维字符数组 
      	{
      		for(int j=1;j<=n;j++)
      		{
      			cin>>b[i][j];
      		}
      	}
      	for(int i=1;i<=n;i++)
      	{
      		for(int j=1;j<=n;j++)
      		{
      			if(a[i][j]!=b[i][j]) //找到不同的位置并输出 
      			{
      				cout<<i<<" "<<j<<endl; 
      			}
      		}
      	}
      	return 0;	
      } 
      
      • 1

      Information

      ID
      2454
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      28
      Accepted
      20
      Uploaded By