牛客周赛Round36补题

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 2000
ll i,j,k,n,m,t,res,a[5050][5050],sb;
set<int> st;
string s;
bool fuck(){
	cin >> n>> m>>t;
	for(i=1;i<=n;i++){
		k = 0;
		for(j=1;j<=m;j++){
			cin >> a[i][j];
			t -=a[i][j]; //结果为0 则和相等 优点少写一个变量 
			k ^= a[i][j];
		}
		st.insert(k);
	}
	if(t) return 0;
	for(i=1;i<=m;i++){
		k = 0;
		for(j=1;j<=n;j++){
			k ^= a[j][i];
		}
		st.insert(k);
	}
	if(t) return 0;
	else if(st.size()==1) return 1;
	else return 0;
	
		
	
}

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	if(fuck()) cout<<"accepted";
	else cout << "wrong answer";
}

#include<bits/stdc++.h>
#include<algorithm>
#include<string>
#include<deque>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
const int INF = 0x3f3f3f3f;
void solve()
{
	string a;
    cin>>a;
    int l = size(a);
	int tmp = 0,s = 0;
	for(int i = 1;i<l;i++){
		if(tmp == 1){
			tmp = 0;
			continue;
		}
		if(a[i] <= 'Z'){
			s += 1;
			tmp = 1;
            continue;
		}
	}
	cout<<s;
}
signed main()
{
    IOS
	solve();
	return 0;
}