Borderou de evaluare (job #1503639)

Utilizator al.mocanuAlexandru Mocanu al.mocanu Data 16 octombrie 2015 17:55:09
Problema Componente tare conexe Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:7:344: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp:7:371: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp: In function ‘void t(int)’: user.cpp:7:503: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp: In function ‘int main()’: user.cpp:7:174: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp:7:202: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp:7:222: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^ user.cpp:7:259: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,m,i,j,x,y,ind=1,k[MAX],z[MAX];bool o[MAX];vector<int>l[MAX],c;vector<vector<int> >C;stack<int >s;void t(int v);int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);scanf("%d%d",&n,&m);for(i=0;i<m;i++){scanf("%d%d",&x,&y);l[x].pb(y);}for(i=1;i<=n;i++)if(!k[i])t(i);printf("%d\n",C.size());for(i=0;i<C.size();i++){for(j=0;j<C[i].size();j++)printf("%d",C[i][j]);printf("\n");}return 0;}void t(int v){int w;k[v]=ind;z[v]=ind++;s.push(v);o[v]=1;for(int i=0;i<l[v].size();i++){if(!k[l[v][i]]){t(l[v][i]);z[v]=min(z[v],z[l[v][i]]);}else if(o[l[v][i]])z[v]=min(z[v],k[l[v][i]]);}if(z[v]==k[v]){do{w=s.top();s.pop();o[w]=0;c.pb(w);}while(v!=w);C.pb(c);c.clear();}} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms1432kbFisier de iesire lipsa!00
20ms1436kbFisier de iesire lipsa!0
30ms1436kbFisier de iesire lipsa!0
40ms1436kbFisier de iesire lipsa!00
50ms1432kbFisier de iesire lipsa!0
60ms1436kbFisier de iesire lipsa!0
70ms1436kbFisier de iesire lipsa!00
80ms1436kbFisier de iesire lipsa!0
90ms1436kbFisier de iesire lipsa!0
100ms1432kbFisier de iesire lipsa!00
Punctaj total0

Ceva nu functioneaza?