A:

#include
     
      using namespace std;int main(){    int n;    cin>>n;    cout<<(n-1)/5+1;}
     

B:

#include
     
      using namespace std;int n;int pos[110];int cnt;#define rep(i,j,k) for(int i=j;i<=k;i++)typedef long long ll;int main(){    cin>>n;    rep(i,1,n)    {        int num;        cin>>num;        if(num==1)        {            cnt++;            pos[cnt]=i;        }    }    ll ans=1;    rep(i,1,cnt-1)    {        ans*=(ll)(pos[i+1]-pos[i]);    }    if(pos[1])    cout<
      
       <
      
     

C:

#include
     
      #include
      
       using namespace std;int n;typedef long long ll;ll x1,y1,x2,y2;struct fon{    ll x,y;    ll dis1,dis2;}f[2010];#define rep(i,j,k) for(int i=j;i<=k;i++)bool cmp(fon a,fon b){    return a.dis1
       
        >n>>x1>>y1>>x2>>y2;    rep(i,1,n)    {        cin>>f[i].x>>f[i].y;        f[i].dis1=(f[i].x-x1)*(f[i].x-x1)+(f[i].y-y1)*(f[i].y-y1);        f[i].dis2=(f[i].x-x2)*(f[i].x-x2)+(f[i].y-y2)*(f[i].y-y2);    }    sort(f+1,f+1+n,cmp);    ll ans=1e17;    rep(i,0,n)    {        ll tmp=0;        rep(j,i+1,n)        {            tmp=max(tmp,f[j].dis2);        }        ans=min(ans,f[i].dis1+tmp);    }    if(n==1)    ans=min(f[1].dis1,f[1].dis2);    cout<
       
      
     

D:

#include
     
      #include
      
       using namespace std;struct point{    int x,y;}p[4];#define rep(i,j,k) for(int i=j;i<=k;i++)int main(){    cin>>p[1].x>>p[1].y>>p[2].x>>p[2].y>>p[3].x>>p[3].y;    if((p[1].x==p[2].x&&p[2].x==p[3].x)||(p[1].y==p[2].y&&p[2].y==p[3].y))    {        cout<<"1";        return 0;    }    int tmpi=0,tmpj=0;    rep(i,1,2)    rep(j,i+1,3)    {        if(p[i].x==p[j].x)        {            tmpi=i;tmpj=j;        }    }    if(tmpi&&tmpj)    {        rep(i,1,3)        {            if(i!=tmpi&&i!=tmpj)            {                if(p[i].y>=max(p[tmpi].y,p[tmpj].y)||p[i].y<=min(p[tmpi].y,p[tmpj].y))                {                    cout<<"2";                    return 0;                }            }        }    }    tmpi=tmpj=0;    rep(i,1,2)    rep(j,i+1,3)    {        if(p[i].y==p[j].y)        {            tmpi=i;tmpj=j;        }    }    if(tmpi&&tmpj)    {        rep(i,1,3)        {            if(i!=tmpi&&i!=tmpj)            {                if(p[i].x>=max(p[tmpi].x,p[tmpj].x)||p[i].x<=min(p[tmpi].x,p[tmpj].x))                {                    cout<<"2";                    return 0;                }            }        }    }    cout<<"3";}
      
     

E:

#include
     
      #include
      
       using namespace std;int n,m,k;const int mxn=1e5+10;int seq[mxn];typedef long long ll;struct query{    int l,r,id;    ll ans;}q[mxn];ll exist[20000000+10];#define rep(i,j,k) for(int i=j;i<=k;i++)bool cmp(query a,query b){    if(a.l/400==b.l/400)    return a.r
       
        >n>>m>>k;    rep(i,1,n)    {        int num;        scanf("%d",&num);        seq[i]=seq[i-1]^num;    }    rep(i,1,m)    {        scanf("%d%d",&q[i].l,&q[i].r);        q[i].id=i;        q[i].l--;    }    sort(q+1,q+1+m,cmp);    int l=q[1].l,r=q[1].r;    ll ans=0;    rep(i,l,r)    {        ans+=exist[k^seq[i]];        exist[seq[i]]++;    }    q[1].ans=ans;    rep(i,2,m)    {        while(r
        
         q[i].r)        {            exist[seq[r]]--;            ans-=exist[k^seq[r]];            r--;        }        while(l>q[i].l)        {            l--;            ans+=exist[k^seq[l]];            exist[seq[l]]++;        }        while(l