Pagini recente » Borderou de evaluare (job #1058978) | Borderou de evaluare (job #2384367) | Borderou de evaluare (job #206455) | Borderou de evaluare (job #2331391) | Borderou de evaluare (job #1503635)
Borderou de evaluare (job #1503635)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:7:345: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp:7:372: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp: In function ‘void t(int)’:
user.cpp:7:495: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
using namespace std;int n,m,i,j,x,y,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp: In function ‘int main()’:
user.cpp:7:173: 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,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp:7:203: 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,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp:7:223: 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,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
user.cpp:7:260: 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,a[MAX],z[MAX],ind;bool o[MAX];stack<int>s;vector<int>l[MAX],c;vector<vector<int> >C;void t(int x);int main(){freopen("ctc.in","r",stdin);freopen("ctc.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(!a[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 x){s.push(x);z[x]=a[x]=ind++;o[x]=1;for(int i=0;i<l[x].size();i++)if(!a[l[x][i]]){t(l[x][i]);z[x]=k(z[x],z[l[x][i]]);}else z[x]=k(z[x],a[l[x][i]]);if(z[x]==a[x]){int w;c.clear();do{w=s.top(),s.pop();o[w]=0;c.pb(w);}while(w!=x);C.pb(c);}}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 1472kb | Numar de componente gresit | 0 | 0 |
2 | 0ms | 1468kb | Corect | 10 |
3 | 0ms | 1476kb | Numar de componente gresit | 0 |
4 | 4ms | 1504kb | Numar de componente gresit | 0 | 0 |
5 | 8ms | 1608kb | Numar de componente gresit | 0 |
6 | 20ms | 1816kb | Numar de componente gresit | 0 |
7 | 32ms | 2168kb | Numar de componente gresit | 0 | 0 |
8 | 88ms | 2956kb | Numar de componente gresit | 0 |
9 | 164ms | 4876kb | Numar de componente gresit | 0 |
10 | 244ms | 7416kb | Corect | 10 | 10 |
Punctaj total | 10 |