#include <iostream> using namespace std; int main(){ int n,x; cin >> n >> x; int sum = 0; for(int i = 0 ; i < n ; ++ i){ int number; cin>> number; sum +=number; } if(sum < 0) sum = -sum; cout<<(sum%x ? sum/x+1 : sum/x) <<endl; }
#include <iostream> using namespace std; int main(){ int n,x; cin >> n >> x; int sum = 0; for(int i = 0 ; i < n ; ++ i){ int number; cin>> number; sum +=number; } if(sum < 0) sum = -sum; cout<<(sum%x ? sum/x+1 : sum/x) <<endl; }
上一篇:bzoj 4161 Shlw loves matrixI——常系数线性齐次递推
下一篇:codeforces round #234B(DIV2) B Inna and New Matrix of Candies
构造函数和析构函数构造函数
A. Vanya and Fencetime listandard inputoutputstandard outputVanya and his friends are walking along t
举报文章
请选择举报类型
补充说明
0/200
上传截图
格式支持JPEG/PNG/JPG,图片不超过1.9M