1 条题解
-
0
C :
#include<stdio.h> int main() { int n; scanf("%d",&n); int i,j,a[n][3]; for(i=0;i<n;i++){ for(j=0;j<3;j++){ scanf("%d",&a[i][j]); } } for(j=0;j<3;j++){ double t; int s=0; for(i=0;i<n;i++){ s+=a[i][j]; t=(double)s/n; } printf("%.1f ",t); } return 0; }C++ :
#include <bits/stdc++.h> using namespace std; int main(){ int a[100][3]; int n,i,j,s; double v; cin>>n; for(i = 0;i < n;i++){ for(j = 0;j < 3;j++){ cin>>a[i][j]; } } //先循环科目 for(j = 0;j < 3;j++){ s = 0; //再循环人 for(i = 0;i < n;i++){ //cout<<a[i][j]<<" "; s = s + a[i][j]; } v = s * 1.0 / n;//n个科目的成绩 cout<<fixed<<setprecision(1)<<v<<" "; } }Pascal :
var a,b,c:array[1..100000] of longint; i,n:longint; s:real; begin read(n); for i:=1 to n do read(a[i],b[i],c[i]); for i:=1 to n do begin s:=a[i]+s; end; s:=s/n; write(s:0:1,' '); s:=0; for i:=1 to n do begin s:=b[i]+s; end; s:=s/n; write(s:0:1,' '); s:=0; for i:=1 to n do begin s:=c[i]+s; end; s:=s/n; write(s:0:1,' '); end.Java :
import java.util.Scanner; public class Main { public static void main(String args[]){ Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int[][] a=new int[n][3]; for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ a[i][j]=sc.nextInt(); } } int yuwen=0,shuxue=0,yinyu=0; for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ if(j==0){ yuwen+=a[i][j]; } if(j==1){ shuxue+=a[i][j]; } if(j==2){ yinyu+=a[i][j]; } } } double avg1=(double)yuwen/n; double avg2=(double)shuxue/n; double avg3=(double)yinyu/n; System.out.print(String.format("%.1f",avg1)+" "); System.out.print(String.format("%.1f",avg2)+" "); System.out.print(String.format("%.1f",avg3)+" "); } }Python :
n = int(input()) a = [[0 for j in range(3)] for i in range(n)] yw = 0 sx = 0 yy = 0 for i in range(n): t = input().split() for j in range(3): a[i][j] = int(t[j]) for i in range(n): yw += a[i][0] sx += a[i][1] yy += a[i][2] print('%.1f %.1f %.1f' % (yw / n, sx / n, yy / n), end='')
- 1
信息
- ID
- 255
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者