Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
1
#include <iostream> using namespace std; int main() { int ile=0; scanf("%d",&ile); for(int q=0; q<ile; q++) { int liczba=1; int i=0; int ciag[111111]; while(liczba!=0) { scanf("%d",&liczba); ciag[i]=liczba; i++; } int parzyste = 0; int nieparzyste = 0; int z = 0; while(ciag[z] != 0) { if (ciag[z]%2==0) { parzyste++; } else { nieparzyste++; } z++; } printf("%d %d\n",parzyste,nieparzyste); } }
run
|
edit
|
history
|
help
0
queueLinkedlist
Full System Specifications
test
Bimap operations
fgm
articulation points (http://codeforces.com/contest/732/problem/F)
Geometric Series
LRU - DLL
sheetal
Hii