0_0_20612355_24091.cpp:4:5: error: expected unqualified-id before '=' token
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:30: error: expected unqualified-id before 'if'
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:144: error: expected unqualified-id before 'for'
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:153: error: 'i' does not name a type
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:158: error: 'i' does not name a type
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:255: error: expected unqualified-id before 'if'
= mini) return false; if(lev == n) { if(semester-1 < mini) mini = semester-1; return true; } int i,tn=0,que[15]; for(i=0; i<n; i++) if(!finished[i] && permit(i) && (subject[i].time & (1<<semester%2)) != 0) que[tn++] = i; if(tn <= m) { for(i=0; i<tn; i++) finished[que[i]] = true; dfs(lev+tn,semester+1); for(i=0; i<tn; i++) finished[que[i]] = false; } else { int temp[15]; selectAndDfs(tn,m,0,que,temp,lev,semester); } return false;} int main() { while(scanf("%d%d", &n, &m) == 2 && !(n == -1 && m == -1)) { int i,j,k,p,t; for(i=0; i<n; i++) { scanf("%s", &subject[i].name); subject[i].time = subject[i].preNum = 0; } for(i=0; i<n; i++) { char s[10]; scanf("%s", s); for(j=0; j<n && strcmp(s, subject[j].name) != 0; j++); scanf("%s", s); if(s[0] == 'B') subject[j].time = 3; else if(s[0] == 'S') subject[j].time = 1; else subject[j].time = 2; scanf("%d", &t); for(k=0; k<t; k++) { scanf("%s", s); for(p=0; p<n && strcmp(s, subject[p].name) != 0; p++); subject[j].prerequisites[subject[j].preNum++] = p; } } memset(finished, 0, sizeof(finished)); mini = oo; dfs(0,1); printf("The minimum number of semesters required to graduate is %d.\n", mini); } return 0;}
^
0_0_20612355_24091.cpp:4:413: error: expected unqualifie
|
