結果
問題 | No.276 連続する整数の和(1) |
ユーザー |
![]() |
提出日時 | 2018-12-15 01:09:13 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,201 bytes |
コンパイル時間 | 1,539 ms |
コンパイル使用メモリ | 163,848 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-25 05:39:03 |
合計ジャッジ時間 | 2,236 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
#include <cassert>#include <cctype>#include <cerrno>#include <cfloat>#include <ciso646>#include <climits>#include <clocale>#include <cmath>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>#include <ccomplex>#include <cfenv>#include <cinttypes>#include <cstdbool>#include <cstdint>#include <ctgmath>#include <cwchar>#include <cwctype>// C++#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <array>#include <atomic>#include <chrono>#include <condition_variable>#include <forward_list>#include <future>#include <initializer_list>#include <mutex>#include <random>#include <ratio>#include <regex>#include <scoped_allocator>#include <system_error>#include <thread>#include <tuple>#include <typeindex>#include <type_traits>#include <unordered_map>#include <unordered_set>//#include <boost/foreach.hpp>//#include <boost/range/algorithm.hpp>#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)#define ll long long#define Sort(v) sort(all(v))#define INF 1000000000#define END return 0#define pb push_back#define se second#define fi first#define pb push_back#define all(v) (v).begin() , (v).end()#define MP make_pair#define MOD 1000000007LLusing namespace std;int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};struct P{int x,y;};int main (){int n;cin>>n;if(n==1)cout<<1<<endl;else if(n%2==0)cout<<n/2<<endl;else cout<<n<<endl;}/*1:12:n+(n-1)=2n-13:(n-1)+n+(n+1)=3n4:(n-2)+(n-1)+n+(n+1)=4n-2=2(2n-1)5: 4n-2+n+2=5n6: 5n+n+3=6n+3=3(2n+1)even:x/2odd:xcorner 1*/