Rezumat problemă

Nr_Div_Huge

#3522

Se dau N perechi de numere n k. Pentru fiecare pereche să se calculeze numărul de divizori al lui \(P = {k}^{n} \cdot \left(1 + 2 + 3 + \cdots + k \right) \).

Fișiere Lorintz Alexandru (Alex_tz307) Alexandru Lorintz dificilă

Clasa 9 Tablouri unidimensionale (vectori) Probleme diverse Descompunere in factori Numararea divizorilor Eratostene

Rezolvă

Detalii

Problema	Nr_Div_Huge	Operații I/O	nr_div_huge.in/nr_div_huge.out
Limita timp	0.2 secunde	Limita memorie	Total: 0.1 MB / Stivă 0.1 MB
Id soluție	#56265502	Utilizator	Ene Dumitru (ed)
Fișier	nr_div_huge.cpp	Dimensiune	3.21 KB
Data încărcării	12 Februarie 2025, 09:07	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

nr_div_huge.cpp:1:1: error: 'include' does not name a type
 include <bits/stdc++.h>

 ^
nr_div_huge.cpp:5:1: error: 'ifstream' does not name a type
 ifstream f ("nr_div_huge.in");

 ^
nr_div_huge.cpp:6:1: error: 'ofstream' does not name a type
 ofstream g ("nr_div_huge.out");

 ^
nr_div_huge.cpp:8:1: error: 'bitset' does not name a type
 bitset < 31630 > ciur;

 ^
nr_div_huge.cpp:9:1: error: 'vector' does not name a type
 vector < ull > prime;

 ^
nr_div_huge.cpp: In function 'void Precalculare()':
nr_div_huge.cpp:12:9: error: 'ciur' was not declared in this scope
     if (ciur[i] == 0)

         ^
nr_div_huge.cpp:15:45: error: 'ciur' was not declared in this scope
     for (ull i = 3; i <= 31625; i += 2) if (ciur[i] == 0) prime.emplace_back (i), nrp ++;

                                             ^
nr_div_huge.cpp:15:59: error: 'prime' was not declared in this scope
     for (ull i = 3; i <= 31625; i += 2) if (ciur[i] == 0) prime.emplace_back (i), nrp ++;

                                                           ^
nr_div_huge.cpp: In function 'long long unsigned int nrdivkn(long long unsigned int)':
nr_div_huge.cpp:25:28: error: 'prime' was not declared in this scope
     for (d = 0; d < nrp && prime[d] * prime[d] <= N; ++d) {

                            ^
nr_div_huge.cpp: In function 'long long unsigned int nrdivk1(long long unsigned int)':
nr_div_huge.cpp:49:28: error: 'prime' was not declared in this scope
     for (d = 0; d < nrp && prime[d] * prime[d] <= N; ++d) {

                            ^
nr_div_huge.cpp: In function 'long long unsigned int nrdivkn_2(long long unsigned int)':
nr_div_huge.cpp:68:28: error: 'prime' was not declared in this scope
     for (d = 0; d < nrp && prime[d] * prime[d] <= N; ++d) {

                            ^
nr_div_huge.cpp: In function 'long long unsigned int nrdivk1_2(long long unsigned int)':
nr_div_huge.cpp:91:28: error: 'prime' was not declared in this scope
     for (d = 0; d < nrp && prime[d] * prime[d] <= N; ++d) {

                            ^
nr_div_huge.cpp: In function 'void Solve(long long unsigned int, long long unsigned int)':
nr_div_huge.cpp:105:9: error: 'g' was not declared in this scope
         g << (nr1 * nr2) % mod << '\n';

         ^
nr_div_huge.cpp:109:9: error: 'g' was not declared in this scope
         g << (nr1 * nr2) % mod << '\n';

         ^
nr_div_huge.cpp: In function 'void Read_Solve()':
nr_div_huge.cpp:113:5: error: 'f' was not declared in this scope
     f >> nr;

     ^

Cum funcționează evaluarea?