Pagini recente » Cod sursa (job #2145728) | Cod sursa (job #2548379) | Cod sursa (job #2856278) | Cod sursa (job #2610440) | Cod sursa (job #3304395)
#include <fstream>
using namespace std;
ifstream in("puteri.in");
ofstream out("puteri.out");
int n;
long long ans;
unsigned short frec[129][128][128][128];
int mobius[205];
short rest[129][129];
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;
}
}
int main()
{
in>>n;
build_mobius();
for(int i = 2; i<=128; i++)
{
for(int j = 0; j<=128; j++)
{
rest[i][j] = j % i;
}
}
int a, b, c;
for(int i = 1; i<=n; i++)
{
in>>a>>b>>c;
long long rez = 0;
for(int j = 2; j<=128; j++)
{
int ra = j - rest[j][a];
int rb = j - rest[j][b];
int rc = j - rest[j][c];
if(ra == j)
{
ra = 0;
}
if(rb == j)
{
rb = 0;
}
if(rc == j)
{
rc = 0;
}
rez += 1LL * frec[j][ra][rb][rc] * mobius[j];
//out<<rez<<" ";
}
//out<<'\n';
ans += rez;
for(int j = 2; j<=128; j++)
{
frec[j][rest[j][a]][rest[j][b]][rest[j][c]]++;
}
}
out<<ans;
return 0;
}