数组初始化 memset fill

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <time.h>
#include <string>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <ext/rope>
#include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
#define minv 1e-6
#define inf 1e9
#define pi 3.1415926536
#define nl 2.7182818284
const ll mod=1e9+7;//998244353
const int maxn=1e2+10;

int a[maxn],b[maxn];

char c[maxn];

int main()
{
    memset(a,0,sizeof(a));
    fill(b,b+100,inf);
    fill(c,c+100,'a');

    cout<<a[1]<<endl;
    cout<<b[2]<<endl;
    cout<<c[3]<<endl;
    return 0;
}