Submission #2711620
Source Code Expand
#include<iostream> #include<string> #include<algorithm> #include<cmath> #include<iomanip> #include<cstring> #include<map> #include<vector> #include<queue> #include<stack> #include<climits> #include<set> #include<utility> using namespace std; typedef long long int ll; typedef pair<int, int> P; const ll MOD=1e9+7; int main(){ int x, y, ans=MOD; cin >> x >> y; if(y+x+1>0){ ans=y+x+1; } if(y-x>0){ ans=min(ans, y-x); } if(-y-x+1>0){ ans=min(ans, -y-x+1); } if(-y+x+2>0){ ans=min(ans, -y+x+2); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Simple Calculator |
User | tenkyu |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 592 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 | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 1 ms | 256 KB |