Codeforces Gym101572 J.Judging Moose (2017-2018 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2017))

 Problem J Judging Moose

这个题是这里面最简单的一个题。。。

代码:

 1 //J
 2 #include <stdio.h>
 3 #include <math.h>
 4 #include <string.h>
 5 #include <stdlib.h>
 6 #include <iostream>
 7 #include <sstream>
 8 #include <algorithm>
 9 #include <string>
10 #include <queue>
11 #include <map>
12 #include <vector>
13 using namespace std;
14 const int maxn = 1005;
15 const int maxm = 1e4+10;
16 const int inf = 0x3f3f3f3f;
17 const double epx = 1e-10;
18 typedef long long ll;
19 int a[maxn];
20 int n,m;
21 int main(){
22     while(~scanf("%d%d",&n,&m)){
23         if(m==0&&n==0)printf("Not a moose\n");
24         else if(m==n)printf("Even %d\n",2*n);
25         else printf("Odd %d\n",2*max(n,m));
26     }
27     return 0;
28 }

本来想把D,E,I也都写了，但是，补不粗来啊！！！，只能补个I题(抱头痛哭)

溜了，I题代码还要调试呢(；´д｀)ゞ