第二次上机作业

第一题

#include<iostream>
using namespace std;
int a[999][999];
int a2[999];
int maxi, maxsum, sum;
int n, m;
int main()
{
	cin>> n>> m;
	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++)
	{
		sum = 0;
		for (int j = 1; j <= m; j++) sum += a[i][j];//每行的数求和
		if (sum > maxsum)
		{
			maxsum = sum;//最大的和
			maxi = i;//最大的一行
		}
	}
	cout << "\n";
	for (int i = 1; i <= m; i++)
	{
		a2[i] = a[1][i];
		a[1][i] = a[maxi][i];
		a[maxi][i] = a2[i];
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
			cout<< a[i][j];
		cout<<"\n";
	}
}

第二题

#include<iostream>
using namespace std;
int a[999][999];
int a2[999];
int maxi, maxsum, sum, sun2;
int sum3;
int n, m;
int b = 0;
int main()
{
	cin >> n >> m;
	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 <= i; j++)

			sum += a[i][j];
	}
	cout << sum << endl;
	for (int i = n; i >= 1; i--) {
		for (int j = m; j >= i; j--)
			sun2+= a[i][j];

	}
	cout << sun2 << endl;
	for (int i = 1; i <= n; i++)
		sum3 += a[i][i];
	cout << sum3 << endl;
	
}

第三题

#include<iostream>
#include<string>
using namespace std;
const int SZ = 100;
int main(){
    string carray;
    string s;
    int is_palindrome, m = 0, n = 0;
    cout <<" 请输入" << endl;
    getline(cin,s);
    int len = s.size();
    while (n < len) {
        if (s[n] >= 'A' && s[n] <= 'Z' || s[n] >= 'a' && s[n] <= 'z') {
            carray[m] = s[n];
            m++;
        }
        n++;
    }len = m;
    for (int i = 0;i < s.length();i++) {
        if ('a' <= s[i] && s[i] <= 'z') {
            s[i] =s[i]-32;
        }
    }
       for (int i = 0; i < len / 2; i++)
            {
                if (carray[i] != carray[len - 1 - i])
                {
                    is_palindrome = 0;
                    break;
                }
            }
            if (is_palindrome)
                cout << "Thestringisapalindrome" << endl;
            else
                cout << "Thestringisnotapalindrome" << endl;
            return 0;
        }

第四题

#include<iostream>
#include<vector>
using namespace std;
int main() {
	int m, n;
	cin >> n;
	cin >> m;
	vector<int>vi;
	for (int i = 0; i <= n; i++)
		vi.push_back(i);
	int a = 0;
	while (vi.size() != 1) {
		a = (a + m - 1) %vi.size() ;
		vi.erase(vi.begin() + a);
		cout << *vi.begin() + 1 << endl;
	}


}