Pagini recente » Cod sursa (job #2843544) | Istoria paginii utilizator/kitchen987 | Clasament preONI 2007, Runda 2, Clasa a 9-a si gimnaziu | Autentificare | Cod sursa (job #2848832)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define dbg(i) (cout<<#i<<" = "<<(i)<<'\n')
using ll = long long;
const string fn = "mins";
// ifstream fin(fn + ".in");
// ofstream fout(fn + ".out");
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
InParser fin("mins.in");
OutParser fout("mins.out");
int c, d;
int cnt[1000005];
ll sol, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
// fin.tie();
fin >> c >> d;
c--; d--;
if (d < c)
swap(c, d);
for(int k = 2; k <= c; ++k){
if(cnt[k]==1)
continue;
int balance = 1 - cnt[k];
sol += 1LL * balance * (c/k) * (d / k);
for(int mult = k + k; mult <= c; mult += k)
cnt[mult] = cnt[mult] + balance;
}
ans = 1LL * c * d;
ans = ans - sol;
fout << ans << '\n';
// fin.close();
// fout.close();
return 0;
}