#4649
În cadrul cercului de lingvistică Ioana a studiat diferite sisteme de codificare a mesajelor, însă i-a atras atenția codificarea par-impar care se aplică numerelor naturale. În această codificare fiecare cifră a unui număr crește cu valoarea 1
dacă cifra este pară, respectiv scade cu valoarea 1
dacă cifra este impară.
1. Dându-se un șir de n
numere naturale, să se determine cel mai mic și cel mai mare număr din șir care, prin codificarea par-impar, devin mai mari decât valorile lor inițiale.
2. Să se determine câte numere naturale de k
cifre cu prima cifră cif
devin palindrom prin codificarea par-impar.
ONI 2024, clasa a 6-a
Problema | codificare1 | Operații I/O |
![]() codificare.in /codificare.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57397466 | Utilizator | |
Fișier | codificare1.cpp | Dimensiune | 2.31 KB |
Data încărcării | 29 Martie 2025, 10:11 | Scor / rezultat | Eroare de compilare |
codificare1.cpp:8:5: error: stray '\342' in program ifstream fin(“iluminat.in”); ^ codificare1.cpp:8:5: error: stray '\200' in program codificare1.cpp:8:5: error: stray '\234' in program codificare1.cpp:8:5: error: stray '\342' in program codificare1.cpp:8:5: error: stray '\200' in program codificare1.cpp:8:5: error: stray '\235' in program codificare1.cpp:9:5: error: stray '\342' in program ofstream fout(“iluminat.out”); ^ codificare1.cpp:9:5: error: stray '\200' in program codificare1.cpp:9:5: error: stray '\234' in program codificare1.cpp:9:5: error: stray '\342' in program codificare1.cpp:9:5: error: stray '\200' in program codificare1.cpp:9:5: error: stray '\235' in program codificare1.cpp:20:9: error: stray '\342' in program for(int i=n*n; i>=1; i—) { ^ codificare1.cpp:20:9: error: stray '\200' in program codificare1.cpp:20:9: error: stray '\224' in program codificare1.cpp:23:17: error: stray '\342' in program k—; ^ codificare1.cpp:23:17: error: stray '\200' in program codificare1.cpp:23:17: error: stray '\224' in program codificare1.cpp:36:9: error: stray '\342' in program } for(int i=n*n; i>=1; i—) { ^ codificare1.cpp:36:9: error: stray '\200' in program codificare1.cpp:36:9: error: stray '\224' in program codificare1.cpp:39:17: error: stray '\342' in program k—; ^ codificare1.cpp:39:17: error: stray '\200' in program codificare1.cpp:39:17: error: stray '\224' in program codificare1.cpp:50:21: error: stray '\342' in program for(int x=i; x>=1; x—) { ^ codificare1.cpp:50:21: error: stray '\200' in program codificare1.cpp:50:21: error: stray '\224' in program codificare1.cpp:56:21: error: stray '\342' in program } for(int x=j; x>=1; x—) { ^ codificare1.cpp:56:21: error: stray '\200' in program codificare1.cpp:56:21: error: stray '\224' in program codificare1.cpp: In function 'int main()': codificare1.cpp:8:21: error: 'iluminat' was not declared in this scope ifstream fin(“iluminat.in”); ^ codificare1.cpp:16:22: error: 'v' was not declared in this scope fin>>v[i][j]; ^ codificare1.cpp:17:17: error: 'l' was not declared in this scope l[v[i][j]]=i; ^ codificare1.cpp:18:17: error: 'c' was not declared in this scope c[v[i][j]]=j; } ^ codificare1.cpp:20:30: warning: for increment expression has no effect [-Wunused-value] for(int i=n*n; i>=1; i—) { ^ codificare1.cpp:21:15: error: 'l' was not declared in this scope a=l[i];b=c[i]; ^ codificare1.cpp:21:22: error: 'c' was not declared in this scope a=l[i];b=c[i]; ^ codificare1.cpp:22:16: error: 'fl' was not declared in this scope if(fl[a]==0 && fc[b]==0) { ^ codificare1.cpp:22:28: error: 'fc' was not declared in this scope if(fl[a]==0 && fc[b]==0) { ^ codificare1.cpp:23:21: warning: statement has no effect [-Wunused-value] k—; ^ codificare1.cpp:33:22: error: 'v' was not declared in this scope fin>>v[i][j]; ^ codificare1.cpp:34:17: error: 'l' was not declared in this scope l[v[i][j]]=i; ^ codificare1.cpp:35:17: error: 'c' was not declared in this scope c[v[i][j]]=j; } ^ codificare1.cpp:36:32: warning: for increment expression has no effect [-Wunused-value] } for(int i=n*n; i>=1; i—) { ^ codificare1.cpp:37:15: error: 'l' was not declared in this scope a=l[i];b=c[i]; ^ codificare1.cpp:37:22: error: 'c' was not declared in this scope a=l[i];b=c[i]; ^ codificare1.cpp:38:16: error: 'fl' was not declared in this scope if(fl[a]==0 && fc[b]==0) { ^ codificare1.cpp:38:28: error: 'fc' was not declared in this scope if(fl[a]==0 && fc[b]==0) { ^ codificare1.cpp:39:21: warning: statement has no effect [-Wunused-value] k—; ^ codificare1.cpp:49:20: error: 'v' was not declared in this scope if(v[i][j]==p) { ^ codificare1.cpp:50:40: warning: for increment expression has no effect [-Wunused-value] for(int x=i; x>=1; x—) { ^ codificare1.cpp:51:28: error: 'fl' was not declared in this scope if(fl[x]==0 && fc[j]==0) ^ codificare1.cpp:51:40: error: 'fc' was not declared in this scope if(fl[x]==0 && fc[j]==0) ^ codificare1.cpp:54:28: error: 'fl' was not declared in this scope if(fl[x]==0 && fc[j]==0) ^ codificare1.cpp:54:40: error: 'fc' was not declared in this scope if(fl[x]==0 && fc[j]==0) ^ codificare1.cpp:56:42: warning: for increment expression has no effect [-Wunused-value] } for(int x=j; x>=1; x—) { ^ codificare1.cpp:57:28: error: 'fl' was not declared in this scope if(fl[i]==0 && fc[x]==0) ^ codificare1.cpp:57:40: error: 'fc' was not declared in this scope if(fl[i]==0 && fc[x]==0) ^ codificare1.cpp:60:28: error: 'fl' was not declared in this scope if(fl[i]==0 && fc[x]==0) ^ codificare1.cpp:60:40: error: 'fc' was not declared in this scope if(fl[i]==0 && fc[x]==0) ^ codificare1.cpp:69:69: error: 'sp' was not declared in this scope for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { fin>>a; sp[i][j]=sp[i][j-1]+a; } } for(int i=1; i<=n-k+1; i++) { for(int j=k; j<=n; j++) { s=0; for(int x=i; x<=i+k-1; x++) s=s+sp[x][j]-sp[x][j-k]; if(s>max) max=s; } } fout<<max; } return 0; } ^ codificare1.cpp:69:189: error: 'sp' was not declared in this scope for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { fin>>a; sp[i][j]=sp[i][j-1]+a; } } for(int i=1; i<=n-k+1; i++) { for(int j=k; j<=n; j++) { s=0; for(int x=i; x<=i+k-1; x++) s=s+sp[x][j]-sp[x][j-k]; if(s>max) max=s; } } fout<<max; } return 0; } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema codificare1 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ă.