/*
PKU 1939
Author : Yizer
*/
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <stdio.h>
#include <string.h>
using namespace std;

int n;
int main()
{
	
	double a[1000],b[1000],x[1000],y[1000];

	while (scanf("%d",&n)!=EOF)
	{
		for (int i=0;i<n;i++)
			scanf("%lf%lf",&a[i],&b[i]);
		for (int i=0;i<n-1;i++)
		{
			x[i] = (a[i]+a[i+1])/2;
			y[i] = (b[i]+b[i+1])/2;
		}
		x[n-1] = (a[n-1]+a[0])/2;
		y[n-1] = (b[n-1]+b[0])/2;

		printf("%d",n);
		for (int i=0;i<n;i++)
			printf(" %.6lf %.6lf",x[i],y[i]);
		puts("");
	}
	return	0;
}

这个代码C++交AC
G++提交TLE
非常诡异
一个32msAC一个TLE

• We have a page titled FAQ for a reason. (859) frkstyc 2009-05-18 14:23:45
  • Sorry..但是%f和%g也不行啊 (0) yizer 2009-05-18 14:45:26
    • scanf还是用%lf,printf用%f和%g (0) huangkun 2009-05-18 14:57:49