0

杨高2026dly LV 6 @ 2026-8-13 14:34:59

#include using namespace std;

int main() { bool a = 1; long long fukhkhkhkhkhkkhkh = 67; if (a == 1 && fukhkhkhkhkhkkhkh == 67) { cout << "hello world"; }

return 0;

}

0

杨高2026dly LV 6 @ 2026-8-13 9:32:59

0

杨高2026dly LV 6 @ 2026-8-11 10:24:00

typename _Size, typename _UniformRandomBitGenerator> _RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator ___out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; __distrib_type __d{}; _Size __sample_sz = 0; while (__first != __last && __sample_sz != __n) { ___out[__sample_sz++] = *__first; ++__first; } for (auto __pop_sz = __sample_sz; __first != __last; ++__first, (void) ++__pop_sz) { const auto __k = __d(__g, __param_type{0, __pop_sz}); if (__k < __n) ___out[__k] = *__first; } return ___out + __sample_sz; }

/// Selection sampling algorithm. template<typename _ForwardIterator, typename _OutputIterator, typename _Cat, typename _Size, typename _UniformRandomBitGenerator> _OutputIterator __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator ___out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; using _USize = make_unsigned_t<_Size>; using _Gen = remove_reference_t<_UniformRandomBitGenerator>; using __uc_type = common_type_t<typename _Gen::result_type, _USize>;

  __distrib_type __d{};
  _Size __unsampled_sz = std::distance(__first, __last);
  __n = std::min(__n, __unsampled_sz);

  // If possible, we use __gen_two_uniform_ints to efficiently produce
  // two random numbers using a single distribution invocation:

  const __uc_type __urngrange = __g.max() - __g.min();
  if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
    // I.e. (__urngrange >= __unsampled_sz * __unsampled_sz) but without
// wrapping issues.
    {
  while (__n != 0 && __unsampled_sz >= 2)
    {
      const pair<_Size, _Size> __p =
	__gen_two_uniform_ints(__unsampled_sz, __unsampled_sz - 1, __g);

      --__unsampled_sz;
      if (__p.first < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;

      if (__n == 0) break;

      --__unsampled_sz;
      if (__p.second < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;
    }
    }

  // The loop above is otherwise equivalent to this one-at-a-time version:

  for (; __n != 0; ++__first)
if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
  {
    *___out++ = *__first;
    --__n;
  }
  return ___out;
}

#if __cplusplus > 201402L #define __cpp_lib_sample 201603 /// Take a random sample from a population. template<typename _PopulationIterator, typename _SampleIterator, typename _Distance, typename _UniformRandomBitGenerator> _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator ___out, _Distance __n, _UniformRandomBitGenerator&& __g) { using __pop_cat = typename std::iterator_traits<_PopulationIterator>::iterator_category; using __samp_cat = typename std::iterator_traits<_SampleIterator>::iterator_category;

  static_assert(
  __or_<is_convertible<__pop_cat, forward_iterator_tag>,
	is_convertible<__samp_cat, random_access_iterator_tag>>::value,
  "output range must use a RandomAccessIterator when input range"
  " does not meet the ForwardIterator requirements");

  static_assert(is_integral<_Distance>::value,
	    "sample size must be an integer type");

  typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
  return _GLIBCXX_STD_A::
__sample(__first, __last, __pop_cat{}, ___out, __samp_cat{}, __d,
	 std::forward<_UniformRandomBitGenerator>(__g));
}

#endif // C++17 #endif // C++14

_GLIBCXX_END_NAMESPACE_ALGO _GLIBCXX_END_NAMESPACE_VERSION } // namespace std

#endif /* _STL_ALGO_H */

0

杨高2026dly LV 6 @ 2026-8-11 10:23:52

typename _Size, typename _UniformRandomBitGenerator> _RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator ___out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; __distrib_type __d{}; _Size __sample_sz = 0; while (__first != __last && __sample_sz != __n) { ___out[__sample_sz++] = *__first; ++__first; } for (auto __pop_sz = __sample_sz; __first != __last; ++__first, (void) ++__pop_sz) { const auto __k = __d(__g, __param_type{0, __pop_sz}); if (__k < __n) ___out[__k] = *__first; } return ___out + __sample_sz; }

/// Selection sampling algorithm. template<typename _ForwardIterator, typename _OutputIterator, typename _Cat, typename _Size, typename _UniformRandomBitGenerator> _OutputIterator __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator ___out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; using _USize = make_unsigned_t<_Size>; using _Gen = remove_reference_t<_UniformRandomBitGenerator>; using __uc_type = common_type_t<typename _Gen::result_type, _USize>;

  __distrib_type __d{};
  _Size __unsampled_sz = std::distance(__first, __last);
  __n = std::min(__n, __unsampled_sz);

  // If possible, we use __gen_two_uniform_ints to efficiently produce
  // two random numbers using a single distribution invocation:

  const __uc_type __urngrange = __g.max() - __g.min();
  if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
    // I.e. (__urngrange >= __unsampled_sz * __unsampled_sz) but without
// wrapping issues.
    {
  while (__n != 0 && __unsampled_sz >= 2)
    {
      const pair<_Size, _Size> __p =
	__gen_two_uniform_ints(__unsampled_sz, __unsampled_sz - 1, __g);

      --__unsampled_sz;
      if (__p.first < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;

      if (__n == 0) break;

      --__unsampled_sz;
      if (__p.second < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;
    }
    }

  // The loop above is otherwise equivalent to this one-at-a-time version:

  for (; __n != 0; ++__first)
if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
  {
    *___out++ = *__first;
    --__n;
  }
  return ___out;
}

#if __cplusplus > 201402L #define __cpp_lib_sample 201603 /// Take a random sample from a population. template<typename _PopulationIterator, typename _SampleIterator, typename _Distance, typename _UniformRandomBitGenerator> _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator ___out, _Distance __n, _UniformRandomBitGenerator&& __g) { using __pop_cat = typename std::iterator_traits<_PopulationIterator>::iterator_category; using __samp_cat = typename std::iterator_traits<_SampleIterator>::iterator_category;

  static_assert(
  __or_<is_convertible<__pop_cat, forward_iterator_tag>,
	is_convertible<__samp_cat, random_access_iterator_tag>>::value,
  "output range must use a RandomAccessIterator when input range"
  " does not meet the ForwardIterator requirements");

  static_assert(is_integral<_Distance>::value,
	    "sample size must be an integer type");

  typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
  return _GLIBCXX_STD_A::
__sample(__first, __last, __pop_cat{}, ___out, __samp_cat{}, __d,
	 std::forward<_UniformRandomBitGenerator>(__g));
}

#endif // C++17 #endif // C++14

_GLIBCXX_END_NAMESPACE_ALGO _GLIBCXX_END_NAMESPACE_VERSION } // namespace std

#endif /* _STL_ALGO_H */

0

杨高2026dly LV 6 @ 2026-8-11 10:20:38

typename _Size, typename _UniformRandomBitGenerator> _RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator ___out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; __distrib_type __d{}; _Size __sample_sz = 0; while (__first != __last && __sample_sz != __n) { ___out[__sample_sz++] = *__first; ++__first; } for (auto __pop_sz = __sample_sz; __first != __last; ++__first, (void) ++__pop_sz) { const auto __k = __d(__g, __param_type{0, __pop_sz}); if (__k < __n) ___out[__k] = *__first; } return ___out + __sample_sz; }

/// Selection sampling algorithm. template<typename _ForwardIterator, typename _OutputIterator, typename _Cat, typename _Size, typename _UniformRandomBitGenerator> _OutputIterator __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator ___out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) { using __distrib_type = uniform_int_distribution<_Size>; using __param_type = typename __distrib_type::param_type; using _USize = make_unsigned_t<_Size>; using _Gen = remove_reference_t<_UniformRandomBitGenerator>; using __uc_type = common_type_t<typename _Gen::result_type, _USize>;

  __distrib_type __d{};
  _Size __unsampled_sz = std::distance(__first, __last);
  __n = std::min(__n, __unsampled_sz);

  // If possible, we use __gen_two_uniform_ints to efficiently produce
  // two random numbers using a single distribution invocation:

  const __uc_type __urngrange = __g.max() - __g.min();
  if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
    // I.e. (__urngrange >= __unsampled_sz * __unsampled_sz) but without
// wrapping issues.
    {
  while (__n != 0 && __unsampled_sz >= 2)
    {
      const pair<_Size, _Size> __p =
	__gen_two_uniform_ints(__unsampled_sz, __unsampled_sz - 1, __g);

      --__unsampled_sz;
      if (__p.first < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;

      if (__n == 0) break;

      --__unsampled_sz;
      if (__p.second < __n)
	{
	  *___out++ = *__first;
	  --__n;
	}

      ++__first;
    }
    }

  // The loop above is otherwise equivalent to this one-at-a-time version:

  for (; __n != 0; ++__first)
if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
  {
    *___out++ = *__first;
    --__n;
  }
  return ___out;
}

#if __cplusplus > 201402L #define __cpp_lib_sample 201603 /// Take a random sample from a population. template<typename _PopulationIterator, typename _SampleIterator, typename _Distance, typename _UniformRandomBitGenerator> _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator ___out, _Distance __n, _UniformRandomBitGenerator&& __g) { using __pop_cat = typename std::iterator_traits<_PopulationIterator>::iterator_category; using __samp_cat = typename std::iterator_traits<_SampleIterator>::iterator_category;

  static_assert(
  __or_<is_convertible<__pop_cat, forward_iterator_tag>,
	is_convertible<__samp_cat, random_access_iterator_tag>>::value,
  "output range must use a RandomAccessIterator when input range"
  " does not meet the ForwardIterator requirements");

  static_assert(is_integral<_Distance>::value,
	    "sample size must be an integer type");

  typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
  return _GLIBCXX_STD_A::
__sample(__first, __last, __pop_cat{}, ___out, __samp_cat{}, __d,
	 std::forward<_UniformRandomBitGenerator>(__g));
}

#endif // C++17 #endif // C++14

_GLIBCXX_END_NAMESPACE_ALGO _GLIBCXX_END_NAMESPACE_VERSION } // namespace std

#endif /* _STL_ALGO_H */

0

杨高2026dly LV 6 @ 2026-8-11 9:47:02

676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767676767

0

杨高2026dly LV 6 @ 2026-8-11 9:45:53

0

杨高2026dly LV 6 @ 2026-8-11 9:44:46

0

李泽凯 LV 7 @ 2026-8-11 9:42:58

vv vvvvv vv v v v v vvvv vvvvvvvv v v v v vvvvv v vvvvvvvvvvvv v vv vvvvv vvvvvv v vvvvv vvv vvvvvv vv

0

黄腾钰xz LV 7 @ 2026-7-30 15:29:04

#include <bits/stdc++.h>
using namespace std;

int main() {
	cout << "Hello,World!";
	return 0;
}

0

黄也洛 LV 7 @ 2026-7-15 21:15:05

#include <bits/stdc++.h> using namespace std; int main() { cout<<"Hello,World!"; return 0; } //上面的代码一看就是ai代码，抄了太明显了，下面的才正常 #include <bits/stdc++.h> using namespace std;

struct stu { string name; int qm, bj, lw, ws; char gb, xb; } a[110]; int n, ans = 0;

bool cmp(stu x, stu y) { return x.ws > y.ws; } int gao = 0; string maxname;

int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i].name >> a[i].qm >> a[i].bj >> a[i].gb >> a[i].xb >> a[i].lw; a[i].ws = 0; } for (int i = 0; i < n; i++) { int cur = 0; if (a[i].qm > 80 && a[i].lw >= 1) { cur = cur + 8000; } if (a[i].qm > 85 && a[i].bj > 80) { cur = cur + 4000; } if (a[i].qm > 90) { cur = cur + 2000; } if (a[i].qm > 85 && a[i].xb == 'Y') { cur = cur + 1000; } if (a[i].bj > 80 && a[i].gb == 'Y') { cur = cur + 850; } a[i].ws = cur; ans = ans + a[i].ws; if (a[i].ws > gao) { gao = a[i].ws; maxname = a[i].name; } } cout << maxname << endl; cout << gao << endl; cout << ans; return 0; }

白士毅 @ 2026-8-21 16:36:14

-1

李豪 LV 6 @ 2026-8-14 15:24:34

wonder of you

白士毅 @ 2026-8-21 16:39:04

-1

李豪 LV 6 @ 2026-8-14 15:23:31

看我黑客搭路

-1

李豪 LV 6 @ 2026-8-14 15:21:21

泥肘！

白士毅 @ 2026-8-21 16:39:35

-1

李豪 LV 6 @ 2026-8-14 14:58:08

hello,I am verity.

-1

李豪 LV 6 @ 2026-8-14 14:12:58

§☽△▽▓☹☺♀☀※∷•▪‥…♧♣♥§ ♉™☍☋念慈◈♒†☵☳☠✪﹣✪ ÀÞÞΓÈ ΙŠ νεξγ ζοοθ. ㄚㄇㄊㄌㄙ龘鑫淼焱龑嫑氼勥巭嘦曱曱〢〣〤〥〦〩𡿨ㄋがぎをりゆ゜ヤユリヲギジゑゅぃぅャュィピプのねぬつ ㅏㅑㅓㅕㅗㅚㅁㄹㅙㄷㄲㄸㅂㅟㅟㅅ㉮ АЪГЕ ПР ЧВДЕ ЫПОДП

-1

商竣杰2026dly LV 6 @ 2026-1-28 15:19:33

很简单好吧： #include using namespace std; int main() { cout<<"Hello,World!"; return 0; }

-3

孙道庸2026dly LV 6 @ 2026-2-1 9:15:46

#include<bits/stdc++.h>; using namespace std; int main() { cout<<"Hello,World!"; return 0; }

-6

孙道庸2026dly LV 6 @ 2026-2-1 9:16:38

#include <bits/stdc++.h> using namespace std;

int main() { cout << "Hello,World!"; return 0; }

-6

team13 LV 1 @ 2025-8-22 12:37:13

44 条题解

?

Hello,World!

信息

44 条题解

?

Hello,World!

信息

登录