2020-10-11

10.04补题报告
7-9

#include<bits/stdc++.h>

#define vint vector<int>
#define vstr vector<string>
#define vll vector<long long>
#define ll long long
#define ull unsigned long long
#define pf printf
#define sf scanf
#define sfd(n) scanf("%d", &n)
#define sfc(n) scanf("%c", &n)
#define sflf(n) scanf("%lf", &n)
#define sfll(n) scanf("%lld", &n)
#define pfd(n) printf("%d", n)
#define pfc(n) printf("%c", n)
#define pflf(n) printf("%lf", n)
#define pfll(n) printf("%lld", n)
#define pft	printf("\t")
#define pfn printf("\n")
#define pfk printf(" ")
#define PI 3.1415926
#define MAX 100010
#define MOD ((long long)1e9+7)

using namespace std;

int main() {
	int k, m, n;
	cin >> k >> m >> n;
	int arr[110][110];
	for( int i=0; i<110; i++ ) {
		for( int j=0; j<110; j++ ) {
			arr[i][j] = 0;
		}
	}
	for( int i=0; i<m; i++ ) {
		int a, b, c;
		cin >> a >> b >> c;
		arr[a][b] = c;
		arr[b][a] = c;
	}
	for( int i=0; i<n; i++ ) {
		int a, b;
		cin >> a >> b;
		if( arr[a][b]==-1 ) {
			int f = 0;
			for( int j=0; j<k; j++ ) {
				if( arr[a][j]!=0&&arr[b][j]!=0 ){
					f = 1;
					break;
				}
			}
			if( f ) {
				pf("OK but...\n");
			}else {
				pf("No way\n");
			}
		}else if( arr[a][b]==1 ){
			pf("No problem\n");
		}else if( arr[a][b]==0 ){
			pf("OK\n");
		}
	}

	return 0;
}

7-10

#include<bits/stdc++.h>

#define vint vector<int>
#define vstr vector<string>
#define vll vector<long long>
#define ll long long
#define ull unsigned long long
#define pf printf
#define sf scanf
#define sfd(n) scanf("%d", &n)
#define sfc(n) scanf("%c", &n)
#define sflf(n) scanf("%lf", &n)
#define sfll(n) scanf("%lld", &n)
#define pfd(n) printf("%d", n)
#define pfc(n) printf("%c", n)
#define pflf(n) printf("%lf", n)
#define pfll(n) printf("%lld", n)
#define pft	printf("\t")
#define pfn printf("\n")
#define pfk printf(" ")
#define PI 3.1415926
#define MAX 2000010
#define MOD 998244353

ll arr[MAX];

using namespace std;

int main() {
	string s;
	getline(cin, s);
	int len = s.size();
	int ans = 1;
	int max = 1;
	for( int i=0; i<len; i++ ) {
		for( int j=len-1; j>i; j-- ) {
			if( s[i]==s[j] ) {
				int k;
				for( k=i; k<=j; k++ ) {
					if( s[k]!=s[i+j-k] ) {
						break;
					}
				}
				if( k>j ) {
					ans = j-i+1;
					if( max<ans ) {
						max = ans;
					}
				}
			}
		}
	}
	pfd(max);

	return 0;
}