結果
問題 | No.1070 Missing a space |
ユーザー |
|
提出日時 | 2020-06-05 21:50:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 1,000 ms |
コード長 | 4,970 bytes |
コンパイル時間 | 1,764 ms |
コンパイル使用メモリ | 128,472 KB |
実行使用メモリ | 7,364 KB |
最終ジャッジ日時 | 2024-12-17 14:19:04 |
合計ジャッジ時間 | 2,294 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 7 |
コンパイルメッセージ
main.cpp: In member function 'mint& mint::operator/=(mint)': main.cpp:105:64: warning: no return statement in function returning non-void [-Wreturn-type] 105 | mint& operator/=(const mint b) { (*this) *= b.inv(); } | ^ | return *this;
ソースコード
#pragma GCC target ("avx")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#define _USE_MATH_DEFINES#include<iostream>#include<string>#include<queue>#include<cmath>#include<map>#include<set>#include<list>#include<iomanip>#include<vector>#include<random>#include<functional>#include<algorithm>#include<stack>#include<cstdio>#include<cstring>#include<bitset>#include<unordered_map>#include<climits>#include<fstream>#include<complex>#include<time.h>#include<cassert>#include<functional>#include<numeric>#include<tuple>using namespace std;using ll = long long;using ld = long double;//#define int long long#define all(a) (a).begin(),(a).end()#define fs first#define sc second#define xx first#define yy second.first#define zz second.second#define C complex<ld>#define H pair<int, int>#define P pair<int, pair<int, int>>#define Q(i,j,k) mkp(i,mkp(j,k))#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)#define rep(i,n) rng(i, 0, (n))#define mkp make_pair#define vec vector#define vi vec<int>#define pb emplace_back#define siz(a) (int)(a).size()#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())#define getidx(b,i) lower_bound(all(b),(i))-b.begin()#define ssp(i,n) (i==(int)(n)-1?"\n":" ")#define ctoi(c) (int)(c-'0')#define itoc(c) (char)(c+'0')#define cyes printf("Yes\n")#define cno printf("No\n")#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)#define gcj printf("Case #%lld: ",qq123_+1)#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()//#define endl "\n"constexpr int mod = 1e9 + 7;constexpr int Mod = 998244353;constexpr ld EPS = 1e-10;constexpr ll inf = 3 * 1e18;constexpr int Inf = 15 * 1e8;constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }ll read() { ll u, k = scanf("%lld", &u); return u; }string reads() { string s; cin >> s; return s; }H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }bool ina(int t, int l, int r) { return l <= t && t < r; }ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }ll popcount(ll x) {int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;return sum;}class mint {public:int v;mint(int v = 0) { s(v % mod); }constexpr static int mod = 1e5;constexpr static int fn_ = 500005;static mint fact[fn_], comp[fn_];mint pow(mint x) const {mint b(v), c(1);while (x.v) {if (x.v & 1) c *= b;b *= b;x.v >>= 1;}return c;}inline mint& s(int vv) {v = vv < mod ? vv : vv - mod;return *this;}mint inv()const { return pow(mod - 2); }mint operator-()const { return mint() - *this; }mint& operator+=(const mint b) { return s(v + b.v); }mint& operator-=(const mint b) { return s(v + mod - b.v); }mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }mint& operator/=(const mint b) { (*this) *= b.inv(); }mint operator+(const mint b) const { return mint(v) += b; }mint operator-(const mint b) const { return mint(v) -= b; }mint operator*(const mint b) const { return mint(v) *= b; }mint operator/(const mint b) const { return mint(v) /= b; }friend ostream& operator<<(ostream& os, const mint& m) {return os << m.v;}friend istream& operator>>(istream& is, mint& m) {int x; is >> x; m = mint(x);return is;}bool operator<(const mint& r)const { return v < r.v; }bool operator>(const mint& r)const { return v > r.v; }bool operator<=(const mint& r)const { return v <= r.v; }bool operator>=(const mint& r)const { return v >= r.v; }bool operator==(const mint& r)const { return v == r.v; }bool operator!=(const mint& r)const { return v != r.v; }explicit operator bool()const { return v; }explicit operator int()const { return v; }mint comb(mint k) {if (k > * this) return mint();if (!fact[0]) combinit();if (v >= fn_) {if (k > * this - k) k = *this - k;mint tmp(1);for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);return tmp * comp[k.v];}else return fact[v] * comp[k.v] * comp[v - k.v];}//nCkstatic void combinit() {fact[0] = 1;for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);comp[fn_ - 1] = fact[fn_ - 1].inv();for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);}}; mint mint::fact[fn_], mint::comp[fn_];//--------------------------------------------------------------signed main() {string s; cin >> s;int ans = 0;rng(i,1, s.size()) {if (s[i] != '0') ans++;}cout << ans << endl;}