Submission #1041489
Source Code Expand
#include <bits/stdc++.h> #define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++) #define rep(x,to) for(int (x)=0;(x)<(to);(x)++) #define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--) #define all(c) (c).begin(),(c).end() #define sz(v) (int)(v).size() using namespace std; typedef long long ll; typedef vector<int> VI; typedef pair<int, int> pii; const int mod = (int)1e9 + 7; int main() { //cin.tie(0); ios_base::sync_with_stdio(false); ll x,y; int ans=0; cin >>x >>y; if(x*-1==y){ puts("1"); return 0;} if(y<x) { ans+=2; x *=-1; y*=-1; ans += y-x; cout << ans << endl; return 0; } if( x*y < 0){ ans++; x *=-1;} cout << y-x + ans <<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Simple Calculator |
User | damekamo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 711 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 2 ms | 256 KB |
0_01.txt | AC | 2 ms | 256 KB |
0_02.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | WA | 2 ms | 256 KB |
1_03.txt | WA | 2 ms | 256 KB |
1_04.txt | AC | 2 ms | 256 KB |
1_05.txt | AC | 2 ms | 256 KB |
1_06.txt | WA | 2 ms | 256 KB |
1_07.txt | WA | 2 ms | 256 KB |
1_08.txt | AC | 2 ms | 256 KB |
1_09.txt | WA | 2 ms | 256 KB |
1_10.txt | AC | 2 ms | 256 KB |