Cod sursa(job #3273019)
| Utilizator | Data | 1 februarie 2025 09:04:55 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | cex_8 | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("fractii.in") ;
ofstream fout ("fractii.out") ;
long long n , i , j , a[1000001] ;
long long sum , nr = 1 ;
int main()
{
fin >> n ;
for ( i = 2 ; i <= n ; i ++ )
{
if ( a[i] == 0 )
{
for ( int j = i ; j <= n ; j += i )
a[j] += j / i - 1 ;
}
a[i] ++ ;
}
for ( i = 2 ; i <= n ; i ++ )
sum += 2 * a[i] - 1 ;
nr = n * n ;
cout << nr << " " << sum ;
fout << nr - sum ;
return 0;
}
