Submission #10366

#	Time	Username	Problem	Language	Result	Execution time	Memory
10366		gs14004	Modsum (NOI12_modsum)	C++98	25 / 25	0 ms	1116 KiB

modsum

#include <cstdio>

int n,s[1005], e[1005];

int dp[5][1005];
int get_cnt(int x, int y){
    if(y == n){
        x=x*x+1;
        return (x*x+4)%5+1;
    }
    if(dp[x][y]) return dp[x][y];
    else{
        int res = 0;
        for (int i=s[y]; i<=e[y]; i++) {
            res += get_cnt((x+i)%5,y+1);
        }
        return dp[x][y]=res;
    }
}

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d %d",&s[i],&e[i]);
    }
    printf("%d",get_cnt(0,0));
}

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