Submission #10363

#TimeUsernameProblemLanguageResultExecution timeMemory
10363gs14004Modsum (NOI12_modsum)C++98
25 / 25
72 ms1096 KiB
#include <cstdio> int n,s[1005], e[1005]; int get_cnt(long long x, int y){ if(y == n){ x = x*x +1; return (x*x+4)%5+1; } else{ int res = 0; for (int i=s[y]; i<=e[y]; i++) { res += get_cnt(x+i,y+1); } return 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)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...