結果
問題 | No.275 中央値を求めよ |
ユーザー |
![]() |
提出日時 | 2021-01-26 13:53:26 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 3,901 bytes |
コンパイル時間 | 188 ms |
コンパイル使用メモリ | 33,024 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-23 13:32:57 |
合計ジャッジ時間 | 1,302 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <limits.h>#include <math.h>// Yukicoder №275// https://yukicoder.me/problems/no/275// ***********************// for debug#define DEBUGf#define NOP do{}while(0)#ifdef DEBUG#define TRACE(...) do{printf(__VA_ARGS__);fflush(stdout);}while(0)#define TRACECR do{printf("\n");fflush(stdout);}while(0)#else#define TRACE(...) NOP#define TRACECR NOP#endif#define PRINCR printf("\n")#define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0)// The out-of-date function#define asctime(...) asctime_s(...)#define atof(a) strtod(a,'\0')#define atoi(a) ((int)strtol(a,'\0'))#define atol(a) strtol(a,'\0')#define ctime(...) ctime_s(...)#define strlen(a) mystr_len(a)//#define fopen(...) fopen_s(...)//#define freopen(...) freopen_s(...)//#define rewind(a) fseek(a,0L,SEEK_SET)//#define setbuf(a,b) setvbuf(a,b,_IOFBF,BUFSIZ)// for stdio#define INPUT(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0)#define mygc(c) (c)=getchar()static char *getinput( char* str );static void read1(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}static void read2(int *x, int *y){read1(x);read1(y);}static char *getinput(char* str) {char c;char *cp;cp=&str[0];c=fgetc(stdin);while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=fgetc(stdin);}*cp='\0';return &str[0];}static int max(int a,int b){if(a>b){return a;}return b;}static int min(int a,int b){if(a<b){return a;}return b;}// for readailitytypedef long long lolong;const int INF = 1e9;const int MOD = 1e9+7;const lolong LINF = 1e18;#define PI ((double)3.141592653589793238462643383279)#define YES(a) printf("%s",((a)?"YES":"NO"))#define Yes(a) printf("%s",((a)?"Yes":"No"))#define OK(a) printf("%s",((a)?"OK":"NG"))#define Ok(a) printf("%s",((a)?"Ok":"Ng"))#define POSSIBLE(a) printf("%s",((a)?"POSSIBLE":"IMPOSSIBLE"))#define Possible(a) printf("%s",((a)?"Possible":"Impossible"))#define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)#define REP(a,b) for(int a=0;a<(int)(b);++a)#define REP1(a,b) for(int a=1;a<=(b);++a)#define FLOOP(a,b) for(a=0;a<(b);++a)#define FLOOP1(a,b) for(a=1;a<=(b);++a)#define ABS(c) ((c)<0?(-(c)):(c))#define LSB(i) ((i) & -(i))#define data_s int// ***********************// ***********************static int cmpint_asc(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}static int cmpint_desc(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}static int cmpchar_asc(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}static int cmpchar_desc(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}static int mystr_len(char *str){int i=0;do{if(str[i]=='\0')break;i++;if(i>9999)break;}while(1);return i;}static int countchar(char str[],char c,int limit ) {int cnt = 0;for(int i=0;i<limit;i++) if( str[i] == c )cnt++;return cnt;}// ***********************// ***********************// ***********************// ***********************// ***********************// ***********************// 外部変数int map[1001];// ***********************#define INPBUF (20+3)int main() {char str[INPBUF];int qu;int val;int idx;double ans;INPUT( str );sscanf( str,"%d", &qu);REP(i,qu) {getinput(str);sscanf( str,"%d", &val);map[ i ] = val;}qsort( map , qu , sizeof(int) , cmpint_asc );idx = ( qu / 2. + 0.5 )-1;val = map[ idx ];ans = val;if( !( qu & 1 ) ) {ans = ( val + map[ idx +1 ] )/ 2.;}printf("%.2f\n", ans );return 0;}