# TOJ 4109 Cyuunibyou's problem

I make mistakes on this problem's meaning.So I get WA many times.So sad.

The portal:http://acm.tju.edu.cn/toj/showp4109.html

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

int even_tot,odd_tot;

void Deal_with(){
int n;
while(scanf("%d",&n),n){
int temp;
even_tot = 0;
odd_tot = 0;
for(int i=0;i<n;i++){
scanf("%d",&temp);
if(temp&1){
odd_tot ++;
}
else {
even_tot ++;
}
}
if(odd_tot > even_tot && n % 2 == 1){
puts("Justice will prevail over evil.");
}
else if(even_tot > odd_tot && n % 2 == 0){
puts("While the priest climbs a post, the devil climbs ten.");
}
else {
puts("I love this world.");
}
}
}

int main(void){
freopen("a.in","r",stdin);
Deal_with();
return 0;
}

#### Instrction Arrangement （hdu 4109 差分约束）

2015-08-25 23:17:12

#### hdu4109拓扑

2015-08-19 10:29:03

#### hdu4109(拓扑求关键路径)

2015-08-17 20:12:13

#### TOJ-ACM

2013-12-16 21:58:37

#### TOJ 题目分类

2010-11-03 22:39:00

#### TOJ 3772.Rupxup's Math Problem

2017-07-31 20:48:50

#### Codeforces-954F：Runner's Problem（矩阵快速幂+离散化）

2018-03-25 22:15:19

#### found pre-existing rpmdb problem

2016-01-21 08:54:09

#### 【模拟】【HDU1443】 Joseph

2014-10-01 20:10:35

#### TOJ1065Factorial

2017-10-10 14:25:30