結果

問題 No.1499 羊が、何匹だっけ
ユーザー cumin
提出日時 2021-05-07 21:25:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 10,090 bytes
コンパイル時間 4,084 ms
コンパイル使用メモリ 254,688 KB
最終ジャッジ日時 2025-01-21 07:59:56
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void scanner::scan(char*)’:
main.cpp:112:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  112 | void scan(char a[]) { std::scanf("%s", a); }
      |                       ~~~~~~~~~~^~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#pragma region Macros
// rep macro
#define rep(i, n) for(long long i = 0; i < n; ++i)
#define rep2(i, a, b) for(long long i = a; i <= b; ++i)
#define rep3(i, l, r, c) for(long long i = (l); i < (r); i += (c))
#define rrep(i, a, b) for(long long i = a; i >= b; --i)
// name macro
#define pb push_back
#define eb emplace_back
#define SZ(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int> using V = std::vector<T>;
template <class T = int> using VV = std::vector<std::vector<T>>;
template <class T> using pq = std::priority_queue<T>;
template <class T> using pqg = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pdd = std::pair<double, double>;
using pll = pair<ll, ll>;
using pld = pair<ld,ld>;
#define fi first
#define se second
#define mt make_tuple
#define SUM(v) accumulate(all(v), 0ll) 
#define MAX(v) *max_element(all(v)) 
#define MIN(v) *min_element(all(v)) 
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define vi vector<int>
#define vd vector<double>
#define vll vector<long long>
#define vld vector<ld>
#define vpii vector<pii>
#define vpdd vector<pdd>
#define vpll vector<pll>
#define vpld vector<pld>
#define vc vector<char>
#define vvc vector<vector<char>
#define vs vector<string>
// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
    for(T &i : v) is >> i;
    return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
    std::string s;
    is >> s;
    __int128_t ret = 0;
    for(int i = 0; i < s.length(); i++)
        if('0' <= s[i] and s[i] <= '9')
            ret = 10 * ret + s[i] - '0';
    a = ret * (s[0] == '-' ? -1 : 1);
    return is;
}
#if __has_include(<atcoder/all>)
std::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {
    long long v;
    is >> v;
    a = v;
    return is;
}
std::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {
    long long v;
    is >> v;
    a = v;
    return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {
    long long v;
    is >> v;
    a = v;
    return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {
    long long v;
    is >> v;
    a = v;
    return is;
}
#endif
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
    scan(head);
    INPUT(tail...);
}
}  // namespace scanner
#define VEC(type, name, size)     \
    std::vector<type> name(size); \
    scanner::INPUT(name)
#define VVEC(type, name, h, w)                                    \
    std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
    scanner::INPUT(name)
#define INT(...)     \
    int __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define LL(...)            \
    long long __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define STR(...)             \
    std::string __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define CHAR(...)     \
    char __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
    double __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define LD(...)              \
    long double __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
    for(int i = 0; i < int(a.size()); ++i) {
        if(i) os << " ";
        os << a[i];
    }
    return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
    std::ostream::sentry s(dest);
    if(s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while(tmp != 0);
        if(value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if(dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
#if __has_include(<atcoder/all>)
std::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }
std::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }
#endif
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
    std::cout << H << ' ';
    print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
    for(const auto &v : a)
        std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
    std::cout << H << '\n';
    printel(T...);
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
inline void OKNG(bool b = true) { cout << (b ? "OK" : "NG") << '\n'; }
inline void possible(bool i = true){ cout << (i?"possible":"impossible") << '\n'; }
inline void Possible(bool i = true){ cout << (i?"Possible":"Impossible") << '\n'; }
inline void POSSIBLE(bool i = true){ cout << (i?"POSSIBLE":"IMPOSSIBLE") << '\n'; }
void err(const bool b = true) {
    if(b) {
        std::cout << "-1\n", exit(0);
    }
}
//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
    std::cerr << "{ ";
    for(const auto &v : a) {
        std::cerr << v << ", ";
    }
    std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
    std::cerr << "{\n";
    for(const auto &v : a) {
        std::cerr << "\t";
        view(v);
        std::cerr << "\n";
    }
    std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
    std::cerr << "{\n";
    for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
    std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
    std::cerr << "{\n";
    for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
    std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
    std::cerr << "{ ";
    for(auto &v : s) {
        view(v);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
 
template <class T>
void view(const T &e) { std::cerr << e; }
}  // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    debugger::view(H);
    std::cerr << ", ";
    debug_out(T...);
}
#define debug(...)                                                \
    do {                                                          \
        std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
        debug_out(__VA_ARGS__);                                   \
        std::cerr << "\b\b]\n";                                   \
    } while(false)
#else
#define debug(...) (void(0))
#endif
// math macro
template <class T, class U> inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U> inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T> //切り捨て
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) { //切り上げ
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class T>
T POW(T a, long long n) {
    T ret = 1;
    while(n) {
        if(n & 1) ret *= a;
        a *= a;
        n >>= 1;
    }
    return ret;
}
// modpow
long long POW(long long a, long long n, const int mod) {
    long long ret = 1;
    while(n) {
        if(n & 1) (ret *= a) %= mod;
        (a *= a) %= mod;
        n >>= 1;
    }
    return ret;
}
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
ll allbit(ll n) { return (1LL << n) - 1; }
bool ispow2(int i) { return i && (i & -i) == i; }
// others
struct fast_io {
    fast_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} fast_io_;
#define endl '\n'
#pragma endregion
int dy[8] = {0,1,0,-1,-1,1,1,-1};
int dx[8] = {1,0,-1,0,1,1,-1,-1};
bool range(int y, int x, int h, int w){
  if(y < 0 || x < 0 || y >= h || x >= w) return false;
  else return true;
}
//const int MOD=1000000007;
const int MOD=998244353;
//using mint = modint1000000007;
//using mint = modint998244353;
const ll INF=1e18+1;
const int inf = 1000000001;
//const ll INF = numeric_limits<ll>::max() / 4;
//const int inf = numeric_limits<int>::max() / 4;
const int M = 510000;
const int MAX = 1000010;
const double PI=acos(-1);
void main_() {
  string s, t ,u;
  int n;
  cin >> s >> t >> n >> u;
  cout << s << " " << t << " " << n+1 << " "<< u << endl;
}
int main() {
  int T;
  cin >> T;
  while(T--) main_();
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0