3 solutions

  • 0
    @ 2025-6-9 17:13:56
    #include<bits/stdc++.h>
    using namespace std;
    const int N=25;
    char s[N][N];
    int main()
    {
        for(int i=1;i<=10;i++)
        {
            for(int j=1;j<=10;j++)
            {
                cin>>s[i][j];          
            }
        }
        char s1[15][15];
        for(int q=1;q<=10;q++)
            for(int w=q;w<=10;w++)
                for(int x=1;x<=10;x++)
                    for(int y=x;y<=10;y++)
                    {
                        memset(s1,'.',sizeof s1);
                        for(int f=q;f<=w;f++)
                            for(int g=x;g<=y;g++)
                            {
                                s1[f][g]='#';
                            }          
                            int b=0;
                            for(int i=1;i<=10;i++)
                            {
                                for(int j=1;j<=10;j++)
                                {
                                    if(s[i][j]==s1[i][j])
                                    {
                                        b++;
                                    }
                                }
                            }
                            if(b==100)
                            {
                                cout<<q<<" "<<w<<endl;
                                cout<<x<<" "<<y<<endl;
                                return 0;
                            }
                    }
        return 0;
    }
    
    • 0
      @ 2025-6-9 17:12:16
      #include<bits/stdc++.h>
      using namespace std;
      const int N=110;
      char g[N][N];
      int main()
      {
      	int n=10,m=10;
      	int a=100,b=0,c=100,d=0;
      	for(int i=1;i<=n;i++)
      	{
      		for(int j=1;j<=n;j++)
      		{
      			char x;
      			cin>>x;
      			if(x=='#')
      			{
      				a=min(a,i);
      				c=min(c,j);
      				b=max(b,i);
      				d=max(d,j);
      			}
      		}
      	}
      	cout<<a<<" "<<b<<endl;
      	cout<<c<<" "<<d<<endl;
      	return 0;
      }
      
      
      • 0
        @ 2025-6-9 16:55:37
        #include<bits/stdc++.h>
        using namespace std;
        const int N=15;
        char a[N][N],b[N][N]; 
        int main()
        {
        	int n=10,m=10;
        	for(int i=1;i<=n;i++)
        	{
        		for(int j=1;j<=m;j++)
        		{
        			cin>>a[i][j];
        		}
        	}
        	for(int r1=1;r1<=n;r1++)
        	{
        		for(int r2=r1;r2<=n;r2++)
        		{
        			for(int c1=1;c1<=m;c1++)
        			{
        				for(int c2=c1;c2<=m;c2++)
        				{
        					memset(b,'.',sizeof b);
        					for(int i=r1;i<=r2;i++)
        					{
        						for(int j=c1;j<=c2;j++)
        						{
        							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++;
        							}
        						}
        					}
        					if(cnt==100)
        					{
        						cout<<r1<<" "<<r2<<endl;
        						cout<<c1<<" "<<c2<<endl;
        						return 0;
        					}
        				}
        			}
        		}
        	}
        	return 0;
        }
        
        
        • 1

        Information

        ID
        2421
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        5
        Accepted
        2
        Uploaded By