結果

問題 No.394 ハーフパイプ(1)
ユーザー Slephy
提出日時 2023-12-30 10:15:52
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,764 bytes
コンパイル時間 1,904 ms
コンパイル使用メモリ 198,512 KB
最終ジャッジ日時 2025-02-18 15:35:46
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 11
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main(int, char**)’:
main.cpp:27:15: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 2 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
   27 |     printf("%ld.%02ld\n", ans/100, ans%100);
      |             ~~^           ~~~~~~~
      |               |              |
      |               long int       ll {aka long long int}
      |             %lld
main.cpp:27:21: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 3 has type ‘ll’ {aka ‘long long int’} [-Wformat=]
   27 |     printf("%ld.%02ld\n", ans/100, ans%100);
      |                 ~~~~^              ~~~~~~~
      |                     |                 |
      |                     long int          ll {aka long long int}
      |                 %02lld

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ここまでテンプレ ==================================


int main(int argc, char *argv[]){
    vector<ll> s(6); cin >> s;
    sort(s.begin(), s.end());
    ll sum = accumulate(s.begin()+1, s.end()-1, 0LL);
    ll ans = sum * 100 / 4;
    printf("%ld.%02ld\n", ans/100, ans%100);
    return 0;
}
0