Submission #1144979

#TimeUsernameProblemLanguageResultExecution timeMemory
1144979tntFootball (info1cup20_football)C++20
0 / 100
109 ms600 KiB
#include <bits/stdc++.h> using namespace std; //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #define pb push_back #define ll long long //#define sort(all(v)) sort(v.begin(),v.end()) int mod = 998244353; const int N = 2e5 + 10; const int inf = 1e9; int fact[200001]; ll binpow(ll a, ll b){ if(b == 0) return 1; else if(b % 2 == 1) return (a * binpow(a, b - 1)) % mod; ll p = binpow(a,b / 2); return (p * p) % mod; } signed main(){ //freopen("mootube.in", "r", stdin); //freopen("mootube.out", "w", stdout); int t; cin >> t; while(t--){ int n,k; cin >> n >> k; int a[n + 1]; int sum = 0; for(int i = 1; i <= n; i++){ cin >> a[i]; sum += a[i]; } if(k == 1) cout << sum % 2 <<' '; else cout << 1 << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...