Submission #2381860
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> using namespace std; vector<int> a(3); int m; int main(){ for(int i=0;i<3;i++){ cin>>a[i]; } sort(a.begin(),a.end()); int m=a[2]; //cout<<a[2]<<endl; for(int i=0;i<3;i++){ a[i]=abs(a[i]-m); } int ans=0,count=0; for(int i=0;i<3;i++){ if(a[i]!=0)ans+=a[i]/2; if(a[i]!=0)a[i]=a[i]%2; count+=a[i]; } if(count==0)cout<<ans<<endl; else if(count==1)cout<<ans+2<<endl; else if(count==2)cout<<ans+1<<endl; else cout<<ans<<endl; /* for(int i=0;i<=3;i++){ if(count==i){ cout<<ans+i<<endl; break; } } */ }
Submission Info
Submission Time | |
---|---|
Task | C - Same Integers |
User | fio |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 663 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |