Submission #345014
Source Code Expand
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
#define cauto const auto&
#endif
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back
#define MOD 1000000009LL
#define EPS 1e-8
int main(){
LL a, b, c, d, e, f;
LL x, y, z;
double p, q, r;
string s = "a", t, u;
a = b = c = d = e = f = 0;
x = y = z = 0;
p = q = r = 0.0;
cin >> a >> b >> c >> d >> e >> f;
cin.clear();
cin >> s >> t >> u;
cin.clear();
vint v = {a, b, c};
sort(ALL(v));
x = v[1];
;cout << x << endl;
}
Submission Info
Submission Time
2015-02-28 21:02:27+0900
Task
A - 高橋くんと年齢
User
climpet
Language
C++11 (GCC 4.8.1)
Score
100
Code Size
1792 Byte
Status
AC
Exec Time
27 ms
Memory
928 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:93:19: warning: narrowing conversion of ‘a’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
vint v = {a, b, c};
^
./Main.cpp:93:19: warning: narrowing conversion of ‘a’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
./Main.cpp:93:19: warning: narrowing conversion of ‘b’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
./Main.cpp:93:19: warning: narrowing conversion of ‘b’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
./Main.cpp:93:19: warning: narrowing conversion of ‘c’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
./Main.cpp:93:19: warning: narrowing conversion of ‘c’ from ‘LL {aka long long int}’ to ‘int’ inside { } [-Wnarrowing]
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All
0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
Case Name
Status
Exec Time
Memory
0.txt
AC
25 ms
800 KB
1.txt
AC
24 ms
744 KB
10.txt
AC
24 ms
924 KB
11.txt
AC
26 ms
800 KB
12.txt
AC
26 ms
920 KB
13.txt
AC
24 ms
924 KB
14.txt
AC
24 ms
928 KB
15.txt
AC
23 ms
920 KB
16.txt
AC
24 ms
912 KB
17.txt
AC
24 ms
668 KB
18.txt
AC
24 ms
916 KB
19.txt
AC
23 ms
924 KB
2.txt
AC
24 ms
920 KB
3.txt
AC
24 ms
792 KB
4.txt
AC
24 ms
796 KB
5.txt
AC
23 ms
800 KB
6.txt
AC
25 ms
804 KB
7.txt
AC
25 ms
796 KB
8.txt
AC
24 ms
916 KB
9.txt
AC
25 ms
924 KB
subtask0_sample_01.txt
AC
27 ms
760 KB
subtask0_sample_02.txt
AC
24 ms
916 KB
subtask0_sample_03.txt
AC
24 ms
912 KB
subtask0_sample_04.txt
AC
23 ms
796 KB