Submission #1365606
Source Code Expand
//------------- //include //------------- #include <map> #include <set> #include <list> #include <cmath> #include <vector> #include <string> #include <cctype> #include <random> #include <cstdlib> #include <iostream> #include <algorithm> using namespace std; //------------- //typedef //------------- typedef long long LL; typedef vector<int> VI; typedef vector<string> VS; typedef pair<int, int> PII; typedef vector<int, int> VII; typedef map<string, int> MSI; //------------- //utillty //------------- #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define MK make_pair #define PB push_back #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //------------- //repetition //------------- #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //------------- //debug //------------- #define dump(x) cerr << #x << " = " << (x) << endl; #define dumpl(x) REP(i,SZ(x))cerr<<i<<x<<"="<<x[i]<<endl; #define SIZE(x) cout<<sizeof(x)<<endl; const int MOD = 1000000007; //------------- //cout //------------- #define COUTL(x) cout<<x<<endl #define COUT(x) cout<<x int main() { int A, B; cin >> A >> B; COUTL(A - B); #ifdef _DEBUG while(1); #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 積雪深差 |
User | ayatakamaru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1414 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |