結果
問題 | No.1903 Day1 |
ユーザー |
|
提出日時 | 2022-04-15 21:22:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 1,000 ms |
コード長 | 3,515 bytes |
コンパイル時間 | 3,523 ms |
コンパイル使用メモリ | 220,616 KB |
最終ジャッジ日時 | 2025-01-28 17:49:28 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 8 |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")#include <bits/stdc++.h>//#include <atcoder/all>//using namespace atcoder;//#include <bits/extc++.h>//#include <ext/pb_ds/assoc_container.hpp>//#include <ext/pb_ds/tree_policy.hpp>//#include <ext/pb_ds/priority_queue.hpp>#define fi first#define se secondusing namespace std;//using namespace __gnu_pbds;typedef long long ll;typedef unsigned long long ull;typedef double db;typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef pair<db,db> pdb;typedef tuple<int,int,int> tii;typedef tuple<db,db,db> tdb;typedef tuple<ll,ll,ll> tll;typedef tuple<int,int,int,int> ti4;typedef tuple<ll,ll,ll,ll> tl4;typedef tuple<db,db,db,db> td4;//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //shuffle(a+1,a+1+n,rng)uniform_int_distribution<> gen(1,100); //gen(rng)ll modinv(ll a,ll m){if(m==1) return 0;a%=m;if(a<0) a+=m;if(a==1) return 1;return m-modinv(m,a)*m/a;}template <int MOD_> struct modnum{private:int v;public:static const int MOD = MOD_;modnum() : v(0) {}modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }explicit operator int () const { return v; }friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }friend bool operator < (const modnum& a, const modnum& b) { return a.v < b.v; }friend bool operator <= (const modnum& a, const modnum& b) { return a.v <= b.v; }friend bool operator > (const modnum& a, const modnum& b) { return a.v > b.v; }friend bool operator >= (const modnum& a, const modnum& b) { return a.v >= b.v; }modnum operator ~ () const {modnum res;res.v = modinv(v, MOD);return res;}modnum& operator += (const modnum& o) {v += o.v;if (v >= MOD) v -= MOD;return *this;}modnum& operator -= (const modnum& o) {v -= o.v;if (v < 0) v += MOD;return *this;}modnum& operator *= (const modnum& o) {v = int(ll(v) * ll(o.v) % MOD);return *this;}modnum& operator /= (const modnum& o) {return *this *= (~o);}modnum operator-() const { return modnum(-v); }modnum& operator++() { return *this += 1; }modnum operator++(int){ modnum tmp=*this; ++*this; return tmp; }modnum& operator--() { return *this -= 1; }modnum operator--(int){ modnum tmp=*this; --*this; return tmp; }friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }friend modnum pow(modnum a, ll p) {modnum ans = 1;for (; p; p /= 2, a *= a) if (p&1) ans *= a;return ans;}friend ostream& operator<<(std::ostream& os, const modnum& o){os << o.v;return os;}friend istream& operator>>(std::istream& is, modnum& o){is >> o.v;return is;}};using mi=modnum<1000000007>;const int N=3e7+5,M=1005,Q=1e6+5;const ll mod=1000000007,inf=1e18;int n,i;int main(){ios::sync_with_stdio(false); cin.tie(0);cin>>n;for(i=1;n;i++){if(i%7==0) n+=6;n--;}cout<<i-1;return 0;}