c转换为java代码 c语言翻译成java

把C语言代码转成Java代码

package dis;

创新互联专注于襄城企业网站建设,响应式网站开发,商城网站建设。襄城网站建设公司,为襄城等地区提供建站服务。全流程定制网站开发，专业设计，全程项目跟踪，创新互联专业和态度为您提供的服务

import java.io.*;

import java.math.*;

public class dis

{

public static void main(String [] s) throws Exception

{

Float a,b,c;

double x2;

double x1;

System.out.println("请输入a, b, c的值");

BufferedReader bReader=new BufferedReader(new InputStreamReader(System.in));

a=Float.parseFloat(bReader.readLine());

b=Float.parseFloat(bReader.readLine());

c=Float.parseFloat(bReader.readLine());

if (b*b - 4*a*c = 0)

System.out.println("输入的系数不对，b2-4ac不大于0！程序退出！");

else

{

x1 = (-b + Math.sqrt(b*b - 4*a*c))/2*a;

x2 = (-b - Math.sqrt(b*b - 4*a*c))/2*a;

System.out.println("x1 = "+ x1);

System.out.println("x2 = "+x2);

}

return;

}

}

这段C代码如何转为java代码？

public class Test {

private int HASH_LOG = 14;

private int HASH_SIZE=(1 HASH_LOG);

private int HASH_MASK=(HASH_SIZE - 1);

public Long flz_hash(Long a){

Long l1 = 2654435769L;

Long index = (a * l1) 32-HASH_LOG;

return index HASH_MASK;

}

public static void main(String[] args) {

Test test = new Test();

long a = 2;

Long index = test.flz_hash(a);

System.out.println(index);

}

}

把下面C语言代码改成java代码

import java.util.Arrays;

import java.util.Scanner;

public class A {

static final int maxn=100000+5;

static long[] a=new long[maxn],t=new long[maxn];

static long ans=0;

static void mymerge(int x,int m,int y) {

int tx=x,tm=m+1;

int k=0;

while(tx=m tm=y) {

if(a[tx]=a[tm])

t[k++]=a[tx++];

else {

ans+=m-tx+1;

a[k++]=a[tm++];

}

}

while(tx=m) t[k++]=a[tx++];

while(tm=y) t[k++]=a[tm++];

for(int i=0;ik;i++)

a[x++]=t[i];

}

static void mergesort(int x,int y) {

if(x==y)return ;

int mid=(x+y)/2;

int xx=x,yy=y;

mergesort(xx,mid);

mergesort(mid+1,yy);

mymerge(xx,mid,yy);

//System.out.println(xx+" "+mid+" "+yy);

}

public static void main(String[] arg) {

int n,k;

Scanner input=new Scanner(System.in);

while(input.hasNext()) {

n=input.nextInt();

k=input.nextInt();

Arrays.fill(a, 0);

Arrays.fill(t, 0);

for(int i=0;in;i++) {

a[i]=input.nextLong();

}

ans=0;

mergesort(0, n-1);

if(kans)

System.out.println("0");

else

System.out.println((ans-k)+"");

}

}

}