Submission #185070
Source Code Expand
#include <iostream>
#include <stdio.h>
#include <istream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <complex>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<long, long> pl;
typedef pair<double, double> pd;
typedef vector<pi> vpi;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<long, long> vll;
typedef vector<double> vec;
typedef vector<vec> mat;
typedef map<int, int> mii;
void dumppi(const pi &p) { cout << p.first << ' ' << p.second << endl; }
typedef pair<long, long> pl;
void dumppl(const pl &p) { cout << p.first << ' ' << p.second << endl; }
typedef vector<pi> vpi;
void dumpvpi(const vpi &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<bool> vb;
void dumpvb(const vb &vec) { for (auto b : vec) { cout << b << ' '; } cout << endl; }
typedef vector<int> vi;
void dumpvi(const vi &vec) { for (auto i : vec) { cout << i << ' '; } cout << endl; }
typedef vector<pl> vpl;
void dumpvpi(const vpl &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<vi> vii;
void dumpvii(const vii &mat) {for (auto vec : mat) {for (auto v : vec){cout << v << ' ';} cout << endl;}}
// util macro
// ----------------------------------------
#define mp make_pair
#define pb push_back
//-----------------------------------------
// iterator
// ----------------------------------------
#define all(x) (x).begin(), (x).end()
// ----------------------------------------
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
//------------------------------------------
const int INF = 1e9;
const double EPS = 1e-10;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = { 0,-1, 0, 1};
const int mod = 100007;
const double g = 9.8;
// POINTS
//-------------------------------------------
typedef complex<double> point;
// X : real();
// Y : imag();
double dot(point a, point b){ // inner product
return (a * conj(b)).real();
}
double cross(point a, point b){ // outer product
return (a * conj(b)).imag();
}
double dist(point a, point b) {
return dot(a-b, a-b);
}
typedef vector<point> vpoint;
//-------------------------------------------
#define debu 0
int main(int argc, const char * argv[])
{
int H1, H2;
scanf("%d %d", &H1, &H2);
printf("%d\n", H1-H2);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 積雪深差 |
User |
nida_001 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2762 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
920 KB |
Compile Error
./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:93:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &H1, &H2);
^
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 |
22 ms |
872 KB |
00_sample_02.txt |
AC |
22 ms |
796 KB |
00_sample_03.txt |
AC |
23 ms |
792 KB |
test_01.txt |
AC |
22 ms |
920 KB |
test_02.txt |
AC |
21 ms |
796 KB |
test_03.txt |
AC |
25 ms |
788 KB |
test_04.txt |
AC |
26 ms |
840 KB |
test_05.txt |
AC |
25 ms |
796 KB |
test_06.txt |
AC |
23 ms |
788 KB |
test_07.txt |
AC |
22 ms |
792 KB |
test_08.txt |
AC |
23 ms |
796 KB |
test_09.txt |
AC |
23 ms |
796 KB |
test_10.txt |
AC |
22 ms |
796 KB |
test_11.txt |
AC |
22 ms |
792 KB |
test_12.txt |
AC |
20 ms |
792 KB |
test_13.txt |
AC |
23 ms |
800 KB |
test_14.txt |
AC |
22 ms |
716 KB |
test_15.txt |
AC |
22 ms |
788 KB |
test_16.txt |
AC |
24 ms |
796 KB |
test_17.txt |
AC |
22 ms |
792 KB |