山东大学23强基班计算机导论第七次习题答案是什么?

摘要:T1.1 int day_of_year(int year,int month,int day) { static int sum[] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; if(year %
T1.1 int day_of_year(int year,int month,int day) { static int sum[] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; if(year % 4 == 0 && year % 100 != 0) sum[2]++; else if(year % 4 == 0 && year % 100 ==0 & year %400==0) sum[2]++; int offset = 0; for(int i=1;i<month;i++) offset+=sum[i]; offset+=day; return offset; } T2.1 #include <stdio.h> int main() { int sum = 0; int n; scanf("%d",&n); for(int i = 0;i < n;i++) for(int j = 0;j < n;j++) { int t; scanf("%d",&t); if(i+j==n-1 || i==n-1 || j==n-1) continue; sum+=t; } printf("%d",sum); } T2.2 #include <stdio.h> int main() { int m,n; scanf("%d%d",&m,&n); for(int i=0;i<m;i++){ int sum=0; for(int j=0;j<n;j++){ int t; scanf("%d",&t); sum+=t; } printf("%d\n",sum); } } T2.3 #include <stdio.h> #define N 128 int A[N][N]; int B[N][N]; int C[N][N]; int main() { int m1,n1,m2,n2; scanf("%d%d",&m1,&n1); for(int i=0;i<m1;i++) for(int j=0;j<n1;j++) scanf("%d",&A[i][j]); scanf("%d%d",&m2,&n2); for(int i=0;i<m2;i++) for(int j=0;j<n2;j++) scanf("%d",&B[i][j]); if(n1!=m2) { printf("Error: %d != %d",n1,m2); return 0; } // In this way,It`s will be faster than normal by about 4 times. for(int k=0;k<n1;k++) for(int i=0;i<m1;i++) for(int j=0;j<n2;j++) C[i][j]+=A[i][k]*B[k][j]; printf("%d %d\n",m1,n2); for(int i=0;i<m1;i++){ for(int j=0;j<n2;j++){ printf("%d",C[i][j]); if(j!=n2-1) putchar(' '); } putchar('\n'); } } T2.4 #include <stdio.h> int main() { int T; sca
阅读全文