Submission #6683143
Source Code Expand
Copy
#include<iostream> #include<algorithm> #include<vector> #include<queue> #include<unordered_set> #include<unordered_map> using namespace std; typedef long long ll; #define mod 1000000007 #define mad(a,b) a=(a+b)%mod; int main(){ ll a,b,c; cin>>a>>b>>c; cout<<max(0LL,c-(a-b))<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Transfer |
User | ynymxiaolongbao |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 317 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 100 / 100 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |
testcase_01 | AC | 1 ms | 256 KB |
testcase_02 | AC | 1 ms | 256 KB |
testcase_03 | AC | 1 ms | 256 KB |
testcase_04 | AC | 1 ms | 256 KB |
testcase_05 | AC | 1 ms | 256 KB |
testcase_06 | AC | 1 ms | 256 KB |
testcase_07 | AC | 1 ms | 256 KB |
testcase_08 | AC | 1 ms | 256 KB |
testcase_09 | AC | 1 ms | 256 KB |
testcase_10 | AC | 1 ms | 256 KB |