結果
問題 | No.601 Midpoint Erase |
ユーザー |
|
提出日時 | 2017-12-01 00:06:59 |
言語 | C90 (gcc 12.3.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,941 bytes |
コンパイル時間 | 392 ms |
コンパイル使用メモリ | 27,648 KB |
最終ジャッジ日時 | 2025-01-29 10:18:55 |
合計ジャッジ時間 | 1,732 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.c:1:1: error: C++ style comments are not allowed in ISO C90 1 | //set many funcs template | ^ main.c:1:1: note: (this will be reported only once per input file) main.c:15:5: warning: conflicting types for built-in function 'ceil'; expected 'double(double)' [-Wbuiltin-declaration-mismatch] 15 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} | ^~~~ main.c:6:1: note: 'ceil' is declared in header '<math.h>' 5 | #include<stdbool.h> +++ |+#include <math.h> 6 | #define inf 1072114514 main.c:20:5: warning: conflicting types for built-in function 'pow'; expected 'double(double, double)' [-Wbuiltin-declaration-mismatch] 20 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} | ^~~ main.c:20:5: note: 'pow' is declared in header '<math.h>'
ソースコード
//set many funcs template#include<stdio.h>#include<string.h>#include<stdlib.h>#include<stdbool.h>#define inf 1072114514#define llinf 4154118101919364364#define mod 1000000007#define pi 3.1415926535897932384int max(int a,int b){if(a>b){return a;}return b;}int min(int a,int b){if(a<b){return a;}return b;}int zt(int a,int b){return max(a,b)-min(a,b);}int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}long long llmax(long long a,long long b){if(a>b){return a;}return b;}long long llmin(long long a,long long b){if(a<b){return a;}return b;}long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}double dbmax(double a,double b){if(a>b){return a;}return b;}double dbmin(double a,double b){if(a<b){return a;}return b;}double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}int main(void){int i,j,n,x,y,b[2][2]={0},r=0;scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d%d",&x,&y);b[x%2][y%2]++;}r+=b[0][0]/2;r+=b[0][1]/2;r+=b[1][0]/2;r+=b[1][1]/2;if(r%2){printf("Alice\n");}else{printf("Bob\n");}return 0;}