Borderou de evaluare (job #1139489)
Utilizator | Data | 11 martie 2014 10:54:45 | |
---|---|---|---|
Problema | Geometry | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:19:23: error: ‘a1’ was not declared in this scope
scanf("%d%d",&a1,&b1,a2,b2);
^
user.cpp:19:27: error: ‘b1’ was not declared in this scope
scanf("%d%d",&a1,&b1,a2,b2);
^
user.cpp:19:30: error: ‘a2’ was not declared in this scope
scanf("%d%d",&a1,&b1,a2,b2);
^
user.cpp:19:33: error: ‘b2’ was not declared in this scope
scanf("%d%d",&a1,&b1,a2,b2);
^
user.cpp:20:36: error: ‘aux’ was not declared in this scope
if(a1>a2||(a1==a2&&b1>b2)){aux=a1;a1=a2;a2=aux;aux=b1;b1=b2;b2=aux;}
^
user.cpp:21:9: error: ‘S’ was not declared in this scope
S[i]=make_pair(make_pair(a1,b1),make_pair(a2,b2));
^
user.cpp:26:13: error: ‘sol’ was not declared in this scope
sol+=verif(S[i],S[j]);
^
user.cpp:26:24: error: ‘S’ was not declared in this scope
sol+=verif(S[i],S[j]);
^
user.cpp:27:17: error: ‘sol’ was not declared in this scope
printf("%d",sol);
^
user.cpp: In function ‘int det(std::pair<int, int>, std::pair<int, int>, std::pair<int, int>)’:
user.cpp:33:1: error: expected ‘;’ before ‘}’ token
}
^
user.cpp: In function ‘int verif(int, int)’:
user.cpp:37:12: error: ‘S’ was not declared in this scope
if(max(S[i].A.X,S[i].B.X)<min(S[j].A.X,S[j].B.X))
^
user.cpp:37:29: error: ‘max’ was not declared in this scope
if(max(S[i].A.X,S[i].B.X)<min(S[j].A.X,S[j].B.X))
^
user.cpp:37:52: error: ‘min’ was not declared in this scope
if(max(S[i].A.X,S[i].B.X)<min(S[j].A.X,S[j].B.X))
^
user.cpp:41:5: error: ‘det1’ was not declared in this scope
det1=det(S[i].A,S[i].B,S[j].A);
^
user.cpp:42:5: error: ‘det2’ was not declared in this scope
det2=det(S[i].A,S[i].B,S[j].B);
^
user.cpp:42:14: error: ‘S’ was not declared in this scope
det2=det(S[i].A,S[i].B,S[j].B);
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !