东方博弈OJ/1161~1180解析

S---Curry@2024

已于 2024-04-24 20:19:58 修改

阅读量287

点赞数

文章标签：算法 c++ 数据结构

于 2023-07-16 11:45:51 首次发布

本文链接：https://blog.csdn.net/herryhzx/article/details/131748609

版权

1206

#include <iostream>

#include <iomanip>

using namespace std;

int main()

{

int n;

cin >> n;

int a[100][100] = { 0 };

for (int i = 1; i <= n; i++)

{

for (int j = 1; j <= n; j++)

{

for (int k = 1; k <= n; k++)

{

if (i + j == k + n)

{

a[i][j] = k;

}

}

}

}

for (int i = 1; i <= n; i++)

{

for (int j = 1; j <= n; j++)

{

if (a[i][j] == 0)

{

cout << setw(5) << " ";

}

else

{

cout << setw(5) << a[i][j];

}

}

cout << endl;

}

return 0;

}

1207

#include <iostream>

#include <iomanip>

using namespace std;

int main()

{

int n;

cin >> n;

int a[12][12] = { 0 };

for (int i = 1; i <= n; i++)

{

for (int j = 1; j <= n; j++)

{

if (i + j == n + 1)

{

a[i][j] = n + 1 - i;

}

}

}

for (int k = 1; k <= n - 1; k++)

{

for (int i = 1; i <= n; i++)

{

for (int j = 1; j <= n; j++)

{ if (i+j>n+1)

{

a[i][j] = a[i][j - 1] + a[i - 1][j];

}

}

}

}

for (int i = 1; i <= n; i++)

{

for (int j = 1; j <= n; j++)

{

if (a[i][j] == 0)

{

cout << setw(5) << " ";

}

else

{

cout << setw(5) << a[i][j];

}

}

cout << endl;

}

return 0;

}

1208

#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

int i,j,n,cnt=1;

cin>>n;

int a[n][n];

for(i=0;i<n/2+1;i++)

{

for(j=i;j<=n-i-1;j++)

{

a[i][j]=cnt++;

}

for(j=i+1;j<=n-i-1;j++)

{

a[j][n-1-i] = cnt++;

}

for(j=n-2-i;j>=i;j--)

{

a[n-i-1][j]=cnt++;

}

for(j=n-2-i;j>=i+1;j--)

{

a[j][i]=cnt++;

}

}

for(i=0;i<n;i++)

{

for(j=0;j<n;j++)

{

printf("%3d",a[i][j]);

}

cout<<endl;

}

return 0;

}

1209

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int loop = n ;
	int a[100][100] = { 0 };
	int startX = 0, startY = 0;
    int k = n;
    int offset = 1;
    int i, j;
    while (loop--)
    {
        i = startX;
        j = startY;
        for (j = startY; j <= startY + 1 + 2 * n - offset; j++)
            a[startX][j] = k; 
        for (i = startX; i <= startX + 1 + 2 * n - offset; i++)
            a[i][startY + 1 + 2 * n - offset] = k;
        for (j = startY + 1 + 2 * n - offset; j >= startY; j--)
            a[startX + 1 + 2 * n - offset][j] = k;
        for (i = startX + 1 + 2 * n - offset; i >= startX; i--)
            a[i][startY] = k;
        startX++;
        startY++;
        offset += 2;
        k--;
    }
	int mid = n ;//中间位置
	if (n % 2 == 1)
	{
		a[mid][mid] = 0;
	}
    for (int i = 0; i < 2 * n + 1; i++)
    {
        for (int j = 0; j < 2 * n + 1; j++)
        {
            cout << setw(2) << a[i][j];
        }
        cout << endl;
    }
	return 0;
}

这里用了别人的代码，谅解一下。

1210

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
	int a[15][15];
	int n, m;
	cin >> n >> m;
	int num = 0;
	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++)
		{
			int judge1 = 0;
			int judge2 = 0;
			for (int k = 1; k <= m; k++)
			{
				if (a[i][k] < a[i][j])
				{
					judge1 = 1;
				}
			}
			for (int k = 1; k <= n; k++)
			{
				if (a[k][j] > a[i][j])
				{
					judge2 = 1;
				}
			}
			if (judge1 == 0 && judge2 == 0)
			{
				cout << i << " " << j << " " << a[i][j] << endl;
				num++;
			}
		}
	}
	if (num == 0)
	{
		cout << "not exist";
	}
	return 0;
}

如果你喜欢我的博客可以点个赞支持一下。