Pagini recente » Cod sursa (job #246037) | Cod sursa (job #2857788) | Monitorul de evaluare | Cod sursa (job #3356310) | Cod sursa (job #3304405)
#include <fstream>
using namespace std;
#define int long long
struct el
{
int a, b, c;
};
ifstream in("puteri.in");
ofstream out("puteri.out");
int n;
int ans;
el v[100005];
int frec[130][130][130];
int mobius[205];
int rest[130][130];
void build_mobius()
{
mobius[1] = -1;
for(int i = 1; i<=128; i++)
{
if(mobius[i])
{
mobius[i] = -mobius[i];
for(int j = 2 * i; j<=128; j += i)
{
mobius[j] += mobius[i];
}
}
}
for(int i = 1; i<=128; i++)
{
mobius[i] *= -1;
}
}
signed main()
{
in>>n;
build_mobius();
for(int i = 0; i<=128; i++)
{
for(int j = 2; j<=128; j++)
{
rest[i][j] = i % j;
}
}
for(int i = 1; i<=n; i++)
{
in>>v[i].a>>v[i].b>>v[i].c;
}
for(int i = 2; i<=128; i++)
{
for(int j = 1; j<=n; j++)
{
frec[rest[v[j].a][i]][rest[v[j].b][i]][rest[v[j].c][i]]++;
}
int sum = 0;
int sumcomb = 0;
for(int a = 0; a<=min(64LL, i - 1); a++)
{
for(int b = 0; b<=min(64LL, i - 1); b++)
{
for(int c = 0; c<=min(64LL, i - 1); c++)
{
int ra = i - a;
int rb = i - b;
int rc = i - c;
if(ra == i) ra = 0;
if(rb == i) rb = 0;
if(rc == i) rc = 0;
int f1 = frec[a][b][c];
int f2 = frec[ra][rb][rc];
if(a == ra && b == rb && c == rc)
{
sumcomb += (f1 * (f1 - 1)) / 2;
}
else
{
sum += f1 * f2;
}
}
}
}
int rez = sum / 2 + sumcomb;
ans += rez * mobius[i];
//out<<i<<" -> "<<rez<<'\n';
for(int j = 1; j<=n; j++)
{
frec[rest[v[j].a][i]][rest[v[j].b][i]][rest[v[j].c][i]]--;
}
}
out<<ans;
return 0;
}