划数

思路

• 因为cnt>=11,所以找到一个cnt后把所有的数加起来取模即可
• 如果只有两个数，则输出另一个数

代码

// Problem: 划数
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/9986/D
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp(aa,bb) make_pair(aa,bb)
#define _for(i,b) for(int i=(0);i<(b);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define X first
#define Y second
#define lowbit(a) (a&(-a))
#define debug(a) cout<<#a<<":"<<a<<"\n"
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
const int N=200010;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-6;
const double PI=acos(-1.0);

ll n,cnt,a[N];

void solve(){
    while(cin>>n>>cnt){
        ll sum=0;
        if(n==2){
            rep(i,1,n){
                cin>>a[i];
                sum+=a[i];
            }
            cout<<sum-cnt<<"\n";
            continue;
        }
        bool flag=0;
        rep(i,1,n){
            cin>>a[i];
            if(a[i]==cnt&&!flag) flag=1;
            else sum+=a[i],sum%=11;
        }
        cout<<sum<<"\n";
    }
}


int main(){
    ios::sync_with_stdio(0);cin.tie(0);
//    int t;cin>>t;while(t--)
    solve();
    return 0;
}