F. Jinyu and its outer matrix (construction)

F.The outer matrix of gold and jade(构造)

The impossible case is that the matrix lengths are divisible separately,显然与2矛盾.

否则有解,Consider putting negative numbers in the upper right corner of each submatrix,then and for-1.There must be more lines in the end,Just a positive number.

selected base$mx$要大于$\frac{n}{h}\times \frac{m}{w}$,The final sum is guaranteed to be positive.

#include<bits/stdc++.h>
using namespace std;
long long n,m,h,w;
int main()
{
    
    cin>>n>>m>>h>>w;
    if(n%h==0&&m%w==0)
    {
    
        puts("N");
        return 0;
    }
    int mx = (n/h)*(m/w)+1;
    puts("Y");
    for(int i=1;i<=n;i++)
    {
    
        for(int j=1;j<=m;j++)
        {
    
            if(i%h==0&&j%w==0)
            {
    
                printf("%d ",-mx*w*h+(mx-1));
            }
            else printf("%d ",mx);
        }
        printf("\n");
    }
}