oj.uz

Submission #10364

# Submission time Handle Problem Language Result Execution time Memory
10364 2014-10-20T01:43:21 Z gs14004 Modsum (NOI12_modsum) C++
5 / 25
 0 ms 1116 KB 
#include <cstdio>

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

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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Incorrect 0 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Incorrect 0 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -