Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

RGB7237 - Арифметик дундаж

Өгөгдсөн бодит тоон дарааллын арифметик дунджийг ол.

Input

Эхний мөрөнд бодит тоон дарааллын элементийн тоо n  өгөгдөнө. n<=10,000.

Дараагийн мөрөнд n ширхэг тоо зайгаар тусгаарлагдан өгөгдөнө.

Output

Арифметик дунджийг таслалаас хойш 2 оронгийн нарийвчлалтайгаар хэвлэнэ.

Example

Input:

3

4.2 5.3 6.24

Output:

5.25


Нэмсэн:Bataa
Огноо:2013-01-23
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 BASH BF C NCSHARP CSHARP C++ 4.3.2 CPP C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO JULIA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON PYPY3 PYTHON3 RUBY SCALA SCM guile ST TCL WHITESPACE
Эх сурвалж:Б.Отгонбаяр

hide comments
2024-01-05 17:00:11
import java.util.Scanner;

public class Think {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);

int n = in.nextInt();
double[] b = new double[n];
double result = 0;
double r = 1;
int i = 0;
while (i < n) {
b[i] = in.nextDouble();
result = result + b[i];
i++;
}
r = result / n;
System.out.printf("%.2f", r);
}
}
2022-12-16 02:13:15
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
double p,s=0,a[10000];
long long i,n;
main(){
scanf("%lld",&n);
for(i=1;i<=n;i++)
scanf("%lf",&a[i]);
for(i=1;i<=n;i++)
{
s=s+a[i];
}
p=s/n;
printf("%.2lf",p);
}
huultsgaa suguudaa
2022-11-08 05:14:43
#include<bits/stdc++.h>
using namespace std;
long a[10001];
main(){
int n, i;
double avg, s=0;
cin >> n;
for (i=0; i<n; i++){
cin >> a[i];
}
for (i=0; i<n; i++) {
s = s + a[i];
}
avg = s / n;
printf("%.2lf", avg);

}
2022-09-22 12:36:26
boolean f=true;
double nu1=0;
double a=0,b=0;

while(f)
{
System.out.print("");
nu1 =scan.nextDouble();
if(nu1<10000)
break;
}
double arr[]=new double[10];
for(int i=0;i<=(nu1-1);i++)
{
System.out.print("");
double nu2=scan.nextDouble();
arr[i]=nu2;
a+=arr[i];
b++;}
System.out.printf("%.2f",(a/b));
2022-05-27 06:23:29
#include<cstdio>
#include<math.h>

int main(){

//freopen("17.in","r",stdin);
//freopen("17.out","w",stdout);

int a,b,c,d,e,f;
scanf("%d",&a);
d=1;
if(a%2==0)
{
for(c=2;c<=a;c=c+2)
{
d=d*c;
}
}
else
{
for(c=1;c<=a;c=c+2)
{
d=d*c;
}
}

printf("%d",d);
return 0;
}

2022-03-18 16:20:32
Practice make you Stronger
----------------------------
#include <iostream>
#include <math.h>
using namespace std;

int main(){
int a;
cin >> a;

double b[a-1] , all=0;

for(int i=0; i<a; i++){
cin >> b[i];
all += b[i];
}

cout.setf(ios::fixed);
cout.precision(2);
cout << all/a << endl;
}
2022-01-26 17:17:25
import java.util.*;
import java.lang.*;

class Main
{
public static void main (String[] args) throws java.lang.Exception
{
try(Scanner scanner = new Scanner(System.in)){
int a = scanner.nextInt();
float sum = 0;
for (int i=1;i<=a;i++) {
float k= scanner.nextFloat();
sum=(float)sum+k;
}sum=sum/a;
System.out.printf("%.2f",sum);
}
}
}
2022-01-24 16:26:36
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main()
{
int a,b;
scanf("%d",&a);
double n[a],d=0;
for(b=1; b<=a;b++)
scanf("%lf",&n[b]);
for(b=1 ;b<=a; b++)
{
d=d+n[b];
}
printf("%.2lf",d/a);
return 0;
}
yum sum num be hha //tugusu
2022-01-18 14:32:16
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int n;
cin>>n;
double num[n],a=0;
for(int i=1;i<=n;i++){
cin>>num[i];

}
for(int i=1;i<=n;i++){
a=a+num[i];

}
cout<<fixed<<setprecision(2)<<a/n;
return 0;
}
2021-10-27 12:34:00
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
//RGB7237 - Арифметик дундаж
int main() {
int n,i;
double a[10005],s=0;
cin >> n;
for(i=1;i<=n;i++){
cin >> a[i];
s=s+a[i];
}
cout << fixed << setprecision(2) << s/n;
return 0;
}
huul Puujee
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.