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