Search found 3 matches
- Tue Aug 22, 2006 1:47 pm
- Forum: Volume 3 (300-399)
- Topic: 306 - Cipher
- Replies: 74
- Views: 20520
306 why CE
#include<iostream> #include<cstdlib> #include<cstring> using namespace std; int list[1000][300]; int main(void) { int n,i,j,t,T,l,c; char str[1000],temp[1000]; while(cin>>n && n!=0) { for(i=0;i<n;i++) cin>>list[0][i]; t=1; c=0; while(t) { c++; for(i=0;i<n;i++) list[c][i]=list[c-1][list[0][i...
- Sat Jul 29, 2006 6:56 pm
- Forum: Volume 3 (300-399)
- Topic: 315 - Network
- Replies: 68
- Views: 23925
315 WA
why :( #include<iostream> #include<cstdlib> #include<cstring> using namespace std; int node; bool W[100][100]; bool mark[100]; int drop; void check(int in) { int j; mark[in]=1; for(j=0;j<node;j++) if(drop!=j && W[in][j] && !mark[j]) check(j); } int main(void) { char x[100]; char * pc...
- Thu Jul 27, 2006 4:39 pm
- Forum: Volume 1 (100-199)
- Topic: 124 - Following Orders
- Replies: 49
- Views: 8376
124 ....i don't know why WA
here is my Code: #include<iostream> #include<cstdlib> #include<cstring> using namespace std; char in[1000]; char str[500]; char list[500]; char st[1000][500],s; int n; bool W[1000][1000]; void check() { int i,j,k,f1,f2; bool t=true; for(i=0;i<n;i++) for(j=i+1;j<n;j++) { for(k=0;k<n;k++) { if(list[k]...