oj.uz

답안 #86836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
86836 2018-11-27T18:25:19 Z jovitre Prosjek (COCI18_prosjek) C++14
50 / 50
 2 ms 672 KB 
#include <bits/stdc++.h>

using namespace std;

#define MAXN 25
#define MAXSZ 2050
#define INF 999999999
#define pb push_back

typedef long long ll;
typedef pair <int, int> pii;
typedef vector <ll> vi;

int in[MAXN];

int main(){
	int n;
	scanf("%d", &n);

	for(int i = 1; i <= n; i++) scanf("%d", in + i);

	sort(in + 1, in + n + 1);

	if(n == 1) printf("%d\n", in[1]);
	else {
		double atual = (double)(in[1] + in[2]) / 2.00;
		for(int i = 3; i <= n; i++) atual = (double)(atual + in[i]) / 2.00;
	
		printf("%lf\n", atual);
	}

	return 0;
}

Compilation message

prosjek.cpp: In function 'int main()':
prosjek.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
prosjek.cpp:20:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= n; i++) scanf("%d", in + i);
                              ~~~~~^~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 2 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct