476 Cartele

[•DITzoneC]

Aici puteţi discuta despre problema Cartele.

[•raduzer]

Cate moduri de a baga cartela sunt? 


[Later edit: Am refacut problema considerand ca sunt 8 moduri de a baga cartela si am luat 100 puncte! Multumesc oricum!]

[•zachcalhoun]

8 moduri?putem sa introducem cartela si cu fata cealalta?

[•stocarul]

8 moduri?putem sa introducem cartela si cu fata cealalta?

Păi da. Doar așa se pot obține 8 moduri. Câte 4 pe fiecare față.

[•popacamil]

incercati sa desenati o cartela pe hartie si decupati-o. o sa vedeti ca-s patru moduri. daca o intorci pe partea cealalta obtii exact aceleasi 4 moduri ca si pe prima

[•SpiderMan]

Gresit. Gandeste-te ca ai un CD. E totuna daca il pui normal, sau invers ? Si aici e la fel, conteaza cum bagi cartela, pentru ca se presupune ca are un cod unic pe fiecare fata. ( asta ca o explicatie )

[•Andrei.Xwe]

Iau doar primele 3 teste, pe ultimele 7 am WA.Am tratat toate cele 8 cazuri posibile, nu ma puteti ajuta?Si as vrea si niste teste, daca se poate.

[•PlayLikeNeverB4]

Sunt disponibile testele si pe site-ul oficial si pe infoarena la Downloads.

[•Andrei.Xwe]

Ok.Am luat cateva teste si am vazut ca nu e corecta solutia mea.Eu fac asa cele 8 teste:
1.testez matricea citita
2.rotesc 90 grade stanga matricea de la 1
3.rotesc 90 grade stanga matricea de la 2
4.rotesc 90 grade stanga matricea de la 3
5.intorc cu 180 de grade matricea de la 1(linia 1-linia n,linia2-linia n-1....)
6.rotesc 90 grade stanga matricea de la 5
7.rotesc 90 grade stanga matricea de la 6
8.rotesc 90 grade stanga matricea de la 7
E gresit?

[•alexmts123]

#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;
int n,k,card[1000][1000],c,b,l,vari,ok1,ok,ok2,i,w,ok3,ok4,ok5,ok6,ok7,ok8,s;
int main()
{
    ifstream f("cartele.in");
    ofstream g("cartele.out");
    f>>n>>k;
    for(l=1; l<=n+k*n; l++)
    for(c=1;c<=n;c++)
        f>>card[l][c];
   for(i=1;i<=k;i++){
    w=1;
    if((card[1][w]==card[n+1][w])&&(card[1][w+1]==card[n+1][w+1])&&(card[1][w+2]==card[n+1][w+2])) ok=1;
    else if((card[1][w]==card[n+1][w+2])&&(card[1][w+1]==card[n+2][w+2])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else if((card[1][w]==card[n+3][w])&&(card[1][w+1]==card[n+3][w+1])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else if((card[1][w]==card[n+1][w])&&(card[1][w+1]==card[n+2][w+1])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else ok=0;
    if (card[2][w+1]==card[n+2][w+1]) ok1=1;
    else ok1=0;
    if((card[2][w]==card[n+1][w])&&(card[2][w+1]==card[n+1][w+1])&&(card[2][w+2]==card[n+1][w+2])) ok1=1;
    else if((card[2][w]==card[n+2][w])&&(card[2][w+1]==card[n+2][w+1])&&(card[2][w+2]==card[n+2][w+2])) ok1=1;
    else if((card[2][w]==card[n+3][w])&&(card[2][w+1]==card[n+3][w+1])&&(card[2][w+2]==card[n+3][w+2])) ok1=1;
    else ok1=0;
      if((card[3][w]==card[n+1][w])&&(card[3][w+1]==card[n+1][w+1])&&(card[3][w+2]==card[n+1][w+2])) ok2=1;
    else if((card[3][w]==card[n+2][w])&&(card[3][w+1]==card[n+2][w+1])&&(card[3][w+2]==card[n+2][w+2])) ok2=1;
    else if((card[3][w]==card[n+3][w])&&(card[3][w+1]==card[n+3][w+1])&&(card[3][w+2]==card[n+3][w+2])) ok2=1;
    else ok2=0;
    if (ok==ok1==ok2==1) g<<"1"<<"\n";
    else g<<"0"<<"\n";
    n=n+n;}
    f.close ();
    g.close ();
    return 0;
}

asta e programul meu, ce sa fac sa scada memoria care o ocupa, si la teste imi zici Compilare:
user.cpp: In function ‘int main()’:
user.cpp:32:11: warning: suggest parentheses around comparison in operand of ‘==’ [-Wparentheses]
if (ok==ok1==ok2==1) g<<"1"<<"\n";
^
user.cpp:32:16: warning: suggest parentheses around comparison in operand of ‘==’ [-Wparentheses]
if (ok==ok1==ok2==1) g<<"1"<<"\n";

[•dragos231456]

#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;
int n,k,card[1000][1000],c,b,l,vari,ok1,ok,ok2,i,w,ok3,ok4,ok5,ok6,ok7,ok8,s;
int main()
{
    ifstream f("cartele.in");
    ofstream g("cartele.out");
    f>>n>>k;
    for(l=1; l<=n+k*n; l++)
    for(c=1;c<=n;c++)
        f>>card[l][c];
   for(i=1;i<=k;i++){
    w=1;
    if((card[1][w]==card[n+1][w])&&(card[1][w+1]==card[n+1][w+1])&&(card[1][w+2]==card[n+1][w+2])) ok=1;
    else if((card[1][w]==card[n+1][w+2])&&(card[1][w+1]==card[n+2][w+2])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else if((card[1][w]==card[n+3][w])&&(card[1][w+1]==card[n+3][w+1])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else if((card[1][w]==card[n+1][w])&&(card[1][w+1]==card[n+2][w+1])&&(card[1][w+2]==card[n+3][w+2])) ok=1;
    else ok=0;
    if (card[2][w+1]==card[n+2][w+1]) ok1=1;
    else ok1=0;
    if((card[2][w]==card[n+1][w])&&(card[2][w+1]==card[n+1][w+1])&&(card[2][w+2]==card[n+1][w+2])) ok1=1;
    else if((card[2][w]==card[n+2][w])&&(card[2][w+1]==card[n+2][w+1])&&(card[2][w+2]==card[n+2][w+2])) ok1=1;
    else if((card[2][w]==card[n+3][w])&&(card[2][w+1]==card[n+3][w+1])&&(card[2][w+2]==card[n+3][w+2])) ok1=1;
    else ok1=0;
      if((card[3][w]==card[n+1][w])&&(card[3][w+1]==card[n+1][w+1])&&(card[3][w+2]==card[n+1][w+2])) ok2=1;
    else if((card[3][w]==card[n+2][w])&&(card[3][w+1]==card[n+2][w+1])&&(card[3][w+2]==card[n+2][w+2])) ok2=1;
    else if((card[3][w]==card[n+3][w])&&(card[3][w+1]==card[n+3][w+1])&&(card[3][w+2]==card[n+3][w+2])) ok2=1;
    else ok2=0;
    if (ok==ok1==ok2==1) g<<"1"<<"\n";
    else g<<"0"<<"\n";
    n=n+n;}
    f.close ();
    g.close ();
    return 0;
}

asta e programul meu, ce sa fac sa scada memoria care o ocupa, si la teste imi zici Compilare:
user.cpp: In function ‘int main()’:
user.cpp:32:11: warning: suggest parentheses around comparison in operand of ‘==’ [-Wparentheses]
if (ok==ok1==ok2==1) g<<"1"<<"\n";
^
user.cpp:32:16: warning: suggest parentheses around comparison in operand of ‘==’ [-Wparentheses]
if (ok==ok1==ok2==1) g<<"1"<<"\n";

nu poti compara mai mult de 2 termeni deodata,ce vrei tu sa faci se scrie corect: if(ok==ok1 && ok1==ok2 && ok2==1)...