英文金曲大赛
Time Limit: 1000 ms Memory Limit: 65536 KiB
Submit Statistic
Problem Description
我们在“渊子数”的题目中已经了解了渊子是个什么样的人了,他在大一的时候参加过工商学院的“英语聚乐部”。告诉你个秘密,这个俱乐部是个好地方,不但活动精彩而且有MM。
这不,英语俱乐部举办了一个叫做“英文金曲大赛”的节目。这个节目有好多人参加,这不,成绩出来了,渊子当是很勇敢,自告奋勇接下了算出大家的总得分的任务。
当时有7个评委,每个评委都要给选手打分,现在要求去掉一个最高分和去掉一个最低分,再算出平均分。结果精确到小数点后两位。
Input
测试数据包括多个实例。
每组数据包括7个实数,代表评委们对该选手的评分。紧接着是选手的名字,名字的长度不超过30个字符,且没有空格。
输入直到文件结束。
Output
算出每位选手名字和最终得分,结果保留两位小数。
Sample Input
10 10 10 10 10 10 9 xiaoyuanwang
0 0 0 0 0 0 0 beast
Sample Output
xiaoyuanwang 10.00
beast 0.00
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
while(reader.hasNext())
{
int A[]=new int [7];
for(int i=0;i<=6;i++)
{
A[i]=reader.nextInt();
}
String S=reader.next();
int min=A[0],max=A[0];
for(int i=1;i<=6;i++)
{
if(A[i]>max)
{
max=A[i];
}
if(A[i]<min)
{
min=A[i];
}
}
double ave=(A[0]+A[1]+A[2]+A[3]+A[4]+A[5]+A[6]-min-max)/5.0;
System.out.printf("%s %.2f\n",S,ave);
}
reader.close();
}
}
图形打印
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n-i;j++)
{
System.out.print(" ");
}
if(i!=1)
System.out.print("+");
for(int j=1;j<=(i-1)*2-1;j++)
{
System.out.print("*");
}
System.out.println("+");
}
for(int i=1;i<=n-1;i++)
{
for(int j=1;j<=i;j++)
{
System.out.print(" ");
}
System.out.print("+");
for(int j=1;j<=(n-i-1)*2-1;j++)
{
System.out.print("*");
}
if(i!=n-1)
System.out.println("+");
}
reader.close();
}
}
计算从1到n 的和
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int sum=0;
for(int i=1;i<=n;i++)
{
sum=sum+i;
}
System.out.println(sum);
reader.close();
}
}
最大公约数和最小公倍数
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int m=reader.nextInt();
if(n>m)
{
int t;
t=n;n=m;m=t;
}
int max=0,min=n;
for(int i=n;i>=1;i--)
{
if(n%i==0&&m%i==0)
{
max=i;
break;
}
}
min=n*m/max;
System.out.println(min+" "+max);
reader.close();
}
}
成绩评估
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
while(reader.hasNext())
{
int n=reader.nextInt();
if(n>=90&&n<=100)
{
System.out.println("A");
}
else if(n>=80&&n<90)
{
System.out.println("B");
}
else if(n>=70&&n<80)
{
System.out.println("C");
}
else if(n>=60&&n<70)
{
System.out.println("D");
}
else if(n>=0&&n<60)
{
System.out.println("E");
}
else
{
System.out.println("Score is error!");
}
}
reader.close();
}
}
大小写转换
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
String str=reader.next();
int len=str.length();
for(int i=0;i<len;i++)
{
char ch=str.charAt(i);
if(ch>='a'&&ch<='z')
{
System.out.print((char)(ch-32));
}
else if(ch>='A'&&ch<='Z')
{
System.out.print((char)(ch+32));
}
else
{
System.out.print(ch);
}
}
reader.close();
}
}
斐波那契
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int A[]=new int [100000];
A[1]=2;A[2]=3;A[3]=5;
for(int i=4;i<=n;i++)
{
A[i]=A[i-1]+A[i-2]-A[i-3];
}
System.out.println(A[n]);
reader.close();
}
}
菲波那切数列
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int A[]=new int [100000];
A[1]=1;A[2]=1;
for(int i=3;i<=n;i++)
{
A[i]=A[i-1]+A[i-2];
}
System.out.println(A[n]);
reader.close();
}
}
平方和立方和
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
while(reader.hasNext())
{
int n=reader.nextInt();
int m=reader.nextInt();
int sum1=0,sum2=0;
for(int i=n;i<=m;i++)
{
if(i%2==0)
{
sum1=sum1+i*i;
}
else
{
sum2=sum2+i*i*i;
}
}
System.out.printf("%d %d\n",sum1,sum2);
}
reader.close();
}
}
小明A+B
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int T=reader.nextInt();
for(int i=1;i<=T;i++)
{
int a=reader.nextInt();
int b=reader.nextInt();
int c=a%100;
int d=b%100;
System.out.println((c+d)%100);
}
reader.close();
}
}
蟠桃记
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
while(reader.hasNext())
{
int n=reader.nextInt();
if(n==0)break;
int A[]=new int [10000];
A[n]=1;
for(int i=n-1;i>=1;i--)
{
A[i]=(A[i+1]+1)*2;
}
System.out.println(A[1]);
}
reader.close();
}
}
计算题
import java.util.Scanner;
public class Main {
public int f(int m,int n)
{
if(m==1) return n;
else if(n==1) return m;
else return f(m-1,n)+f(m,n-1);
}
public static void main(String[] args) {
Scanner reader=new Scanner(System.in);
int t=reader.nextInt();
for(int i=0;i<t;i++)
{
int m=reader.nextInt();
int n=reader.nextInt();
Main f=new Main();
int a=f.f(m, n);
System.out.println(a);
}
}
}
拍皮球
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
double num,ans;
int T=reader.nextInt();
for(int i=1;i<=T;i++)
{
double h= reader.nextDouble();
int n=reader.nextInt();
ans=h;
num=h;
for(int j=0;j<n;j++)
{
ans/=2.0;
if(j<n-1)
{
num+=2.0*ans;
}
}
System.out.printf("%.2f %.2f\n",num,ans);
}
reader.close();
}
}
期末考试之分等级
import java.util.Scanner;
public class Main{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
int T;
int i;
T = cin.nextInt();
int a, b ,c, d, e;
a = b = c = d = e = 0;
int n;
for(i = 1;i <= T;i ++)
{
n = cin.nextInt();
if(n >= 90) a ++;
if(n < 90 && n >= 80) b ++;
if(n < 80 && n >= 70) c ++;
if(n < 70 && n >= 60) d ++;
if(n < 60) e ++;
}
System.out.println("A" + " " + a);
System.out.println("B" + " " + b);
System.out.println("C" + " " + c);
System.out.println("D" + " " + d);
System.out.println("E" + " " + e);
cin.close();
}
}
矩阵下三角元素之和
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int A[][]=new int [n+1][n+1];
int sum=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
A[i][j]=reader.nextInt();
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
sum=sum+A[i][j];
}
}
System.out.println(sum);
reader.close();
}
}
冒泡排序中交换的次数
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int T=reader.nextInt();
for(int i=1;i<=T;i++)
{
int n=reader.nextInt();
int sum=0;
int A[]=new int [n+1];
for(int j=0;j<n;j++)
{
A[j]=reader.nextInt();
}
for(int j=0;j<n-1;j++)
{
for(int k=0;k<n-j-1;k++)
{
if(A[k]>A[k+1])
{
int t=A[k];
A[k]=A[k+1];
A[k+1]=t;
sum++;
}
}
}
System.out.println(sum);
}
reader.close();
}
}
卡片游戏
import java.util.Scanner;
import org.w3c.dom.css.ElementCSSInlineStyle;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
int n=reader.nextInt();
int A[]=new int [n+1];
for(int i=1;i<=n;i++)
{
A[i]=reader.nextInt();
}
int sum1=0;int sum2=0;
for(int i=1;i<=n;i++)
{
if(i%2==0)
{
sum2=sum2+A[i];
}
else
{
sum1=sum1+A[i];
}
}
if(sum1==sum2)
{
System.out.println("Equal");
}
else if(sum1>sum2)
{
System.out.println("Greater than");
}
else
{
System.out.println("Less than");
}
reader.close();
}
}
小金问呀问不会问题
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
while(reader.hasNext())
{
int n=reader.nextInt();
if(n>=0)
{
System.out.println("Yes");
}
else
{
System.out.println("No");
}
}
reader.close();
}
}
保留整数
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner reader = new Scanner(System.in); int i,flag; String str; str=reader.nextLine(); int length = str.length(); char[] s=new char[82]; flag=0; if(str.charAt(0)<='9'&&str.charAt(0)>='0')s[flag++]=str.charAt(0); else s[flag++]='*'; for(i=1;i<length;i++) { if(str.charAt(i)<='9'&&str.charAt(i)>='0') { s[flag++]=str.charAt(i); } else { if(s[flag-1]!='*')s[flag++]='*'; } } for(i=0;i<flag;i++) { System.out.print(s[i]); } reader.close(); }}
``
`
数列求和
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner reader=new Scanner(System.in);
int a=reader.nextInt();
int n=reader.nextInt();
int m=0;
int s=0;
for(int i=1;i<=n;i++)
{
m=m*10+a;
s=s+m;
}
System.out.println(s);
reader.close();
}
}
选票统计
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner reader=new Scanner(System.in);
int m=reader.nextInt();
int n=reader.nextInt();
int a[]=new int [m];
int i;
for(i=0;i<n;i++)
{
int b=reader.nextInt();
a[b-1]++;
}
int max=0;
int t=0;
for(i=0;i<m;i++)
{
if(a[i]>max)
{
max=a[i];
t=i+1;
}
}
System.out.println(t);
System.out.println(max);
reader.close();
}
}