1284: 冗余关系
```cpp#includeusingnamespacestd;intpre[1001],sum;intfind(intx){intr=x;while(r!=pre[r])r=pre[r];inti=x,j;while(i!=r){j=pre[i];pre[i]=r;i=j;}returnr;}voi
题解列表
1285: 阶乘末尾的K位
```cpp#include#includeusingnamespacestd;longlongjiecheng(intn){longlongsum=1;for(inti=1;i>n>>k;longlongsum=jiecheng(n);while(sum%10==0)sum/=10;longlong
1286: 最大配对
```cpp#include#includeusingnamespacestd;constintN=1e5+10;inta[N],b[N];intmain(){intn;cin>>n;for(inti=0;i>a[i];for(inti=0;i>b[i];sort(a,
1287: 最大质因数
摘要：```cpp
#include
using namespace std;
bool fun(int x)
{
int y;
for(y=x-1;y>1;y--)
……
1288: 线段的总长
摘要：```cpp
#include
using namespace std;
int main()
{
int n;
cin>>n;
long long s[n],……
1289: N的-2进制表示
```cpp#includeusingnamespacestd;intmain(){inti=0,num;charstr[128]={'\0',};scanf("%d",&num);while(true){if(num%2==0)str[i++]='0';elseif(num%2==-1||num%2
1290: 奶牛的锻炼
```cpp#include#includeusingnamespacestd;constintN=10500,M=550;intdp[N][M],d[N],n,m;intmain(){scanf("%d%d",&n,&m);for(inti=1;i
1291: 外星人的密码数字
摘要：```cpp
#include
#include
using namespace std;
int main()
{
string rule,str;
cin>>rule……
1296: 牛棚回声
```cpp#includeusingnamespacestd;intmax_match(strings1,strings2){intlen1=s1.length(),len2=s2.length(),l=0,k=0,sum=0,max=0;for(inti=0;i=0;j--){k=i;l=j;su