Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
Register

## 1A了，水题~差分系统+Bellman Ford,0ms无鸭梨

Posted by KatrineYang at 2016-09-16 13:23:53 on Problem 1364 and last updated at 2016-09-16 13:24:02
```#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;

int main() {
while(1){
int n,m;
scanf("%d", &n);
if(!n) break;
scanf("%d", &m);
int weight[110][110];
for(int ii = 0; ii < m; ii++){
int i,j,k;
char s[4];
scanf("%d%d%s%d", &i, &j, s, &k);
if(strcmp(s, "gt") == 0){
}
else{
}
}
int dist[110] = {0};
for(int ii = 0; ii < n; ii++){
for(int i = 0; i <= n; i++){
for(int j = 0; j < adjNo[i]; j++){
}
}
}
}
bool ky = 1;
for(int i = 0; i <= n; i++){
for(int j = 0; j < adjNo[i]; j++){
ky = 0;
goto done;
}
}
}
done:
if(ky){
printf("lamentable kingdom\n");
}
else{
printf("successful conspiracy\n");
}
}
return 0;
}
```

Followed by: