1 solutions
-
0
C :
#include <stdio.h> #include <string.h> const long long mod=11080302; long long a[1000005]; int main() { long long n,m; while(scanf("%lld%lld",&n,&m)!=EOF) { a[0]=0; a[1]=m-1; for(int i=2;i<n;i++) a[i]=((m-1)*a[i-2]+(m-2)*a[i-1])%mod; printf("%lld\n",m*a[n-1]%mod); } return 0; }C++ :
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define mod 11080302 using namespace std; long long a[1000005]; int main() { //freopen("E input.txt","r",stdin); //freopen("E output.txt","w",stdout); long long n,m; while(cin>>n>>m) { a[1]=0; a[2]=(m%mod)*((m-1)%mod)%mod; for(int i=3;i<=n;i++) { a[i]=(m-2)*a[i-1]+(m-1)*a[i-2]; a[i]%=mod; } cout<<a[n]<<endl; } }
- 1
Information
- ID
- 16941
- Time
- 2000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By