[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
原题:功能:编写函数int fun(int a[N][N]),求5行5列矩阵的主、副对角线上元素之和。注意,两条对角线相交的元素只加一次。
算法一:
#include "stdio.h" #define N 3 int fun(int a[N][N]) { int i,j,s=0; for(i=0;i<N;
i++) for(j=0;j<N;j++) if(i==j||i+j==N-1) s=s+a[i][j]; return s; } void main() {
int a[N][N],i,j; for(i=0;i<N;i++) for(j=0;j<N;j++) scanf("%d",&a[i][j]); printf(
"sum=%d\n",fun(a)); }
算法二:
#include "stdio.h" #define N 3 int fun(int a[N][N]) { int i,s=0; for(i=0;i<N;i
++) s=s+a[i][i]+a[i][N-1-i]; s=s-a[(N-1)/2][(N-1)/2]; //减去两条对角线相交的元素 return s; }
void main() { int a[N][N],i,j; for(i=0;i<N;i++) for(j=0;j<N;j++) scanf("%d",&a[i
][j]); printf("sum=%d\n",fun(a)); }