1 solutions
-
0
C :
#include<stdio.h> #define Max(a,b) (a>b?a:b) int n,x,max; long long s; int main() { scanf("%d %d",&n,&x); max=x;s=x; for(int i=2;i<=n;i++) { x=(379*x+131)%997; max=Max(max,x); s+=max; } printf("%lld",s); return 0; }
C++ :
#include<bits/stdc++.h> using namespace std; int n,x,a[100001],k,sum; int main(){ cin>>n>>x; sum = k = a[1] = x; for(int i=2;i<=n;i++) { a[i]=(379*a[i-1]+131)%997; } for(int i=2;i<=n;i++){ if(k > a[i]) { a[i] = k; }else{ k = a[i]; } sum += a[i]; } cout<<sum; return 0; }
- 1
Information
- ID
- 10245
- Time
- 1000ms
- Memory
- 16MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By