查找数组元素
import
java.util.Scanner;
public class 查找数组元素 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int n,i,k,x;
int[]a=new int[13];
n=cin.nextInt();
for(i=0;i<n;i++)
a[i]=cin.nextInt();
x=cin.nextInt();
k=find(a,n,x);
if(k==-1)
System.out.println("Not Found");
else {
for(k++;k<n;k++)
a[k-1]=a[k];
for(i=0;i<n-1;i++)
{
String st1=String.format("%4d", a[i]);
System.out.print(st1);
}
}
}
public static int find(int a[],int n,int x) {
int i;
for(i=0;i<n;i++)
if(a[i]==x)
return i;
return -1;
}
}
单数变复数
import java.util.Scanner;
import
java.lang.ArrayIndexOutOfBoundsException;
public class 单数变复数 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
String[] str1=new String[20];
int len;
str1[20]=cin.nextLine();
len=str1.length;
if(str1[len-1]=="y")
{
str1[len-1]="i";
str1[len]="e";
str1[len+1]="s";
}
else
if(str1[len-1]=="s"||str1[len-1]=="x"||str1[len-1]=="o")
{
str1[len]="e";
str1[len+1]="s";
}
else
if(str1[len-1]=="h"&&str1[len-2]=="c"||str1[len-1]=="h"&&str1[len-2]=="s")
{
str1[len]="e";
str1[len+1]="s";
}
else
{
str1[len]="s";
}
System.out.println(str1);
}
}
海伦公式
import java.util.Scanner;
public class 海伦公式 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner
scan=new Scanner(System.in);
System.out.println("输入三角形的三边");
float a=scan.nextFloat();
float b=scan.nextFloat();
float c=scan.nextFloat();
float s=(a+b+c)/2f;
float S=(float)Math.sqrt(s*(s-a)*(s-b)*(s-c));
if(a+b>c&&a+c>b&&b+c>a) {
System.out.println(String.format("%.2f", S));
}
else {
System.out.println("不成立三角形");
}
}
}
简易版最长数列
import java.util.Arrays;
import java.util.Scanner;
public class 简易版最长数列 {
public
static void main(String[] args) {
//
TODO Auto-generated method stub
Scanner
cin=new Scanner(System.in);
int[]a=new
int[100000];
int[]b=new
int[100000];
int
n,i,j,m;
int t;
t=cin.nextInt();
do {
m=0;
j=0;
Arrays.fill(b, 0);
n=cin.nextInt();
for(i=0;i<n;i++)
a[i]=cin.nextInt();
paixu(a,n);
for(i=0;i<n;i++)
{
if(a[i]==a[i+1])
b[j]++;
if(a[i]!=a[i+1])
j++;
}
m=b[0];
for(i=0;i<n;i++)
{
if(m<b[i])
m=b[i];
}
System.out.println(m+1);
t--;
}while(t>0);
}
public
static void paixu(int a[],int n) {
int
i,j,t;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
}
}
逆序数字
import java.util.Scanner;
public class 逆序数字 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner
cin=new Scanner(System.in);
int x,t;
x=cin.nextInt();
while(x>0)
{
t=x%10;
System.out.print(t+" ");
x=x/10;
}}}
平方根的和
import
java.util.Scanner;
public class 平方根的和 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int i,n;
float item,s=0;
item=cin.nextInt();
n=cin.nextInt();
for(i=0;i<n;i++) {
s+=item;
item=(float) Math.sqrt(item);
}
System.out.printf("%.2f",s);
}
}
奇数的积
import
java.util.Scanner;
public class 奇数的积 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int[]a=new int[1000];
int i,t;
int n;
t=1;
while(cin.hasNext()) {
n=cin.nextInt();
for(i=0;i<n;i++)
{
a[i]=cin.nextInt();
}
for(i=0;i<n;i++)
{
if(a[i]%2!=0)
{
t=t*a[i];
}
}
System.out.println(t);
t=1;
}
}
}
敲7
import
java.util.Scanner;
public class 敲7 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int[]a=new int[50];
int i,j,t;
t=cin.nextInt();
for(i=0;i<t;i++)
a[i]=cin.nextInt();
for(j=0;j<t;j++)
{
for(i=1;i<a[j];i++)
{
if(i%7==0||i%10==7||i/10%10==7||i/100%10==7||i/1000%10==7)
System.out.print(i+" ");
}
System.out.println("\n");
}}}
亲和串
import
java.util.Scanner;
public class 亲和串 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
while(cin.hasNext()) {
String str1=cin.nextLine();
String str2=cin.nextLine();
int len1=str1.length();
int len2=str2.length();
if(len1<len2)
System.out.println("no");
else {
str1=(str1+str1).replace(str2, "");
if(str1.length()==2*len1)
System.out.println("no");
else
System.out.println("yes");
}
}}
}
一维数组排序
import
java.util.Scanner;
public class 一维数组排序 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int n,i;
int[]a=new int[10];
n=cin.nextInt();
for(i=0;i<n;i++)
a[i]=cin.nextInt();
sort(a, n);
out(a, n);
}
public static void sort(int a[],int n)
{
int i,j,t;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
public static void out(int a[],int n)
{
int i;
for(i=0;i<n;i++)
System.out.print(a[i]+" ");
}
}
整数排序
import
java.util.Scanner;
public class 整数排序 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int []a=new int[3];
int i,s,j;
Scanner cin=new Scanner(System.in);
for( i=0;i<3;i++)
a[i]=cin.nextInt();
for(i=0;i<3;i++)
for(j=i+1;j<3;j++)
{
if(a[j]>a[i])
{
s=a[i];
a[i]=a[j];
a[j]=s;
}
}
for(i=0;i<3;i++)
{
System.out.print(a[i]+" ");
}
}
}
幸运数字
import
java.util.Scanner;
public class 幸运数字 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int m,n,i,k=0;
m=cin.nextInt();
n=cin.nextInt();
for(i=n;i>=m;i--)
{
if(i%7==0&&i%4!=0)
{
System.out.println(i);
k++;
break;
}
}
if(k==0)
System.out.println("no");
}
}
兔子繁殖
import
java.util.Scanner;
public class 兔子繁殖 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int i,n;
n=cin.nextInt();
int []a;
a=new int [50];
a[0]=1;
a[1]=1;
for(i=2;i<n;i++) {
a[i]=a[i-1]+a[i-2];
}
System.out.println(a[n-1]);
}
}
数组最小值
import
java.util.Scanner;
public class 数组最小值 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[]a=new int[1000];
Scanner cin=new Scanner(System.in);
int i,min,n,t=0;
n=cin.nextInt();
for(i=0;i<n;i++)
a[i]=cin.nextInt();
min=a[0];
for(i=1;i<n;i++)
{
if(min>a[i])
{
min=a[i];
t=i;
}
}
System.out.println(min+" "+t);
}
}
数值统计
import
java.util.Scanner;
public class 数值统计 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(System.in);
int a,b,c,n,i;
double k;
a=b=c=0;
n=cin.nextInt();
while(n!=0) {
for(i=1;i<=n;i++) {
k=cin.nextDouble();
if(k<0)
a++;
if(k==0)
b++;
if(k>0)
c++;
}
System.out.println(a+" "+b+" "+c+" ");
a=b=c=0;
n=cin.nextInt();
}
}
}
郑州轻工业大学OJ(JAVA)
最新推荐文章于 2023-08-06 19:18:14 发布