目录
P2911 [USACO08OCT] Bovine Bones G编辑
P1205 [USACO1.2] 方块转换 Transformations编辑
P1428 小鱼比可爱
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] arr=new int[n];
for(int i=0;i<n;i++){
arr[i]=sc.nextInt();
}
for(int i=0;i<n;i++){
int count=0;
for(int j=0;j<i;j++){
if(arr[i]>arr[j]){
count++;
}
}
System.out.print(count+" ");
}
}
}P1427 小鱼的数字游戏
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int count=0;
int[] arr=new int[10000];
int i=0;
while(true) {
arr[i]=scanner.nextInt();
if(arr[i]==0) {
break;
}
count++;
i++;
}
for(i=count-1;i>=0;i--) {
System.out.print(arr[i]+" ");
}
scanner.close();
}
}P5727 【深基5.例3】冰雹猜想
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] a=new int[1002];
int i=0;
a[0]=n;
while(n!=1) {
if(n%2==1) {
n=n*3+1;
}else {
n=n/2;
}
i+=1;
a[i]=n;
}
for(int j=i;j>=0;j--) {
System.out.print(a[j]+" ");
}
}
}
P1047 [NOIP2005 普及组] 校门外的树
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
boolean[] l=new boolean[sc.nextInt()+1];
int m=sc.nextInt();
int result=0;
for(int i=0;i<l.length;i++) {
l[i]=true;
}
for(int i=1;i<=m;i++) {
int start=sc.nextInt(),end=sc.nextInt();
for(int j=start;j<=end;j++) {
l[j]=false;
}
}
for(int i=0;i<l.length;i++) {
if(l[i]==true) {
result++;
}
}
System.out.println(result);
}
}
P5728 【深基5.例5】旗鼓相当的对手
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[][] arr=new int[n][3];
for(int i=0;i<n;i++) {
for(int j=0;j<3;j++) {
arr[i][j]=sc.nextInt();
}
}
int result=0;
for(int i=0;i<n;i++) {
for(int j=i+1;j<n;j++) {
int chinese=Math.abs(arr[i][0]-arr[j][0]);
int math=Math.abs(arr[i][1]-arr[j][1]);
int english=Math.abs(arr[i][2]-arr[j][2]);
int sumScore=Math.abs(arr[i][0]+arr[i][1]+arr[i][2]-arr[j][0]-arr[j][1]-arr[j][2]);
if(chinese<=5&&math<=5&&english<=5&&sumScore<=10) {
result++;
}
}
}
System.out.printf("%d",result);
}
}
P5729 【深基5.例7】工艺品制作
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int x=sc.nextInt();
int y=sc.nextInt();
int z=sc.nextInt();
int n=sc.nextInt();
int sum=0;
int[][][]box=new int[x+1][y+1][z+1];
for(int i=0;i<n;i++) {
int x1=sc.nextInt();
int y1=sc.nextInt();
int z1=sc.nextInt();
int x2=sc.nextInt();
int y2=sc.nextInt();
int z2=sc.nextInt();
for(int j=x1;j<=x2;j++) {
for(int k=y1;k<=y2;k++) {
for(int l=z1;l<=z2;l++) {
box[j][k][l]=1;
}
}
}
}
for(int i=1;i<=x;i++) {
for(int j=1;j<=y;j++) {
for(int k=1;k<=z;k++) {
if(box[i][j][k]==0) {
sum++;
}
}
}
}
System.out.println(sum);
}
}
P2550 [AHOI2001] 彩票摇奖
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[] result= {0,0,0,0,0,0,0,0};
ArrayList<Integer> list=new ArrayList<>();
for(int i=0;i<7;i++) {
list.add(sc.nextInt());
}
for(int i=0;i<n;i++) {
int count=0;
for(int j=0;j<7;j++) {
if(list.contains(sc.nextInt())) {
count++;
}
}
result[7-count]++;
}
for(int i=0;i<7;i++) {
System.out.print(result[i]+" ");
}
}
}
P2615 [NOIP2015 提高组] 神奇的幻方
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[][] arr=new int[n][n];
arr[0][n/2]=1;
int x=0;//k-1的初始坐标
int y=n/2;
int len=arr.length;
for(int k=2;k<=n*n;k++) {
if(x==0&&y!=len-1) {
arr[len-1][y+1]=k;
x=len-1;
y=y+1;
}else if(x!=0&&y==len-1) {
arr[x-1][0]=k;
x=x-1;
y=0;
}else if(x==0&&y==len-1) {
arr[x+1][y]=k;
x=x+1;
}else if(x!=0&&y!=len-1) {
if(arr[x-1][y+1]==0) {
arr[x-1][y+1]=k;
x=x-1;
y=y+1;
}else {
arr[x+1][y]=k;
x=x+1;
}
}
}
for(int i=0;i<len;i++) {
for(int j=0;j<len;j++) {
System.out.print(arr[i][j]);
if(j!=len-1) {
System.out.print(" ");
}
}
System.out.println();
}
}
}P5730 【深基5.例10】显示屏
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
char[][][] arr = {
{//0
{'X', 'X', 'X'},
{'X', '.', 'X'},
{'X', '.', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'}
},
{//1
{'.', '.', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'}
},
{//2
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'X', 'X', 'X'},
{'X', '.', '.'},
{'X', 'X', 'X'}
},
{//3
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'X', 'X', 'X'}
},
{//4
{'X', '.', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'},
},
{//5
{'X', 'X', 'X'},
{'X', '.', '.'},
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'X', 'X', 'X'}
},
{//6
{'X', 'X', 'X'},
{'X', '.', '.'},
{'X', 'X', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'}
},
{//7
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'},
{'.', '.', 'X'}
},
{//8
{'X', 'X', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'}
},
{//9
{'X', 'X', 'X'},
{'X', '.', 'X'},
{'X', 'X', 'X'},
{'.', '.', 'X'},
{'X', 'X', 'X'}
}
};
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.next();
char[] num = str.toCharArray();
for (int i = 0; i < 5; i++) {//行
for (int k = 0; k < n; k++) {//数字位数
for (int j = 0; j < 3; j++) {//列
System.out.print(arr[num[k] - '0'][i][j]);
}
if (k != n - 1) {
System.out.print(".");
}
}
System.out.println();
}
}
}
P1554 梦中的统计
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int m=sc.nextInt();
int n=sc.nextInt();
int[] nums=new int[10];
for(int i=m;i<=n;i++) {
String[] arr=(i+"").split("");
for(int j=0;j<arr.length;j++) {
for(int k=0;k<=9;k++) {
if(arr[j].equals(k+"")) {
nums[k]++;
}
}
}
}
for(int i=0;i<10;i++) {
System.out.print(nums[i]+" ");
}
}
}
P2141 [NOIP2014 普及组] 珠心算测验
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
ArrayList<Integer> list=new ArrayList<>();//特点：有序，可重复
Set<Integer> set=new HashSet<>();//特点：无序，不可重复
for(int i=0;i<n;i++) {
list.add(sc.nextInt());
}
int count=0;
for(int i=0;i<n;i++) {
for(int j=i+1;j<n;j++) {
set.add(list.get(i)+list.get(j));
}
}
for(int k=0;k<n;k++) {
if(set.contains(list.get(k))) {
count++;
}
}
System.out.println(count);
}
}
P1614 爱与愁的心痛
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] arr=new int[n];
int[] arr1=new int[n-m+1];
for(int i=0;i<n;i++) {
arr[i]=sc.nextInt();
}
for(int j=0;j<n-m+1;j++) {
int sum=0;
for(int k=j;k<j+m;k++) {
sum+=arr[k];
}
arr1[j]=sum;
sum=0;
}
Arrays.sort(arr1);
System.out.println(arr1[0]);
}
}P2911 [USACO08OCT] Bovine Bones G
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int s1=sc.nextInt();
int s2=sc.nextInt();
int s3=sc.nextInt();
int[] arr=new int[81];
int max=0;
for(int i=1;i<=s1;i++) {
for(int j=1;j<=s2;j++) {
for(int k=1;k<=s3;k++) {
max=i+k+j;
arr[max]++;
}
}
}
int index=0;
max=0;
for(int i=3;i<=80;i++) {
if(arr[i]>max) {
max=arr[i];
index=i;
}
}
System.out.println(index);
}
}P1161 开灯
import java.util.ArrayList;
import java.util.Scanner;
import javax.security.auth.x500.X500Principal;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
double[] a=new double[n];
int[] t=new int[n];
for(int i=0;i<n;i++) {
a[i]=sc.nextDouble();
t[i]=sc.nextInt();
}
int[] state=new int[2000000];
for(int i=0;i<state.length;i++) {
state[i]=0;//开
}
for(int i=0;i<n;i++) {
for(int j=1;j<=t[i];j++) {
if(state[(int)(a[i]*j)]==1) {
state[(int)(a[i]*j)]=0;
}else {
state[(int)(a[i]*j)]=1;
}
}
}
for(int i=0;i<state.length;i++) {
if(state[i]==1) {
System.out.println(i);
}
}
}
}
P5731 【深基5.习6】蛇形方阵
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] a = new int[n][n];
int num = 1;
int top=0,bottom=n-1,left=0,right=n-1;
while(num<=n*n) {
for(int i=left;i<=right;i++) {
a[top][i]=num++;
}
top++;
for(int i=top;i<=bottom;i++) {
a[i][right]=num++;
}
right--;
for(int i=right;i>=left;i--) {
a[bottom][i]=num++;
}
bottom--;
for(int i=bottom;i>=top;i--) {
a[i][left]=num++;
}
left++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.printf("%3d", a[i][j]);
}
System.out.println();
}
}
}P5732 【深基5.习7】杨辉三角
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[][] arr=new int[21][21];
for(int i=0;i<n;i++) {
arr[i][0]=arr[i][i]=1;
for(int j=1;j<i;j++) {
arr[i][j]=arr[i-1][j-1]+arr[i-1][j];
}
}
for(int i=0;i<n;i++) {
for(int j=0;j<=i;j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
sc.close();
}
}
P1789 【Mc生存】插火把
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int[][] arr=new int[200][200];
//火把
for(int i=0;i<m;i++) {
int x=sc.nextInt();
int y=sc.nextInt();
for(int j=x-1;j<=x+1;j++) {
for(int l=y-1;l<=y+1;l++) {
arr[j][l]=1;
}
}
arr[x][y+2]=1;
arr[x][Math.abs(y-2)]=1;
arr[x+2][y]=1;
arr[Math.abs(x-2)][y]=1;
}
if(k>0) {
for(int i=0;i<k;i++) {
int x=sc.nextInt();
int y=sc.nextInt();
arr[x][y]=2;
for(int j=x-2;j<=x+2;j++) {
for(int l=y-2;l<=y+2;l++) {
arr[j][l]=1;
}
}
}
}
int count=0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (arr[i][j] == 0) count++;
}
}
System.out.println(count);
}
}P1319 压缩技术
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String input=sc.nextLine();
String[] arr=input.split(" ");
int n=Integer.parseInt(arr[0]);
int flag=0;
int count=0;
for(int i=1;i<arr.length;i++) {
for(int j=0;j<Integer.valueOf(arr[i]);j++) {
count++;
if(count%n!=0) {
System.out.print(flag);
}else if(count%n==0) {
System.out.print(flag);
System.out.println();
}else if(count%n==0&&count==n*n) {
System.out.print(flag);
}
}
if(flag==0) {
flag=1;
}else {
flag=0;
}
}
}
}P1320 压缩技术（续集版）
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner scanner = new Scanner(System.in);
String line = scanner.nextLine();
StringBuilder builder = new StringBuilder(line);
for (int i = 1; i < line.length(); i++) {
builder.append(scanner.nextLine());
}
char[] chars = builder.toString().toCharArray();
int count =0;//连续相同数字的个数
int len = 1;//当前已检查的字符个数
System.out.print(line.length()+" ");
for (int i = 0; i < chars.length; i++) {
int num = chars[i] - '0';//1,0
// 0
if (len % 2 != 0){//奇数
if (num == 0) {
count++;
}else {
System.out.print(count+" ");
count = 1;
len++;
}
}else {//偶数
if (num == 1){
count++;
}else {
System.out.print(count+" ");
count=1;
len++;
}
}
}
System.out.print(count);
}
}
P1205 [USACO1.2] 方块转换 Transformations
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char[][] arr1=new char[n][n];
char[][] arr2=new char[n][n];
for(int i=0;i<n;i++) {
String s1=sc.next();
for(int j=0;j<n;j++) {
arr1[i][j]=s1.charAt(j);
}
}
for(int i=0;i<n;i++) {
String s2=sc.next();
for(int j=0;j<n;j++) {
arr2[i][j]=s2.charAt(j);
}
}
if(way1(arr1, arr2, n))System.out.println("1");
else if(way2(arr1, arr2, n))System.out.println("2");
else if(way3(arr1, arr2, n))System.out.println("3");
else if(way4(arr1, arr2, n))System.out.println("4");
else if(way5(arr1, arr2, n))System.out.println("5");
else if(way6(arr1, arr2, n))System.out.println("6");
else System.out.println("7");
}
//转90°
static boolean way1(char arr1[][], char arr2[][], int n) {
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(arr1[i][j] != arr2[j][n-i-1])return false;
return true;
}
//转180°
static boolean way2(char arr1[][], char arr2[][], int n) {
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(arr1[i][j] != arr2[n-i-1][n-j-1])return false;
return true;
}
//转270°
static boolean way3(char arr1[][], char arr2[][], int n) {
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(arr1[i][j] != arr2[n-j-1][i])return false;
return true;
}
//反射
static boolean way4(char arr1[][], char arr2[][], int n) {
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(arr1[i][j] != arr2[i][n-j-1])return false;
return true;
}
//组合
static boolean way5(char arr1[][], char arr2[][], int n) {
//将arr1旋转90°
char temp;
for(int i = 0;i<n;i++)
for(int j=0;j<=(n/2-1);j++) {
temp = arr1[i][j];
arr1[i][j] = arr1[i][n-j-1];
arr1[i][n-j-1] = temp;
}
if(way1(arr1,arr2,n) || way2(arr1,arr2,n) || way3(arr1,arr2,n))return true;
return false;
}
//不改变
static boolean way6(char arr1[][], char arr2[][], int n) {
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(arr1[i][j] != arr2[i][j])return false;
return true;
}
}
679
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
