Submission #1193639

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include <iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define EVEL 1
#define KETA 2
#ifndef EVEL
#define DEB(X) cout << #X << ":" <<std::setw(KETA) << std::setfill('0')<<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X;}
#define TF(f) {f;}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 1000000;
#define NMAX 50
//#define MAX 10

    ll N,K,id=9;
    ll A[100010],sum=0,ans=0;


int main(){
    ios_base::sync_with_stdio(false);
    cin>>N>>K;
    int temp=(N+11-2)%11;
    if(N-2<0)ans=0;
    else ans+=((N-2)/11)*5;

        REP(i,temp+1){
            ll a=id;
            REP(j,5){
                if(i==0||i==N-1)break;
                    if(j==0){
                        sum=a*9;
                    }else{
                        a++;
                        sum=a*9;
                    }
                    DEB(sum%11)
                    if(sum%11==K){ans++;}
            }
            END;
            if(!(i==0||i==N-1))id+=7;
            //DEB(id) END
        }

    cout<<ans<<endl;
}

Submission Info

Judge Result