赛后补题

应该是个人都能做出来...

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define db double
#define Dg(n)  cout<<n<<endl;
#define F(n) for(int i=1;i<=n;i++)
#define F1(n) for(int i=n;i>=1;i--)
#define F2(n,s) for(int i=1;i<=n;i+=s)
#define F4(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)
#define FD(name,n) for(int name=1;name<=n;name++)
#define li i&-i
#define nel (rt<<1)
#define ner (rt<<1|1)
#define trm ((tr[rt].l+tr[rt].r)>>1)
#define trf ((tr[rt].r-tr[rt].l))
#define op(a,type) bool operator a (const type &an)

const int dx[5]={0,1,-1,0,0};
const int dy[5]={0,0,0,1,-1};
const int INF=0x3f3f3f3f;
const int LXB=2e6+10;
const db e=2.718281828459;
const db pai=3.1415926535;
const int lxb=3e3;

int n,m,k,l,t;
int a[LXB],f[LXB];
int mp[lxb][lxb];
string s;
char p;

struct node{
   int l,r,x; 
}no;

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int T=1;
    cin>>n;
    while(T--){
        m=n/6;
        k=n%6;
        if(0<k)cout<<m+1;
        else cout<<m;
    }
    return 0;
}

x=int(input()) r=x//6 if x%6!=0: print(r+1) else: print(r)

最后的人坐哪条船都一样，船数都要加一

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int x;
	cin >> x;
	int ans = x/6;
	if(x%6!=0) ans+=1;
	cout << ans;
	return 0;
}