結果

問題 No.810 割った余りの個数
ユーザー shibh308shibh308
提出日時 2019-04-12 21:21:51
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 4,178 bytes
コンパイル時間 2,197 ms
コンパイル使用メモリ 194,984 KB
最終ジャッジ日時 2025-01-07 01:41:27
ジャッジサーバーID
(参考情報)
judge1 / judge6
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
// #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9+7;
const i64 INF = 1e18+7;
// pythonrangeforclass for(const auto& i : Range<>(10))
template <typename T = i64>
struct Range{
struct iterator{
T value;
const T step, last;
const T& operator*(){return value;}
iterator(T value, T step, T last) :
value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
step(step),
last(last)
{
}
iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
bool operator!=(const iterator& x){return value != x.value;}
};
const T start, last, step;
Range(const T start, const T last, const T step = static_cast<T>(1)) :
start(start),
last(last),
step(step)
{
}
Range(const T last) :
start(0),
last(last),
step(1)
{
}
iterator begin(){return iterator(start, step, last);}
iterator end(){return iterator(last, step, last);}
};
// lambda
template <typename F>
struct FixPoint{
const F _f;
FixPoint(F&& f) : _f(forward<F>(f)){}
template<typename... Types>
decltype(auto) operator()(Types&&... args) const{
return _f(*this, forward<Types>(args)...);
}
};
template <typename F>
static decltype(auto) makeRec(F&& f){
return FixPoint<F>(forward<F>(f));
}
// vector makeVector<i64, 0>(a, b, ...)
template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
return vector<T>(x, T(Value));
}
template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}
// true
template <typename T = i64>
bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
//
template <typename T = i64>
bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
// clogprint
#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;
// print
#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);
void _dump(int, string& x){
clog << x << endl;
}
template <typename T>
void _dump(bool, T& x){
clog << x << " ";
}
template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){
for(auto& elm : x)
_dump(0, elm);
clog << endl;
}
template <typename T>
void _dump_macro(T& x){
_dump(0, x);
}
// input
void _input(int, string& x){
cin >> x;
}
template <typename T>
void _input(bool, T& x){
cin >> x;
}
template <typename T, typename U = typename T::iterator>
void _input(int, T& x){
for(auto& elm : x)
_input(0, elm);
}
template <typename T>
void input_single(T& x){
_input(0, x);
}
auto input(){}
template <typename T, typename... Types>
void input(T& value, Types&&... args){
input_single(value);
input(forward<Types>(args)...);
};
void _pararell_input(size_t){}
template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
input(value[index]);
_pararell_input(index, forward<Types>(args)...);
}
template <typename... Types>
void pararell_input(size_t count, Types&&... args){
for(const auto& i : Range<>(count))
_pararell_input(i, forward<Types>(args)...);
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int l, r, m;
input(l, r, m);
cout << min(m, r - l + 1) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0