2022/7/23
作者:
史一帆
,
2022-07-23 09:29:01
,
所有人可见
,
阅读 156
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long LL;
const int N = 110;
int n, m;
int main(){
while (cin >> n >> m){
if (!n && !m) break;
if (n % 2 && m % 2)
puts("What a pity!");
else
puts("Wonderful!");
}
return 0;
}
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
const int N = 110;
int n;
int main(){
while (cin >> n){
int ans = 0;
while (n -- ){
int x;
cin >> x;
ans ^= x;
}
if (ans)
puts("Yes");
else
puts("No");
}
return 0;
}
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
const int N = 110;
int n;
int a[N];
int main(){
while (cin >> n && n){
int ans = 0;
for (int i = 0; i < n; i ++ ){
cin >> a[i];
ans ^= a[i];
}
int cnt = 0;
for (int i = 0; i < n; i ++ )
if ((ans ^ a[i]) < a[i])
cnt ++ ;
cout << cnt << endl;
}
return 0;
}