0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 非法字符： \35
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 需要为 class、interface 或 enum
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 需要为 class、interface 或 enum
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
^
0_0_9762574_11356\Main.java:1: 需要为 class、interface 或 enum
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <queue> #include <cmath> #include <algorithm> using namespace std; struct P { double x,y,z; }; double er; bool judgedel(P S,P T) { double a,b,c,Maxlen; a = (S.x-T.x)*(S.x-T.x) + (S.y-T.y)*(S.y-T.y) + (S.z-T.z)*(S.z-T.z); b = T.x*T.x + T.y*T.y + T.z+T.z; c = S.x*S.x + S.y*S.y + S.z*S.z; Maxlen = c - er; if(a <= Maxlen) return true; return false; } int main() { int i,j; int n,m,Count; bool mark[110]; P s[110],t[110]; er = 20000.0/acos(-1); er *= er; while(scanf("%d %d",&n,&m) && (n||m)) { for(i = 0;i < n; ++i) cin>>s[i].x>>s[i].y>>s[i].z; for(j = 0;j < m; ++j) cin>>t[j].x>>t[j].y>>t[j].z; memset(mark,false,sizeof(mark)); Count = 0; for(i = 0;i < n; ++i) { for(j = 0;j < m; ++j) { if(mark[j] == false && judgedel(s[i],t[j])) { mark[j] = true; Count++; } } } cout<<Count<<endl; } return 0; }
|
