AtCoder ABC142

本来不想发这篇博客的
但是考虑到这是人生中第一次atcoder abc做出5道题
还是忍不住发一波

T1

看到了就很慌
作为史上做过的最难得abcT1，居然不是像140那种的直接输出$N^3$
翻译一下题意，输出$\frac{小于n的奇数个数}{n}$

# include <cstdio>
# include <algorithm>
# include <cstring>
# include <cmath>
# include <climits>
# include <iostream>
# include <string>
# include <queue>
# include <vector>
# include <set>
# include <map>
# include <cstdlib>
# include <stack>
# include <ctime>
using namespace std;

# define Rep(i,a,b) for(int i=a;i<=b;i++)
# define _Rep(i,a,b) for(int i=a;i>=b;i--)
# define mct(a,b) memset(a,b,sizeof(a))
# define gc getchar()
typedef long long ll;
const int N=1e5+5;
const int inf=0x7fffffff;
const double eps=1e-7;
template <typename T> void read(T &x){
   
	x=0;int f=1;
	char c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+c-'0';
	x*=f;
}
int n;
int main()
{
   
	read(n);
	printf("%lf\n",1.*((n+1)/2)/n);
	return 0;
}

T2

有n个人，每个人有一个身高
问有几个人身高大于等于k
感觉这道题比上一题简单

# include <cstdio>
# include <algorithm>
# include <cstring>
# include <cmath>
# include <climits>
# include <iostream>
# include <string>
# include <queue>
# include <vector>
# include <set>
# include <map>
# include