Submission #1173893

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173893		ezzzay	나머지들의 합 (NOI12_modsum)	C++20	25 / 25	1 ms	396 KiB

modsum

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=3005;
int l[N];
int r[N];
int dp[N][5];
signed main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>l[i]>>r[i];
    }
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        map<int,int>mp;
        for(int j=l[i];j<=r[i];j++){
            mp[j%5]++;
        }
        for(int j=0;j<5;j++){
            for(int k=0;k<5;k++){
                dp[i][(j+k)%5]+=dp[i-1][j]*mp[k];
            }
        }
    }
    int ans=0;
    for(int i=0;i<5;i++){
        ans+= (((i*i*i*i)%5+i*i*2%5)%5+1)*dp[n][i];
    }
    cout<<ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5