제출 #1174401

#제출 시각아이디문제언어결과실행 시간메모리
1174401khangrl나머지들의 합 (NOI12_modsum)C++20
25 / 25
1 ms328 KiB
#include<bits/stdc++.h> #define ff first #define ss second #define int long long #define pb push_back using namespace std; int n, l[1005], r[1005], dp[1005][6]; signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 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; }
#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...