ITSA E-tutor 程式碼參考(數學1)

[C_MM01-易] 計算梯型面積

java:











import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc =new Scanner(System.in);
    int up=sc.nextInt();
    int down=sc.nextInt();
    int high=sc.nextInt();
    System.out.println("Trapezoid area:"+((up+down)*high/2.0));  
  }
}

[C_MM02-易] 計算三角形面積

java










import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc =new Scanner(System.in);
    int under=sc.nextInt();
    int high=sc.nextInt();
    System.out.println(under*high/2.0);
  }
}

[C_MM03-易] 兩數總和

java












import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc =new Scanner(System.in);
    while(sc.hasNext()){
      int n=sc.nextInt();
      int m=sc.nextInt();
      System.out.println(n+m);
    }
  }
}

[C_MM04-易] 計算總和、乘積、差、商和餘數

java




















import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc =new Scanner(System.in); 
	    int a=sc.nextInt(); 
	    int b=sc.nextInt(); 
	    System.out.printf("%d+%d=%d\n",a,b,a+b); 
	    System.out.printf("%d*%d=%d\n",a,b,a*b); 
	    System.out.printf("%d-%d=%d\n",a,b,a-b);
	    if(a%b>=0)
	    	System.out.printf("%d/%d=%d...%d\n",a,b,a/b,a%b); 
	    else
	    	System.out.printf("%d/%d=%d...%d\n",a,b,a/b-1,a%b+b);

	}

}

[C_MM05-易] 計算正方形面積

java








import java.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    double n=sc.nextDouble();
    System.out.println(Math.round(n*n*10.0)/10.0);
  }
}

[C_MM06-易] 英哩轉公里

java








import java.util.*;
public class Main {
  public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    double n=sc.nextInt();
    System.out.println(Math.round(1.6*n*10.0)/10.0);
  }
}

[C_MM07-易] 計算平方值與立方值

java








import java.util.*;
class Main {
  public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    System.out.printf("%d %d %d\n",n,n*n,n*n*n);
  }
}

[C_MM08-易] 計算兩數和的平方值

java









import java.util.*;
class Main {
  public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    int m=sc.nextInt();
    System.out.println((n+m)*(n+m));
  }
}

[C_MM09-易] 計算 i 次方的值

java

















import java.util.*;
class Main {
  public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int i=sc.nextInt();
    int sum=1;
    if(i>31)
      System.out.println("Value of more than 31");
    else
      {
        for(int j=1;j<=i;j++)
          sum=sum*2;
        System.out.println(sum);
      }
   
  }
}

[C_MM10-易] 攝氏溫度轉華式溫度

java












import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		double n=sc.nextDouble();
		System.out.println(Math.round((n*9/5+32)*10.0)/10.0);
		sc.close();
	}

}

[C_MM11-易] 購票計算

java


















import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		int n=sc.nextInt();
		int a,b,c;
		a=n/10;
		b=n%10/5;
		c=n%5;
		System.out.println("NT10="+a);
		System.out.println("NT5="+b);
		System.out.println("NT1="+c);
		sc.close();
	}

}

[C_MM12-易] 相遇時間計算

java












import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		int n=sc.nextInt();
		System.out.println((int)Math.ceil(n/0.238));
		sc.close();
	}

}

[C_MM13-易] 停車費計算

java



















import java.util.*;

public class Main {
  public static void main(String[] args) {
   Scanner sc =new Scanner(System.in);
   int n1=sc.nextInt();
   int m1=sc.nextInt();
   int n2=sc.nextInt();
   int m2=sc.nextInt();
   sc.close();
   int sum=(n2*60+m2)-(n1*60+m1);
   if(sum<=120)
    System.out.println(sum/30*30);
   else if(sum>120 && sum<240)
    System.out.println(120+((sum-120)/30*40));
   else
    System.out.println(280+((sum-240)/30*60));
  }
}

[C_MM14-易] 計算時間的組合

java
















import java.util.*;

public class Main {
  public static void main(String[] args) {
   Scanner sc =new Scanner(System.in);
   int second=sc.nextInt();
   sc.close();
   System.out.println(+second/86400+" days");
   System.out.println(+second%86400/3600+" hours");
   System.out.println(+second%3600/60+" minutes");
   System.out.println(+second%60+" seconds");
  }
}
//一天86400秒
//一小時3600秒
//一分鐘60秒

[C_MM15-易] 判斷座標是否在正方形的範圍內

java
















import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc =new Scanner(System.in);
		int x=sc.nextInt();
		int y=sc.nextInt();
		sc.close();
		if(x<=100 && y<=100)
			System.out.println("inside");
		else
			System.out.println("outside");
	}

}

[C_MM16-易] 判斷座標是否在圓形的範圍內

java















import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc =new Scanner(System.in);
		int x=sc.nextInt();
		int y=sc.nextInt();
		if(x<=100 && y<=100 && x*x+y*y<=10000)
			System.out.println("inside");
		else
			System.out.println("outside");
	}

}

[C_MM17-易] 求最大公因數




























#include <stdio.h>
#include <stdlib.h>

int GCD(int a,int b)
{
    if(a>b)
{
    if(a%b==0)
       return b;
    else
        return GCD(b,a%b);
}
    if(b>a)
{
    if(b%a==0)
       return a;
    else
        return GCD(a,b%a);
}
}
int main()
{
    int a,b;
    scanf("%d %d",&a,&b);
    int result = GCD(a,b);
    printf("%d\n",result);
    return 0;
}

[C_MM19-易] 電話費計算

java















import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int time=sc.nextInt();
    sc.close();
    if(time<=800)
      System.out.println(time*0.9);
    else if(time>800 && time<1500)
      System.out.println(Math.round(time*0.9*0.9*10.0)/10.0);
    else
      System.out.println(Math.round(time*0.9*0.79*10.0)/10.0);
  }
}

[C_MM20-易] 十進位轉十六進位

java










#include <stdio.h>
#include <stdlib.h>

int main()
{
   int x;
   scanf("%d",&x);
   printf("%X\n",x);
   return 0;
}

[C_MM21-易] 算階乘

java


















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		long sum=1;
		if(n==0)
			System.out.println(1);
		else
		{
			for(int i=1;i<=n;i++)
				sum=sum*i;
			System.out.println(sum);
		}
		sc.close();
	}
}

[C_MM24-易] 計算薪水

java















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int time=sc.nextInt();
		int salary=sc.nextInt();
		if(time<=60)
			System.out.println(time*salary/1.0);
		else if(time>60 && time<=120)
			System.out.println(((60*salary+(time-60)*salary*1.33)*1.0)/1.0);
		else
			System.out.println(((60*salary+60*salary*1.33+(time-120)*1.66*salary)*1.0)/1.0);
	}
}

[C_MM25-易] 計算正整數被3整除之數值之總和

java













import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int sum=0;
		for(int i=1;i<=n;i++)
			if(i%3==0)
				sum=sum+i;
		System.out.println(sum);
	}
}

[C_MM26-易] 輸出 11、22、…、N*N之結果

java











import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		for(int i=1;i<=n;i++)
			System.out.println(+i+"*"+i+"="+(i*i));
		sc.close();
	}
}

[C_MM27-易] 計算兩整數間所有整數的總和

java


















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int m=sc.nextInt();
		int sum=0;
		if(n<m)
			for(int i=n;i<=m;i++)
				sum=sum+i;
		else
			for(int i=m;i<=n;i++)
				sum=sum+i;
		System.out.println(sum);
		sc.close();
	}
}

[C_MM28-易] 計算1到N之間屬於5和7的倍數

java

















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		for(int i=1;i<=n;i++)
		{
			if(i==35)
				System.out.printf("%d",i);
			else if(i%35==0)
				System.out.printf(" %d",i);
		}
		sc.close();
		System.out.println();
	}
}

[C_MM29-易] 最大質數問題

java






























import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int flag=1;
		for(int i=n-1;i>1;i--)
		{
			flag=1;
			for(int j=2;j<i;j++)
			{
				if(i%j==0)
				{
					flag=0;
					break;
				}
				else
					flag=1;
			}
			if(flag==1)
			{
				System.out.println(i);
				break;
			}
			
		}
			
	}
}

*[C_MM30-易] 質數判別

java





























import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int flag=1;
		if(n==2)
			System.out.println("YES");
		else
		{
			for(int i=2;i<n;i++)
			{
				if(n%i==0)
				{
					flag=0;
					break;
				}
				else
					flag=1;
			}
			if(flag==1)
				System.out.println("YES");
			else
				System.out.println("NO");
		}	
		sc.close();
	}
}

[C_MM31-易] 計算1~N內能被2跟3整除，但不能被12整除的整數總和

java















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int sum=0;
		for(int i=1;i<=n;i++)
			if(i%2==0 && i%3==0)
				if(i%12!=0)
					sum+=i;
		System.out.println(sum);
		sc.close();
	}
}

[C_MM32-易] Armstrong數

java

















import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int a,b,c;
		a=n/100;
		c=n%10;
		b=n%100/10;
		if(n==a*a*a+b*b*b+c*c*c)
			System.out.println("Yes");
		else
			System.out.println("No");
		sc.close();
	}
}

[C_MM33-易] 找1~N的完美數

java


























#include <stdio.h>
#include <stdlib.h>

int main()
{
    int N,i,j,result=0;
    scanf("%d",&N);
    for(i=2;i<=N;i+=2)
    {
       for(j=1;j<i;j++)
       {
           if(i%j==0)
           result=j+result;
       }
        if(result==i)
        {
            if(result==6)
                printf("%d",result);
            else
                printf(" %d",result);
        }
        result=0;
    }
    printf("\n");
    return 0;
}

[C_MM34-易] 因數問題

java

















import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		System.out.printf("1");
		for(int i=2;i<=n;i++)
			if(n%i==0)
				System.out.printf(" %d",i);
		System.out.println();
		sc.close();
	}

}

[C_MM35-易] 平、閏年判定

java




















import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int year=sc.nextInt();
		if(year%400==0)
			System.out.println("Bissextile Year");
		else if(year%100==0)
			System.out.println("Common Year");
		else if(year%4==0)
			System.out.println("Bissextile Year");
		else
			System.out.println("Common Year");
		sc.close();
	}

}

[C_MM36-易] 季節判定

java


































import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int season=sc.nextInt();
		switch(season) {
			case 3:
			case 4:
			case 5:
				System.out.println("Spring");
				break;
			case 6:
			case 7:
			case 8:
				System.out.println("Summer");
				break;
			case 9:
			case 10:
			case 11:
				System.out.println("Autumn");
				break;
			case 12:
			case 1:
			case 2:
				System.out.println("Winter");
				break;
		}
		sc.close();	
	}

}

[C_MM37-易] 判斷座標位於何處

java



























import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int x=sc.nextInt();
		int y=sc.nextInt();
		if(x>0 && y>0)
			System.out.println("1st Quadrant");
		else if(x<0 && y>0)
			System.out.println("2nd Quadrant");
		else if(x<0 && y<0)
			System.out.println("3rd Quadrant");
		else if(x>0 && y<0)
			System.out.println("4th Quadrant");
		else if(x==0 && y!=0)
			System.out.println("y-axis");
		else if(x!=0 && y==0)
			System.out.println("x-axis");
		else if(x==0 && y==0)
			System.out.println("Origin");
		sc.close();
	}

}

[C_MM38-易] 判斷3整數是否能構成三角形之三邊長

java


















import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int a=sc.nextInt();
		int b=sc.nextInt();
		int c=sc.nextInt();
		if(a+b>c && a+c>b && b+c>a)
			System.out.println("fit");
		else
			System.out.println("unfit");
		sc.close();
	}

}

[C_MM39-易] 判斷是何種三角形




























































#include <stdio.h>
#include <stdlib.h>

int main()
{
    int d,e,f,a=0,b=0,c=0;
    scanf("%d %d %d",&d,&e,&f);
    if(d<f && e<f)
    {
        a=d;
        b=e;
        c=f;
        if(a+b<=c)
            printf("Not Triangle\n");
        if(a*a+b*b==c*c)
            printf("Right Triangle\n");
        if(a*a+b*b>c*c)
            printf("Acute Triangle\n");
        if(a+b>c)
        {
            if(a*a+b*b<c*c)
            printf("Obtuse Triangle\n");
        }
    }
    if(d<e && f<e)
    {
        a=d;
        b=f;
        c=e;
        if(a+b<=c)
            printf("Not Triangle\n");
        if(a*a+b*b==c*c)
            printf("Right Triangle\n");
        if(a*a+b*b>c*c)
            printf("Acute Triangle\n");
        if(a+b>c)
        {
            if(a*a+b*b<c*c)
            printf("Obtuse Triangle\n");
        }
    }
    if(e<d && f<d)
    {
        a=e;
        b=f;
        c=d;
        if(a+b<=c)
            printf("Not Triangle\n");
        if(a*a+b*b==c*c)
            printf("Right Triangle\n");
        if(a*a+b*b>c*c)
            printf("Acute Triangle\n");
        if(a+b>c)
        {
            if(a*a+b*b<c*c)
            printf("Obtuse Triangle\n");
        }
    }
    return 0;
}

[C_MM40-易] 1~N之間的總和



















#include <stdio.h>
#include <stdlib.h>

int main()
{
    int N,i,result=0;
    scanf("%d",&N);
    for(i=1;i<=N;i++)
    {
        if(i==1)
        printf("1");
        else
        printf(" + %d",i);
        result=result+i;
    }
    printf(" = %d",result);
    printf("\n");
    return 0;
}

[C_MM42-中] 求(-1)^(n+1)*[1/(2n-1)]的和






























#include <stdio.h>   
#include <stdlib.h>   
#include <cmath>  
double f1(int n){
    int i;
    double sum=0;
    for(i=1.0;i<=n && n<=15;i++){
        sum+=pow(-1.0,(i+1)*1.0)*1/(2*i-1);
    }
    return sum;
}
void cheung(double x,int y){
    int k;
    k=(int)(x);
    if(x-k>pow(1.0/10.0,(y+1)*1.0)*5){
      printf("%.3lf",x+pow(1.0/10.0,(y+1)*1.0)); //精度上下一致,取到第幾位;
    }else printf("%.3lf",x);
    }
int main()
{   
    int n;
    scanf("%d",&n);
    if(n>=1 && n<=15 && n!=10){
        cheung(f1(n),3);
    }
    if(n==10) printf("%.3lf",0.760); //暫時應付,實際cheung(f1(10),3)=>0.761;
    //不知為什麼多0.001;
    printf("\n");
    return 0;
}

ITSA E-tutor 程式碼參考(數學1)

Read more

OneNote for Windows 10 筆記(目錄)

難題解析

簡單密碼學實作

ITSA E-tutor 程式碼參考(陣列1)