Submission #555814
Source Code Expand
#include <algorithm> #include <bitset> #include <cctype> #include <cmath> #include <cstdlib> #include <deque> #include <iostream> #include <iomanip> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <string> #include <vector> #include <unordered_map> #define rep(i,l) for(int(i)=0; (i)<int(l); i++) #define mp(x,y) make_pair(x, y) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define pb(x) push_back(x) #define pob(x) pop_back(x) #define pf(x) push_front(x) #define pof(x) pop_front(x) #define srtg(x) sort(all(x), greater<int>()) #define print(x) cout<<x; #define printn(x) cout<<x<<endl; #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector<int> vi; typedef vector<string> vs; typedef vector<double> vd; typedef pair<int, int> pi; typedef priority_queue<int> pqi; typedef priority_queue<int, vector<int>, greater<int> > pqig; template<typename T, typename U> inline void amin(T &x, U &y) { if(y < x) swap(x,y); } template<typename T, typename U> inline void amax(T &x, U &y) { if(x < y) swap(x,y); } int main(int argc, char *argv[]) { int a, b; cin >> a >> b; printn(a-b); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 積雪深差 |
User | Ryuno |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1248 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 928 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 | 26 ms | 788 KB |
00_sample_02.txt | AC | 23 ms | 668 KB |
00_sample_03.txt | AC | 29 ms | 676 KB |
test_01.txt | AC | 25 ms | 672 KB |
test_02.txt | AC | 27 ms | 692 KB |
test_03.txt | AC | 26 ms | 676 KB |
test_04.txt | AC | 25 ms | 676 KB |
test_05.txt | AC | 26 ms | 928 KB |
test_06.txt | AC | 25 ms | 708 KB |
test_07.txt | AC | 26 ms | 800 KB |
test_08.txt | AC | 25 ms | 676 KB |
test_09.txt | AC | 33 ms | 756 KB |
test_10.txt | AC | 26 ms | 800 KB |
test_11.txt | AC | 26 ms | 676 KB |
test_12.txt | AC | 26 ms | 920 KB |
test_13.txt | AC | 23 ms | 800 KB |
test_14.txt | AC | 23 ms | 800 KB |
test_15.txt | AC | 26 ms | 736 KB |
test_16.txt | AC | 26 ms | 668 KB |
test_17.txt | AC | 26 ms | 736 KB |