Submission #3196106

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = (B-1); I >= (A); --I)
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;

ll divisor_sum(ll x){
	ll ans = 1;
	ll p = x;
	for(ll i=2;i<sqrt(p)+1;++i){
		ll kake = 1;
		ll tasi = 1;
		while(x%i==0){
			kake += tasi*i;
			x/=i;
			tasi*=i;
		}
		ans *= kake;
	}
	if(ans!=1)return ans*(x+1);
	else return p;
}


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << 52 << endl;
}

Submission Info

Judge Result