114514a 123456 ❤️

using namespace std; int n,a[100086],l,mmax; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n-1;i++) { if(a[i]+a[i+1]+a[i+2]+a[i+3]>mmax) { mmax=a[i]+a[i+1]+a[i+2]+a[i+3]; l=i; } } cout<<mmax<<endl<<l; return 0; }

#include <bits/stdc++.h> using namespace std; long long a,b[1005],d,s,f; int main() { cin>>a; for(int i=0;i<a;i++) { cin>>d; b[d]++; } for(int i=0;i<=1000;i++) { if(b[i]>s) { s=b[i]; f=i; } } cout<<f; return 0; }

using namespace std;
struct fs
{
	string name;
	int noip;
};
fs a[114514];
bool cmp(fs x,fs y)
{
	if(x.noip!=y.noip) return x.noip>y.noip;
	return x.name<y.name;
}
int n;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].name>>a[i].noip;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].name<<" "<<a[i].noip<<endl;
	} 
	return 0;
}

using namespace std;
int sum;
int main() 
{
	string s;
	cin>>s;
	for(int i=0;i<s.size();i++)
	{
		if(s[i]=='1') sum+=2;
		else if(s[i]>='A'&&s[i]<='C') sum+=3;
		else if(s[i]>='D'&&s[i]<='F') sum+=4;
		else if(s[i]>='G'&&s[i]<='I') sum+=5;
		else if(s[i]>='J'&&s[i]<='L') sum+=6;
		else if(s[i]>='M'&&s[i]<='O') sum+=7;
		else if(s[i]>='P'&&s[i]<='S') sum+=8;
		else if(s[i]>='T'&&s[i]<='V') sum+=9;
		else if(s[i]>='W'&&s[i]<='Z') sum+=10;
	}
	cout<<sum;
    return 0;
}

using namespace std;

int main() {
    int n, a[300], c = 0;
    cin >> n;
    
    for(int i = 0, j = 0; i < n; i++) {
        cin >> a[j];
        if(a[j] * a[j] % 7 != 1) {
            j++;
            c++;
        }
    }
    
    for(int i = 0; i < c; i++) {
        cout << a[i] << " ";
    }
    return 0;
}

#include
using namespace std;
string s[100],l;
int k;
int main()
{
	while(cin>>l)
	{
		s[++k]=l;
	}
	sort(s+1,s+1+k);
	for(int i=0;i<=k;i++){
		if(s[i]==s[i+1]) continue;
		cout<<s[i]<<endl;
	} 
	return 0;
}`

using namespace std;
int a[114514],sum,mmax=-114514,mmin=114514;
int main()
{
	int n; 
	cin>>n;
	for(int i=1;i<=n;i++) 
	{
		cin>>a[i];
		sum+=a[i];
		mmax=max(mmax,a[i]);
		mmin=min(mmin,a[i]);
	}
	cout<<sum<<endl<<mmax<<endl<<mmin<<endl;
	sort(a+1,a+n+1);
	for(int i=n;i>=1;i--)
	{
		if(a[i]!=a[i-1])
		{
			cout<<a[i]<<" ";
		}
	}
	return 0;
}
//这次必对！！！

using namespace std;
bool Is_prime(int x)
{
	if(x<2) return 0;
	for(int i=2;i<=sqrt(x);i++) if(x%i==0) return 0;
	return 1;
}
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=n;i<=m;i++) if(Is_prime(i)) cout<<i<<endl;
	return 0;

}

using namespace std;
int main()
{
	string s;
	bool flag=true;
	while(cin>>s)
	{
		if (flag)
		{
		flag=false;
		cout<<s.size();	
		}
		else{
		cout<<","<<s.size();
		}
	}
	return 0;
}