제출 #466946

#제출 시각아이디문제언어결과실행 시간메모리
466946XBoRickieSavrsen (COCI17_savrsen)C++11
120 / 120
521 ms81300 KiB
#include <bits/stdc++.h> using namespace std; // Typedef typedef string str; typedef long double ld; typedef long long int int64; typedef unsigned long long int uint64; typedef std::pair<int, int> PII; typedef std::pair<int64, int64> PLL; typedef std::vector<int> VI; typedef std::vector<long long> VLL; // Define For-loop #define FOR(i, j, k, in) for (int i = (j); i < (k) ; i += (in)) #define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in)) #define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in)) // Define Data structure func #define all(cont) cont.begin(), cont.end() #define rall(cont) cont.rbegin(), cont.rend() #define sz(cont) int((cont).size()) #define pb push_back #define mp make_pair #define fi first #define se second // Define number #define IINF 0x3f3f3f3f #define LLINF 1000111000111000111LL #define PI 3.1415926535897932384626433832795 // Other #define lend '\n' #define hardio(name) freopen(name".inp","r",stdin), freopen(name".out","w",stdout); void FastIO() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); cin.exceptions(cin.failbit); srand(time(NULL)); } const int MOD = 1e9 + 7, MOD2 = 1e9 + 9; // ====================================================================== namespace io { const int SIZE = (1 << 20) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr; #define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++) inline void flush() { fwrite (obuf, 1, oS - obuf, stdout); oS = obuf; } // print the remaining part inline void putc(char x) { *oS++ = x; if (oS == oT) flush (); } // putchar template<typename A> inline bool read (A &x) { for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1; else if (c == EOF) return 0; for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f; return 1; } inline bool read(char &x) { while((x = gc()) == ' ' || x == '\n' || x == '\r'); return x != EOF; } inline bool read(string& x) { while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear(); while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1; } template<typename A,typename ...B> inline bool read(A &x, B &...y) { return read(x) + read(y...); } template<typename A> inline bool write(A x) { if (!x) putc('0'); if (x < 0) putc ('-'), x = -x; while (x) qu[++qr] = x % 10 + '0', x /= 10; while (qr) putc(qu[qr--]); return 0; } inline bool write(char x) { putc(x); return 0; } inline bool write(const char *x){ while (*x){ putc(*x); ++x; } return 0; } inline bool write(char *x){ while (*x){ putc(*x); ++x; } return 0; } template<typename A,typename ...B> inline bool write(A x,B ...y){ return write(x) || write(y...); } //no need to call flush at the end manually! struct Flusher_ {~Flusher_(){ flush(); }} io_flusher_; } using io::read; using io::putc; using io::write; int l, r; vector<int> pr; int lp[10000007] = {}; void sieve(int N = sqrt(1e9)) { FORW(i, 2, N, 1) { if (lp[i] == 0) lp[i] = i, pr.pb(i); for(int j = 0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] <= N; ++j) lp[i * pr[j]] = pr[j]; } } int sum[10000007] = {}; int main(int argc, char* argv[]) { FastIO(); read(l, r); sieve(r); FORW(i, l, r, 1) sum[i] = 1; for(int p : pr) { int sm = 1; for(int64 x = p; x <= r; x *= p) { for(int y = x; y <= r; y += x) { sum[y] /= sm; sum[y] *= (sm + x); } sm += x; } } int64 ans = 0; FORW(i, l, r, 1) ans += abs(2ll * i - sum[i]); write(ans); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

savrsen.cpp: In function 'bool io::read(A&)':
savrsen.cpp:43:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   43 |         for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
      |         ^~~
savrsen.cpp:43:76: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   43 |         for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
      |                                                                            ^
savrsen.cpp: In function 'bool io::read(std::string&)':
savrsen.cpp:47:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   47 |         while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear();
      |         ^~~~~
savrsen.cpp:47:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   47 |         while ((c = gc()) == '\n' || c == ' '|| c == '\r'); if (c == EOF) return 0; x.clear();
      |                                                             ^~
savrsen.cpp:48:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   48 |         while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1;
      |         ^~~~~
savrsen.cpp:48:93: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   48 |         while (!(c == '\n' || c == ' ' || c == '\r' || c == EOF)) x.push_back(c), c = gc(); return 1;
      |                                                                                             ^~~~~~
savrsen.cpp: In function 'bool io::write(A)':
savrsen.cpp:53:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   53 |         if (!x) putc('0'); if (x < 0) putc ('-'), x = -x;
      |         ^~
savrsen.cpp:53:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   53 |         if (!x) putc('0'); if (x < 0) putc ('-'), x = -x;
      |                            ^~
savrsen.cpp: In function 'void sieve(int)':
savrsen.cpp:74:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for(int j = 0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] <= N; ++j)
      |                        ~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...