PAT刷题笔记

1090

#include 
#include 
#include 

1091

#include 
#include 
using namespace std;
int main() {
    int m;
    cin >> m;
    while (m--) {
        int k, flag = 0;
        cin >> k;
        for (int n = 1; n < 10; n++) {
            int mul = n * k * k;
            string smul = to_string(mul), sk = to_string(k);
            string smulend = smul.substr(smul.length() - sk.length());
            if (smulend == sk) {
                printf("%d %d\n", n, mul);
                flag = 1;
                break;
            }
        }
        if (flag == 0) printf("No\n");
    }
    return 0;
}

1092

#include 
#include 
using namespace std;
int a[1005][105], sum[1005];
int main() {
    int m, n, maxn = 0, total = 0;
    vector ans;
    cin >> m >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            sum[j] += a[i][j];
            maxn = max(maxn, sum[j]);
        }
    }
    cout << maxn << endl;
    for (int i = 1; i <= m; i++)
        if (sum[i] == maxn) ans.push_back(i);
    for (int i = 0; i < ans.size(); i++) {
        if (i != 0) cout << " ";
        cout << ans[i];
    }
    return 0;
}

1093

#include 
#include 
using namespace std;

int main(){
	string s1,s2,s;
	getline(cin,s1);
	getline(cin,s2);
	s = s1 + s2;
	int hash[200] = {0};
	for(int i = 0;i

1094

#include
using namespace std;
int is(int number)
{
	for (int i = 2; i <= sqrt(number); i++)
	{
		if (number%i == 0)
		{
			return 0;
		}
	}
	return 1;
}
int main()
{
	int l, k, p;
	cin >> l >> k;
	string a, b;
	getchar();
	getline(cin, a);
	int len = a.length();
	for (int i = 0; i <= len - k; i++)
	{
		b = a.substr(i, k);
		p = atoi(b.c_str());
		if (is(p))
		{
			cout << b;
			return 0;
		}
	}
	cout << "404";
	return 0;
}