- #include <iostream>
- #define _for(i,a,b) for(int i = (a);i <b;i ++)
- #define _rep(i,a,b) for(int i = (a);i> b;i --)
- #define INF 0x3f3f3f3f
- #define MOD 1000000007
- #define maxn 50003
- typedef long long ll;
- using namespace std;
- typedef pair<int,int> P;//first 是最短距离, second 是顶点编号
- inline ll read()
- {
- ll ans = 0;
- char ch = getchar(), last = ' ';
- while(!isdigit(ch)) last = ch, ch = getchar();
- while(isdigit(ch)) ans = (ans <<1) + (ans << 3) + ch - '0', ch = getchar();
- if(last == '-') ans = -ans;
- return ans;
- }
- inline void write(ll x)
- {
- if(x < 0) x = -x, putchar('-');
- if(x>= 10) write(x / 10);
- putchar(x % 10 + '0');
- }
- long double rnt = 0.0;
- long double a;
- int main()
- {
- // freopen("testdata (2).in","r+",stdin);
- while(~scanf("%Lf",&a))
- rnt += a*1000000;
- printf("%.5Lf",rnt/1000000);
- return 0;
- }
来源: http://www.bubuko.com/infodetail-3223312.html