东方博弈OJ/1201~1220解析

S---Curry@2024

已于 2023-08-01 14:09:53 修改

阅读量309

点赞数 3

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

于 2023-08-01 14:06:43 首次发布

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

版权

1201

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[10][10];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (j > n - i + 1)
			{
				a[i][j] = n - i + 1;
				cout << setw(3) << a[i][j];
			}
			else
			{
				a[i][j] = j;
				cout << setw(3) << a[i][j];
			}
		}
		cout << endl;
	}
	return 0;
}

1202

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[10][10];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (j < n - i + 1)
			{
				a[i][j] = n - i + 1;
				cout << setw(3) << a[i][j];
			}
			else
			{
				a[i][j] = j;
				cout << setw(3) << a[i][j];
			}
		}
		cout << endl;
	}
	return 0;
}

1203

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[10][10];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (n + 1 - j > i)
			{
				a[i][j] = n + 1 - j;
				cout << setw(3) << a[i][j];
			}
			else
			{
				a[i][j] = i;
				cout << setw(3) << a[i][j];
			}
		}
		cout << endl;
	}
	return 0;
}

1204

#include<bits/stdc++.h>
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
	   for(int j=1;j<=n;j++)
    {
       if(i>j) printf("%5c",' ');
       else
       {
            printf("%5d",j-i+1);
       }
    }
    printf("\n");
    }
    return 0;
}

1205

#include<bits/stdc++.h>
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)
			{
				a[i][j] = i;
			}
		}
	}
	for (int k = 1; k <= n - 1; k++)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				if (j > i)
				{
					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;
}

1206

#include<bits/stdc++.h>
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<bits/stdc++.h>
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<bits/stdc++.h>
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<bits/stdc++.h>
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<bits/stdc++.h>
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;
}

1211

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[11],i,n,x,y;
	cin >> n;
	for(i = 0 ; i < n ; i++){
		cin >> a[i];}
	cin >> x;
	cin >> y;
	x--;		
	for(i = n - 1 ; i >= x ; i--){
		a[i + 1] = a[i];
	}
	
	a[x] = y;
	
	n++;
	
	for(i = 0 ; i < n ; i++){
		cout << a[i] << " ";
	}
}

1212

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[100];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	int min = 2147483647;
	int min_sub;
	int max = -2147483647;
	int max_sub;
	for (int i = 0; i < n; i++)
	{
		if (a[i] < min)
		{
			min = a[i];
			min_sub = i;
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (a[i] > max)
		{
			max = a[i];
			max_sub = i;
		}
	}
	int temp = a[0];
	a[0] = a[min_sub];
	a[min_sub] = temp;
	temp = a[n - 1];
	a[n - 1] = a[max_sub];
	a[max_sub] = temp;
	for (int i = 0; i < n; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}

1213

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[100];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	int min = 2147483647;
	int min_sub;
	for (int i = 0; i < n; i++)
	{
		if (a[i] < min)
		{
			min = a[i];
			min_sub = i;
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (i != min_sub)
		{
			cout << a[i] << " ";
		}
	}
	return 0;
}

1214

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[101];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	int num;
	cin >> num;
	int max = -2147483647;
	int max_sub;
	for (int i = 0; i < n; i++)
	{
		if (a[i] > max)
		{
			max = a[i];
			max_sub = i;
		}
	}
	for (int i = n-1; i > max_sub; i--)
	{
		a[i + 1] = a[i];
	}
	a[max_sub + 1] = num;
	for (int i = 0; i < n + 1; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}

1215

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[200];
	int num = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (a[i] > a[j])
			{
				num++;
			}
		}
	}
	cout << num;
}

1216

#include<bits/stdc++.h>
using namespace std;
int n;
int a[101][101];
int dp[101][101];
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i;j++)
        {
            cin>>a[i][j];
            dp[i][j]=a[i][j];
        }
    }
    for(int i=n-1;i>=1;i--)
    {
        for(int j=1;j<=i;j++)
        {
            dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
        }
    }
    cout<<dp[1][1];
}

1217

#include<bits/stdc++.h> 
using namespace std;
int main()
{
	int n, num_xiaoming_front, num_xiaoming;
	cin >> n >> num_xiaoming_front >> num_xiaoming;
	int a[100];
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	for (int i = 0; i < n; i++)
	{
		cout << a[i] << " ";
		if (a[i] == num_xiaoming_front)
		{
			cout << num_xiaoming << " ";
		}
	}
}

1218

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[100];
	int min = 2147483647;
	double sum = 0;
	double num = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
		if (a[i] < min)
		{
			min = a[i];
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (a[i] != min)
		{
			sum += a[i];
			num++;
		}
	}
	cout << fixed << setprecision(1) << sum / num;
}

1219

#include<bits/stdc++.h>
int main()
  {
  int row,space,star,n,m;
  scanf("%d",&n);
  m=n-1;
  for(row=-m/2;row<=(n-1)/2;row++)
  {
  	for(space=1;space<=((n+1)/2)-abs(row)-1;space++)
		printf(" ");
	for(star=1;star<=n;star++)
	    printf("*");
	    printf("\n");
  }
}

1220

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,x,y;
	cin>>n>>x>>y;
	for(int i=n/x; i>=1; i--)
    {
		for(int j=1; j<=n/y; j++)
        {
			if(x*i+y*j==n && i>j)
            {
				cout<<i<<' '<<j<<endl;
				return 0;
			}
		}
	}
	return 0;
}