第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-246 算法训练 猴子吃包子

#include<stdio.h>
int main() 
{
	double x,y,z,x1,y1,z1;
	double sum;
	scanf("%Lf%Lf%Lf%Lf%Lf%Lf",&x,&y,&z,&x1,&y1,&z1);
	int act,i,j;
	scanf("%d",&act);
	sum=x1/x+y1/y+z1/z;
	int s=sum;
	j=sum;
	double dian=sum-s; 
//	printf("%Lf ",dian);
	for(i=0;i<act;i++)
	{
		dian*=10;
		//printf("dian=%Lf  ",dian);
	}
	printf("%d.%.Lf",j,dian);
	return 0;
}

#include <iostream>
#include<iomanip>
using namespace std;
int main()
{
	double x1, y1, z1, v1, v2, v3, n;
	cin >> v1 >> v2 >> v3 >> x1 >> y1 >> z1 >> n;
	double t1 = x1 / v1;
	double t2 = y1 / v2;
	double t3 = z1 / v3;
	double t = t1 + t2 + t3;
	cout << fixed << setprecision(n) << t;
}

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int v1 = sc.nextInt();
		int v2 = sc.nextInt();
		int v3 = sc.nextInt();
		int l1 = sc.nextInt();
		int l2 = sc.nextInt();
		int l3 = sc.nextInt();
		int num = sc.nextInt();
		
		double res = (double)l1/v1+(double)l2/v2+(double)l3/v3;
		
		
		System.out.printf("%."+num+"f",res);
	}
}

x,y,z,x1,y1,z1,p = map(int,input().split())
total = sum=(x1*y*z+y1*x*z+z1*x*y)/(x*y*z)
totaltime = str(total)
totaltime.strip()
num = 0
for i in range(len(totaltime)):
    if totaltime[i] == '.':
        num += len(totaltime) - 1 - i
new_time = list(totaltime)
if p > num:
    for i in range(p - num):
        new_time.append('0')
if p < num:
    for i in range(num - p):
        a = new_time.pop()
        if int(a) >= 5 and i == num - p - 1:
            new_time[len(new_time) - 1] = chr(ord(new_time[len(new_time)-1]) + 1)
for i in range(len(new_time)):
    print(new_time[i],end='')