浮点数变整数hh

## 浮点数变整数hh

1直接double转int（向下取整）(对于浮点数对于浮点数求余可参考下面博客写的比较好的做法)

/*
Marathon CodeForces - 404B  

Valera takes part in the Berland Marathon. The marathon race starts at the stadium that can be represented on the plane as a square whose lower left corner is located at point with coordinates (0, 0) and the length of the side equals a meters. The sides of the square are parallel to coordinate axes.
As the length of the marathon race is very long, Valera needs to have extra drink during the race. The coach gives Valera a bottle of drink each d meters of the path. We know that Valera starts at the point with coordinates (0, 0) and runs counter-clockwise. That is, when Valera covers a meters, he reaches the point with coordinates (a, 0). We also know that the length of the marathon race equals nd + 0.5 meters. 
Help Valera's coach determine where he should be located to help Valera. Specifically, determine the coordinates of Valera's positions when he covers d, 2·d, ..., n·d meters.
Input
The first line contains two space-separated real numbers a and d (1 ≤ a, d ≤ 105), given with precision till 4 decimal digits after the decimal point. Number a denotes the length of the square's side that describes the stadium. Number d shows that after each d meters Valera gets an extra drink.
The second line contains integer n (1 ≤ n ≤ 105) showing that Valera needs an extra drink n times.
Output
Print n lines, each line should contain two real numbers x i and y i, separated by a space. Numbers x i and y i in the i-th line mean that Valera is at point with coordinates (x i, y i) after he covers i·d meters. Your solution will be considered correct if the absolute or relative error doesn't exceed 10 - 4.
Note, that this problem have huge amount of output data. Please, do not use cout stream for output in this problem.
Examples
Input 
2 5
2
Output 
1.0000000000 2.0000000000
2.0000000000 0.0000000000
Input 
4.147 2.8819
6
Output 
2.8819000000 0.0000000000
4.1470000000 1.6168000000
3.7953000000 4.1470000000
0.9134000000 4.1470000000
0.0000000000 2.1785000000
0.7034000000 0.0000000000
Sponsor*/
#include<stdio.h>
#include<iostream>
using namespace std;
void print(double len,double a){
	int t=len/a;
	len-=t*a;
	if(t==0)
		printf("%lf %lf\n",len,0.0);
	else if(t==1)
		printf("%lf %lf\n",a,len);
	else if(t==2)
		printf("%lf %lf\n",a-len,a);
	else
		printf("%lf %lf\n",0.0,a-len);
}
int main(){
	double a,d;
	int n;
	cin>>a>>d>>n;
	double len=0,mod=4*a;
	while(n--){
		len+=d;
		int duo=len/mod;
		len-=duo*mod;
		print(len,a);
	}
	return 0;
}

————————————————
版权声明：本文为CSDN博主「菩提树下小沙弥」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/mid_kkks/article/details/21725065

2输出的四舍五入nb