Submission #32011505


Source Code Expand

Copy
//g++ -std=c++17 -Wl,--stack,268435456 Ahoyy.cpp -o Ahoyy.exe
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pb push_back
#define fi first
#define se second
#define UP(a,b,c) for(ll (a)=(b);(a)<(c);++(a))
#define UU(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))
#define DN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))
#define DU(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))
#define lc(i) i+1
#define rc(i) i+(m-l+1)*2
#include <ext/pb_ds/assoc_container.hpp>
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
//g++ -std=c++17 -Wl,--stack,268435456 Ahoyy.cpp -o Ahoyy.exe

#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pb push_back
#define fi first
#define se second
#define UP(a,b,c) for(ll (a)=(b);(a)<(c);++(a))
#define UU(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))
#define DN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))
#define DU(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))
#define lc(i) i+1
#define rc(i) i+(m-l+1)*2

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll expo(ll a, ll b, ll mod) {
	if(b == 0) return 1;
	if(b == 1) return a % mod;
	ll ret = expo(a, b>>1, mod);
	ret *= ret;
	if(ret >= mod) ret %= mod;
	if(b & 1) {
		ret *= a;
		if(ret >= mod) ret %= mod;
	}
	return ret;
}

ll inv(ll v, ll mod) {
	return expo(v, mod - 2, mod);
}


ll n, a, b;

/*
sn = (2a + (n - 1)b) * n / 2

*/

void reset() {
}

void input() {
	cin >> n >> a >> b;
	ll ab = a / __gcd(a, b) * b;

	ll na = n / a;
	ll nb = n / b;
	ll nab = n / ab;

	ll ans = n * (n + 1) / 2;
	ans -= na * (2 * a + (na - 1) * a) / 2;
	ans -= nb * (2 * b + (nb - 1) * b) / 2;
	ans += nab * (2 * ab + (nab - 1) * ab) / 2;

	cout << ans << endl;
}

void solve() {
}

void Ahoy() {
	solve();
}

int main() {
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	// freopen("in.txt", "r", stdin);

	int TC = 1;
	// cin >> TC;
	UU(t, 1, TC) {
		// cout << "Case #" << t << ": ";
		input();
		Ahoy();
		reset();
	}

	return 0;
}

Submission Info

Submission Time
Task D - FizzBuzz Sum Hard
User kresna
Language C++ (GCC 9.2.1)
Score 400
Code Size 1870 Byte
Status AC
Exec Time 5 ms
Memory 3604 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:26: warning: unnecessary parentheses in declaration of ‘t’ [-Wparentheses]
   15 | #define UU(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))
      |                          ^
./Main.cpp:87:2: note: in expansion of macro ‘UU’
   87 |  UU(t, 1, TC) {
      |  ^~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 20
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 02_max_01.txt, 02_max_02.txt, 02_max_03.txt, 02_max_04.txt, 02_max_05.txt, 02_max_06.txt, 02_max_07.txt, 02_max_08.txt, 02_max_09.txt, 02_max_10.txt, 02_max_11.txt, 02_max_12.txt, 02_max_13.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 5 ms 3508 KB
00_sample_02.txt AC 2 ms 3508 KB
01_random_01.txt AC 2 ms 3572 KB
01_random_02.txt AC 2 ms 3492 KB
01_random_03.txt AC 2 ms 3428 KB
01_random_04.txt AC 2 ms 3492 KB
01_random_05.txt AC 2 ms 3604 KB
02_max_01.txt AC 2 ms 3488 KB
02_max_02.txt AC 3 ms 3600 KB
02_max_03.txt AC 3 ms 3508 KB
02_max_04.txt AC 2 ms 3508 KB
02_max_05.txt AC 2 ms 3576 KB
02_max_06.txt AC 3 ms 3576 KB
02_max_07.txt AC 2 ms 3444 KB
02_max_08.txt AC 3 ms 3576 KB
02_max_09.txt AC 3 ms 3484 KB
02_max_10.txt AC 2 ms 3552 KB
02_max_11.txt AC 3 ms 3468 KB
02_max_12.txt AC 2 ms 3540 KB
02_max_13.txt AC 2 ms 3556 KB


2025-02-28 (Fri)
05:14:02 +00:00