[{"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}]
输入格式:
输入5行5列的矩阵,每行第一个数前没有空格,每行的每个数之间各有一个空格。
输出格式:
在一行中按照“s=和,t=积”的顺序输出,结果均原样输出,没有列宽控制。
输入样例:
1 4 7 8 5 1 1 1 1 1 2 2 2 5 6 2 2 2 2 2 3 3 3 3 3
输出样例:
s=9,t=60
#include<stdio.h> int main() { int a[5][5],s=0,t=1; for(int i=0;i<5;i++)
for(int j=0;j<5;j++) { scanf("%d",&a[i][j]); if(i==j) s+=a[i][j]; if(i+j==4)
t*=a[i][j]; } printf("s=%d,t=%d",s,t); return 0; }
观察可知主对角线上的数组位置为a[0][0],a[1][1]...a[4][4]
由此发现(主对角线上的数)i=j的规律加到s中
观察可知副对角线上的数组位置为a[0][4],a[1][3]...a[4][0]
由此发现(副对角线上的数)i+j=4的规律,乘到t中
注意第二个if 不能带else,否则a[2][2](示例中第三行第三列中的2)将不能计算进第二个if中