1 条题解
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int main() { int a[1010],n,i; cin>>n; for(i = 0;i < n;i++){ cin>>a[i]; } for(i = 0;i < n / 2;i++){ a[i] = a[i] * 2; } for(i = n / 2;i < n;i++){ a[i] = a[i] + 1; } for(i = 0;i < n;i++){ cout<<a[i]<<" "; } return 0; }
Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int num1 = scanner.nextInt(); // int num2 = scanner.nextInt(); int[] a = new int[num1]; int count = 0,s = 0; for (int i = 0; i < num1; i++) { a[i] = scanner.nextInt(); } for (int i = 0; i < num1 / 2; i++) { a[i] = a[i] * 2; } for (int i = num1 / 2; i < num1; i++) { a[i] = a[i] + 1; } for (int i = 0; i < num1; i++) { System.out.print(a[i] + " "); } } public static boolean judge(int i,int j){ int a,s = 0; while(i != 0){ a = i % 10; s = s + a; i /= 10; } if(s == j)return true; else return false; } public static void paiXu(int[] a){ int temp; for(int i = 0;i < a.length - 1;i++){ for(int k = 0;k < a.length - i - 1;k++){ if(a[k] > a[k + 1]){ temp = a[k]; a[k] = a[k + 1]; a[k + 1] = temp; } } } } }
Python :
# 接收输入整数n n = int(input()) # n个数字放入字符串列表m中 m = input().split() # 字符串列表转换为整型列表 for i in range(0, n): m[i] = int(m[i]) for i in range(0, n): if i <= n // 2-1: m[i] = 2 * m[i] else: m[i] = m[i] + 1 for i in range(0, n): print(m[i],end=' ')
- 1
信息
- ID
- 2495
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者