HZNU Training 17 for Zhejiang Provincial Competition 2020

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll C=2016;
int main(){
    ll n,m;
    while(~scanf("%lld %lld",&n,&m)){
        ll ans=0;
        for(int i=1;i<=min(n,C);i++){
            for(int j=1;j<=min(m,C);j++){
            if((i*j)%2016==0){
                ll a=n/C+1,b=m/C+1;
                if(n%C<i)a--;
                if(m%C<j)b--;
                ans+=a*b;
            }
            }
        }
        printf("%lld\n",ans);
    }
    // system("pause");
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
const int N=1e5+5;
#define pb push_back
vector<int>e[N];
int n,m;
int in[N];
ll  a[N],b[N];
ll ans;
void topo(){   
    queue<int>Q;
    for(int i=1;i<=n;i++)if(in[i]==0)Q.push(i);
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        for(int i=0;i<e[u].size();i++){
            int v=e[u][i];--in[v];
        if(!in[v])Q.push(v);
        ans+=(a[u]*b[v])%MOD;ans%=MOD;
        a[v]=(a[v]+a[u])%MOD;
        }
    }
}
int main(){
    while(~scanf("%d %d",&n,&m)){
    ans=0;
    for(int i=1;i<=n;i++)e[i].clear(),in[i]=0;
    for(int i=1;i<=n;i++)scanf("%lld %lld",&a[i],&b[i]);
    for(int i=1,u,v;i<=m;i++)scanf("%d %d",&u,&v),e[u].pb(v),++in[v];
    topo();
    printf("%lld\n",ans);
    }
    return 0;
}