PAT basic 1056
来源:互联网 发布:诺亚方舟 知乎 编辑:程序博客网 时间:2024/05/29 06:46
#include <cstdio>#include <vector>using namespace std;int main() { int n; scanf("%d", &n); vector<int> v(n); for(int i = 0; i < n; i++) { scanf("%d", &v[i]); } int ans = 0; for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { if(i != j) { ans += v[i] * 10 + v[j]; } } } printf("%d", ans); return 0;}
阅读全文
0 0
- PAT basic 1056
- PAT Basic
- PAT (Basic Level) Practise
- PAT Basic 1001
- PAT Basic 1002
- PAT Basic 1005
- PAT Basic 1006
- PAT Basic 1007
- PAT Basic 1008
- PAT Basic 1009
- PAT Basic 1010
- pat basic level 1016
- pat basic level 1018
- pat basic level 1019
- PAT(basic level)题解
- PAT basic 1004 : 成绩排名
- PAT (Basic) 1001~1005
- PAT (Basic) 1006~1010
- PAT basic 1055
- lintcode刷题——乘积最大子序列
- 2018届校招提前批大华面经
- 一键评教
- C++读入输出优化
- PAT basic 1056
- .net core 2.0学习笔记(四):迁移.net framework 工程到.net core
- poj 2112 Optimal Milking 最大流建模
- eclipse操作(二)
- PAT basic 1057
- Zemax中高斯光束设置的相关问题
- sqlmap教程2
- PAT basic 1058
- linux邮件系统