ZZULIOJ 1114-1130 数组专题参考代码

一共17道题
下面代码供参考
每题前面标的有题号
1114 逆序
1115 数组最小值
1116 删除元素
1117 查找数组元素
1118 数列有序
1119 一维数组排序
1120 最值交换
1121 电梯
1122 小明的调查作业
1123 最佳校友
1124 两个有序数组合并
1125 上三角矩阵的判断
1126 布尔矩阵的奇偶性
1127 矩阵乘积
1128 课程平均分
1129 第几天
1130 杨辉三角

1114
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n;int[]a = new int[11];n = cin.nextInt();for (int i = 0; i < n; i++)a[i] = cin.nextInt();for (int i = n - 1; i >= 0; i--)System.out.printf("%4d", a[i]);}}
1115
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n, num, k, ans;n = cin.nextInt();num = cin.nextInt();ans = num;k = 0;for (int i = 1; i < n; i++){num = cin.nextInt();if (num < ans){ans = num;k = i;}}System.out.println(ans + " " + k);}
}
1116
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n, num, k;int[] a = new int[11];n = cin.nextInt();for (int i = 0; i < n; i++){a[i] = cin.nextInt();}k = cin.nextInt();for (int i = 0; i < n; i++){if (i == k)continue;else{if (i != n - 1)System.out.print(a[i] + " ");elseSystem.out.print(a[i]);}}}
1117
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n, k = -1, need;int[] a = new int[11];n = cin.nextInt();for (int i = 0; i < n; i++){a[i] = cin.nextInt();}need = cin.nextInt();for (int i = 0; i < n; i++){if (a[i] == need){k = i;break;}}if (k == -1)System.out.println("Not Found");else{for (int i = 0; i < n; i++){if (i == k)continue;elseSystem.out.printf("%4d", a[i]);}}}}
1118
import java.util.Arrays;
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n;n = cin.nextInt();int[] a = new int[n + 1];for (int i = 0; i <= n; i++)a[i] = cin.nextInt();Arrays.sort(a);for (int i = 0; i <= n; i++)if (i != n)System.out.print(a[i] + " ");elseSystem.out.print(a[i]);}}
1119
import java.util.Arrays;
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n;n = cin.nextInt();int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = cin.nextInt();Arrays.sort(a);for (int i = 0; i < n; i++)if (i != n - 1)System.out.print(a[i] + " ");elseSystem.out.print(a[i]);}}
1120
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n, MAX, MIN, k = 0;n = cin.nextInt();int[]a = new int[11];for (int i = 0; i < n; i++)a[i] = cin.nextInt();MAX = MIN = a[0];for (int i = 0; i < n; i++){if (a[i] < MIN){MIN = a[i];k = i;}}int t;t = a[0];a[0] = a[k];a[k] = t;for (int i = 0; i < n; i++){if (a[i] > MAX){MAX = a[i];k = i;}}t = a[n - 1];a[n - 1] = a[k];a[k] = t;for (int i = 0; i < n; i++)System.out.print(a[i] + " ");}}
1121
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int[] a = new int[1010];int n, ans = 0;n = cin.nextInt();for (int i = 0; i < n; i++)a[i] = cin.nextInt();ans += a[0] * 6;for (int i = 1; i < n; i++){if (a[i] > a[i - 1])ans += (a[i] - a[i - 1]) * 6;elseans += (a[i - 1] - a[i]) * 4;}System.out.println(ans + n * 5);}}
1122
import java.util.Arrays;
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n, cnt = 0, num;int[] vis = new int[1010];int[] a = new int[1010];n = cin.nextInt();for (int i = 0; i<n; i++){num = cin.nextInt();if (vis[num] == 0){vis[num] = 1;a[cnt++] = num;}}Arrays.sort(a, 0, cnt);System.out.println(cnt);for (int i = 0; i<cnt; i++)System.out.print(a[i] + " ");}}
1123
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int[] a = new int[100];int num, MAX = 0;while (cin.hasNext()){num = cin.nextInt();if (num == -1)break;a[num]++;MAX = Math.max(a[num], MAX);}for (int i = 0; i <= 99; i++)if (a[i] == MAX)System.out.print(i + " ");}}
1124
import java.util.Arrays;
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int[] a = new int[2000010];int[] b = new int[1000010];int n, m;n = cin.nextInt();for (int i = 0; i < n; i++)a[i] = cin.nextInt();m = cin.nextInt();for (int i = 0; i < m; i++)b[i] = cin.nextInt();for (int i = n; i - n < m; i++){a[i] = b[i - n];}Arrays.sort(a, 0, n + m);for (int i = n + m - 1; i >= 0; i--)System.out.print(a[i] + " ");}
}
1125
import java.util.Scanner;public class Main {public static int j(int k){int sum = 0;for (int i = 1; i <= k; i++)sum += i;return sum;}public static void main(String[] args) {Scanner cin = new Scanner(System.in);int[][] a = new int[11][11];int n, cnt = 0;n = cin.nextInt();for (int i = 0; i < n; i++)for (int j = 0; j < n; j++){int num = cin.nextInt();if (i != 0 && j != n - 1){if (j < i&&num == 0)cnt++;}}if (n*n - j(n) == cnt)System.out.print("YES");elseSystem.out.print("NO");}
}
1126
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int n;int[][] a = new int[110][110];n = cin.nextInt();int flag1 = 0, flag2 = 0, u = 0, v = 0;for (int i = 0; i<n; i++)for (int j = 0; j<n; j++){a[i][j] = cin.nextInt();}for (int i = 0; i<n; i++){int sum = 0;for (int j = 0; j<n; j++){sum += a[i][j];}if (sum % 2 != 0){flag1 = 1;u = i;}}for (int i = 0; i<n; i++){int sum = 0;for (int j = 0; j<n; j++){sum += a[j][i];}if (sum % 2 != 0){flag2++;v = i;}}if (flag1 == 0 && flag2 == 0)System.out.println("OK");elseif (flag1 == 1 && flag2 == 1)System.out.printf("Change bit(%d,%d)", u, v);elseSystem.out.println("Corrupt");}}
1127
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);int m, n, k;int[][] a = new int[11][11];int[][] b = new int[11][11];int[][] c = new int[11][11];m = cin.nextInt();n = cin.nextInt();k = cin.nextInt();for (int i = 0; i < m; i++)for (int j = 0; j < n; j++)a[i][j] = cin.nextInt();for (int i = 0; i < n; i++)for (int j = 0; j < k; j++)b[i][j] = cin.nextInt();for (int i = 0; i < m; i++)for (int j = 0; j < k; j++){int sum = 0;for (int u = 0; u < n; u++)sum += a[i][u] * b[u][j];c[i][j] = sum;}for (int i = 0; i < m; i++){for (int j = 0; j < k; j++)System.out.print(c[i][j] + " ");System.out.println();}}
}
1128import java.util.Scanner;public class Main {public static void main(String args[]){Scanner cin = new Scanner(System.in);int m, n;double[][] b = new double[1010][1010];double[]a = new double[1010];m = cin.nextInt();n = cin.nextInt();for (int i = 0; i < m; i++)for (int j = 0; j < n; j++)b[i][j] = cin.nextDouble();for (int i = 0; i < n; i++){double sum = 0;for (int j = 0; j < m; j++)sum += b[j][i];a[i] = sum / m;}for (int i = 0; i < n; i++)System.out.printf("%.2f ", a[i]);}
}
1129
import java.util.Scanner;public class Main {public static int is_leap_year(int year){if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)return 1;return 0;}public static void main(String[] args){int a[][] = { { 0, 0 }, { 31, 31 }, { 28, 29 }, { 31, 31 }, { 30, 30 }, { 31, 31 }, { 30, 30 }, { 31, 31 },{ 31, 31 }, { 30, 30 }, { 31, 31 }, { 30, 30 }, { 31, 31 } };Scanner cin = new Scanner(System.in);String date = cin.nextLine();String[] s = date.split("-");int cnt = 0, year = 0, month = 0, day = 0;for (String i : s){//System.out.println(i+" "+cnt);if (cnt == 0)year = Integer.parseInt(i);if (cnt == 1)month = Integer.parseInt(i);if (cnt == 2)day = Integer.parseInt(i);cnt++;}// System.out.println(year+" "+month+" "+day);int flag = 0;if (is_leap_year(year) == 1)flag = 1;int sum = day;for (int i = 1; i < month; i++)sum += a[i][flag];System.out.println(sum);}
}
1130
import java.util.Scanner;public class Main {public static void main(String[] args) {int[][] a = new int[40][40];Scanner cin = new Scanner(System.in);int n = cin.nextInt();for (int i = 0; i < n; i++){a[i][0] = a[i][i] = 1;for (int j = 1; j < i; j++)a[i][j] = a[i - 1][j - 1] + a[i - 1][j];}for (int i = 0; i < n; i++){for (int j = 0; j <= i; j++)System.out.print(a[i][j] + " ");System.out.println();}}
}

ZZULIOJ 1114-1130 数组专题参考代码相关推荐

ZZULIOJ 1180-1198结构体专题参考代码
一共19道题虽然是java写的,但是还是用的类似于C的结构体下面代码供参考每题前面标的有题号 *1180 成绩统计(结构体专题) 1181 谁的年龄最小(结构体专题) 1182 查询记录(结构体 ...
PTA 浙大版《C语言程序设计实验与习题指导（第3版）》题目集（参考代码）
已完结本题目集是博主初学C语言时写的,若有错误,欢迎指正. 注:其中有些题的代码参考了其他人. 另一套题目集:PTA浙大版<C语言程序设计(第3版)>题目集(参考代码) 其他题目集: P ...
领扣-26/27/80/283 数组专题做好初始定义双指针 MD
目录数组专题:做好初始定义移动零 Move Zeroes -283 问题答案移除元素 Remove Element -27 问题答案删除排序数组中的重复项 -26 问题记录位置法快慢指 ...
C语言数组学完学啥,我的c语言学习-数组专题
学到最后的数组专题了.数组数组,怎么着也要是一组数吧,对,数组是按顺序排列的一组同类型的数据构成的集合,用来保存大量同类型的相关数据. 一一维数组定义一个一维数组int a[5],表示有五 ...
php post 二维数组,php curl模拟post请求和提交多维数组的示例代码
这篇文章主要介绍了php curl模拟post请求和提交多维数组的示例代码,需要的朋友可以参考下下面一段代码给大家介绍php curl模拟post请求的示例代码,具体代码如下: 'tanteng' ...
使用动态规划求解算法问题的五大特点总结（附基于Python的参考代码）
什么样的问题应使用动态规划求解前言一.求"最"优解问题(最大值和最小值) 1. 乘积最大子数组问题描述示例题目分析参考代码 2. 最长回文子串问题描述示例题目分析 ...
C++ Primer Plus课后编程练习第6章参考代码
(C++ Primer Plus课后编程练习第6章参考代码) 声明: 作者入门小白,将学习过程中的代码做一些分享,仅供大家参考,欢迎大家交流指正.全部编译运行过,水平有限,不喜勿喷. 环境: Wind ...
[原创]桓泽学音频编解码（7）：MP3 和 AAC 中huffman解码原理，优化设计与参考代码中实现...
1 不同标准中的huffman解码原理 1.1标准MP3的huffman解码原理在MP3即mpeg-1 audio标准中,无噪声编码模块的输入是一组576个己量化的频谱数据.无噪声编码首先对频谱进行 ...
Educoder–Java高级特性（第一章）- IO流【笔记+参考代码】
Educoder–Java高级特性(第一章)- IO流[笔记+参考代码] 第一关 1.下列关于字节和字符的说法正确的是(BC) A.字节 = 字符 + 编码 B.字符 = 字节 + 编码 C.字节 = ...

ZZULIOJ 1114-1130 数组专题参考代码

ZZULIOJ 1114-1130 数组专题参考代码相关推荐

最新文章

热门文章

ZZULIOJ 1114-1130 数组专题 参考代码

ZZULIOJ 1114-1130 数组专题 参考代码相关推荐

最新文章

热门文章

ZZULIOJ 1114-1130 数组专题参考代码

ZZULIOJ 1114-1130 数组专题参考代码相关推荐