Submission #827957
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;
#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007
template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}
int main(void)
{
write(read<int>()-read<int>());
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 積雪深差 |
User |
koyubi |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
1941 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
924 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 |
924 KB |
00_sample_02.txt |
AC |
23 ms |
680 KB |
00_sample_03.txt |
AC |
25 ms |
800 KB |
test_01.txt |
AC |
23 ms |
800 KB |
test_02.txt |
AC |
24 ms |
676 KB |
test_03.txt |
AC |
25 ms |
680 KB |
test_04.txt |
AC |
25 ms |
676 KB |
test_05.txt |
AC |
23 ms |
676 KB |
test_06.txt |
AC |
23 ms |
924 KB |
test_07.txt |
AC |
26 ms |
800 KB |
test_08.txt |
AC |
23 ms |
800 KB |
test_09.txt |
AC |
25 ms |
804 KB |
test_10.txt |
AC |
24 ms |
800 KB |
test_11.txt |
AC |
23 ms |
800 KB |
test_12.txt |
AC |
29 ms |
592 KB |
test_13.txt |
AC |
25 ms |
676 KB |
test_14.txt |
AC |
25 ms |
800 KB |
test_15.txt |
AC |
25 ms |
804 KB |
test_16.txt |
AC |
25 ms |
804 KB |
test_17.txt |
AC |
25 ms |
680 KB |