#1370
pepeuri
Să se afle câte numere naturale cu n
cifre au suma oricăror două cifre alăturate pătrat perfect.
Olimpiada Cunoaşterii
Problema | pepeuri | Operații I/O |
pepeuri.in /pepeuri.out
|
---|---|---|---|
Limita timp | 0.25 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #44165171 | Utilizator | |
Fișier | pepeuri.cpp | Dimensiune | 2.96 KB |
Data încărcării | 04 Iulie 2023, 18:42 | Scor / rezultat | 5 puncte |
pepeuri.cpp: In function 'void LogPow(unsigned int, long long unsigned int (*)[11])': pepeuri.cpp:20:22: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:20:25: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:20:35: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:20:38: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:21:21: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:21:24: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:29:33: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:36: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:47: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:50: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:56: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:59: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:70: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:29:73: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(I[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:33:24: warning: array subscript has type 'char' [-Wchar-subscripts] I[i][j]=Matrix[i][j]; ^ pepeuri.cpp:33:27: warning: array subscript has type 'char' [-Wchar-subscripts] I[i][j]=Matrix[i][j]; ^ pepeuri.cpp:33:37: warning: array subscript has type 'char' [-Wchar-subscripts] I[i][j]=Matrix[i][j]; ^ pepeuri.cpp:33:40: warning: array subscript has type 'char' [-Wchar-subscripts] I[i][j]=Matrix[i][j]; ^ pepeuri.cpp:34:29: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:34:32: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:41:29: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:32: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:43: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:46: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:58: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:61: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:72: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:41:75: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=(Matrix[i][j]+(PMatrix[i][k]*PMatrix[k][j])%Mod)%Mod; ^ pepeuri.cpp:45:26: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:45:29: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:45:39: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:45:42: warning: array subscript has type 'char' [-Wchar-subscripts] PMatrix[i][j]=Matrix[i][j]; ^ pepeuri.cpp:46:25: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:46:28: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=0; ^ pepeuri.cpp:53:21: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=I[i][j]; ^ pepeuri.cpp:53:24: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=I[i][j]; ^ pepeuri.cpp:53:29: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=I[i][j]; ^ pepeuri.cpp:53:32: warning: array subscript has type 'char' [-Wchar-subscripts] Matrix[i][j]=I[i][j]; ^ pepeuri.cpp: In function 'int main()': pepeuri.cpp:58:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("pepeuri.in","r",stdin); ^ pepeuri.cpp:59:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("pepeuri.out","w",stdout); ^ pepeuri.cpp:61:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%u",&n); ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 5 | 5 | Exemplu | |
2 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
3 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
4 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
5 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
6 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
7 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
8 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
9 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
10 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
11 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
12 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
13 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
14 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
15 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
16 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
17 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
18 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
19 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
20 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
Punctaj total | 5 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema pepeuri face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.