Submission #466895

#	Time	Username	Problem	Language	Result	Execution time	Memory
466895		LptN21	Savrsen (COCI17_savrsen)	C++14	120 / 120	1350 ms	39412 KiB

savrsen

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define PI acos(-1.0)
#define FF first
#define SS second
// vector
#define pb push_back
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define lb lower_bound
#define ub upper_bound
// bit
#define CNTBIT(x) __builtin_popcount(x)
#define ODDBIT(x) __builtin_parity(x)
#define MASK(i) (1<<(i))
#define BIT(x, i) (((x)>>(i))&1)
#define SUBSET(big, small) (((big)&(small))==(small))
// typedef
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
/* CODE BELOW */
const int N=1e7+7, M=20;
const int MOD=1e9+7;
const int oo=1e9+7;

int n, m, k, t;

int p[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d%d", &n, &m); n--;
    ll ans=0;
    for(int i=1;i<=m;i++) {
        for(int j=(n/i+1)*i;j<=m;j+=i) p[j]+=i;
        if(p[i]) ans+=abs(2*i-p[i]);
    }
    printf("%lld", ans);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special/edge cases (n=1?)
    - do smth instead of nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message (stderr)

savrsen.cpp: In function 'int main()':
savrsen.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d%d", &n, &m); n--;
      |     ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 120 / 120