結果
問題 | No.524 コインゲーム |
ユーザー |
|
提出日時 | 2020-05-28 04:26:07 |
言語 | C (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,346 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 34,048 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-13 04:00:57 |
合計ジャッジ時間 | 1,193 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 WA * 9 |
コンパイルメッセージ
main.c:17:5: warning: conflicting types for built-in function 'round'; expected 'double(double)' [-Wbuiltin-declaration-mismatch] 17 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} | ^~~~~ main.c:9:1: note: 'round' is declared in header '<math.h>' 8 | #include<assert.h> +++ |+#include <math.h> 9 | #define inf 1072114514 main.c:18:5: warning: conflicting types for built-in function 'ceil'; expected 'double(double)' [-Wbuiltin-declaration-mismatch] 18 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} | ^~~~ main.c:18:5: note: 'ceil' is declared in header '<math.h>' main.c:24:5: warning: conflicting types for built-in function 'pow'; expected 'double(double, double)' [-Wbuiltin-declaration-mismatch] 24 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} | ^~~ main.c:24:5: note: 'pow' is declared in header '<math.h>' main.c:32:11: warning: conflicting types for built-in function 'llround'; expected 'long long int(double)' [-Wbuiltin-declaration-mismatch] 32 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} | ^~~~~~~ main.c:32:11: note: 'llround' is declared in header '<math.h>'
ソースコード
//set many funcs template//Ver.20190820#include<stdio.h>#include<string.h>#include<stdlib.h>#include<stdbool.h>#include<time.h>#include<assert.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 nHr(int a,int b){return nCr(a+b-1,b);}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;}int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}int sankaku(int x){return ((1+x)*x)/2;}void swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}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 llnHr(long long a,long long b){return llnCr(a+b-1,b);}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;}long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}long long llsankaku(long long x){return ((1+x)*x)/2;}void llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}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);}void dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}void chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}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 strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}int chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}int chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}void shuffledget(int x[],int n){int i,b[524288],p,c;for(i=0;i<n;i++){b[i]=i;}for(i=n;i>=1;i--){p=rand()%i;c=b[i-1];b[i-1]=b[p];b[p]=c;}for(i=0;i<n;i++){scanf("%d",&x[b[i]]);}}int dx4[4]={1,-1,0,0};int dy4[4]={0,0,1,-1};int dx8[8]={-1,-1,-1,0,0,1,1,1};int dy8[8]={-1,0,1,-1,1,-1,0,1};int search(int x,int a[],int n){int st=0,fi=n-1,te;while(st<=fi){te=(st+fi)/2;if(a[te]<x){st=te+1;}else{fi=te-1;}}return st;}void prarr(int arr[],int n){int i;for(i=0;i<n;i++){if(i){printf(" ");}printf("%d",arr[i]);}printf("\n");return;}void getperm(int a[],int n){int i,p;for(i=0;i<n;i++){a[i]=i;}for(i=n-1;i>=1;i--){p=rand()%(i+1);swap(&a[p],&a[i]);}}typedef struct{int val;int node;}sd;int sdsortfnc(const void *a,const void *b){if(((sd*)a)->val < ((sd*)b)->val){return -1;}if(((sd*)a)->val > ((sd*)b)->val){return 1;}return 0;}void coordinate_comp(int a[],int n){int i,c=0;sd dat[524288];for(i=0;i<n;i++){dat[i].val=a[i];dat[i].node=i;}qsort(dat,n,sizeof(dat[0]),sdsortfnc);a[dat[0].node]=c;for(i=1;i<n;i++){if(dat[i-1].val!=dat[i].val){c++;}a[dat[i].node]=c;}}int main(void){long long n,i;scanf("%lld",&n);for(i=2;i<=35;i++){if(n==llpow(2,i)-1){printf("X\n");return 0;}}printf("O\n");return 0;}