一.编程题
杨辉三角的变形_牛客题霸_牛客网 (nowcoder.com)
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int m=scanner.nextInt();
int[][]array=new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
array[n][m]=0;//先全部初始化为0
}
}
array[0][0]=1;
for (int i = 1; i < n; i++) {
array[i][0]=array[i][2*i];
for (int j = 1; j < m; j++) {
if(j==1){
array[i][j]=array[i-1][j-1]+array[i-1][j];
}else{
array[i][j]=array[i-1][j]+array[i-1][j-1]+array[i-1][j-2];
}
}
}
int k=0;
for (; k < m; k++) {
if (array[n-1][k]%2==0){
System.out.println(k+1);
}
break;
}
//没有偶数
if (k==m){
System.out.println(-1);
}
}
}
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
String str="";
String find="";
int count=0;
while (scanner.hasNext()){
str=scanner.nextLine();
find=scanner.nextLine();
for (char c:
str.toCharArray()) {
if (find.equalsIgnoreCase(String.valueOf(c))){
count++;
}
}
}
System.out.println(count);
}
}
二.选择题
1.
2.
3.
4.