1 条题解

  • 0
    @ 2025-10-10 15:48:08

    C :

    #include<stdio.h>
    #include<stdlib.h>
    int main(){
    	    double eletric,money;
    	scanf("%lf",&eletric);
     
        if(eletric<=150)	
            money=eletric*0.4463;//电量少于150KWh时的电费
        if(eletric>150&&eletric<=400)	
            money=150*0.4463+(eletric-150)*0.4663;//电量多于150KWh,少于400KWh时的电费
        if(eletric>400)		
            money=150*0.4463+250*0.4663+(eletric-400)*0.5663;//电量多于400KWh时的电费
        
        printf("%.1lf",money);//保留小数点1位
        printf("\n");//换行
    
    	return 0;
    }
    

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    int main(){
    	int g,s,b,q,w,i,s1,s2,s3,k,f = 0;
    	cin>>k;
    	for(i = 10000;i <= 30000;i++){
    		w = i / 10000;
    		q = i / 1000 % 10;
    		b = i / 100 % 10;
    		s = i / 10 % 10;
    		g = i % 10;
    		
    		s1 = w * 100 + q * 10 + b;
    		s2 = q * 100 + b * 10 + s;
    		s3 = b * 100 + s * 10 + g;
    		
    		if(s1 % k == 0 && s2 % k == 0 && s3 % k == 0){
    			cout<<i<<endl;
    			f = 1;
    		}
    	}
    	
    	if(f == 0){
    		cout<<"No"<<endl;
    	}
    }
    

    Java :

    import java.util.*;
    public class Main{
    	public static void main(String[] args){
    		Scanner sc = new Scanner(System.in);
    		int n = sc.nextInt();
    		if (n <= 150){
    			System.out.println(String.format("%.1f",n*0.4463));
    		}
    		else if (n <= 400){
    			System.out.println(String.format("%.1f",(n-150)*0.4663+66.945));
    		}
    		else if (n >= 401 ){
    			System.out.println(String.format("%.1f",116.575+66.945+(n-400)*0.5663));
    		}
    	}
    }
    

    Python :

    n = int(input())
    if n <= 150:
        a = n * 0.4463
        print(round(a,1))
    if n > 150 and n <= 400:
        a = 150 * 0.4463 + (n - 150) * 0.4663
        print(round(a,1))
    if n > 400:
        a = 150 * 0.4463 + 250 * 0.4663 + (n - 400) * 0.5663
        print(round(a,1))
    
    • 1

    信息

    ID
    443
    时间
    1000ms
    内存
    32MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者