- Bovine Bones G
Bovine Bones G 林
- @ 2024-7-12 19:51:45
#include using namespace std; int a[10001]={0}; int main() { int s1,s2,s3,b,max; cin>>s1>>s2>>s3; for(int i=1; i<=s1; i++) { for(int j=1; j<=s2; j++) { for(int k=1; k<=s3; k++) { a[i+j+k]+=1; } } } max=a[3]; b=3; for(int i=3; i<=s1+s2+s3; i++) { if(a[i]>max) { max=a[i]; b=i; } } cout<<b; return 0; }
0 comments
No comments so far...
Information
- ID
- 424
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 38
- Accepted
- 16
- Uploaded By