Pagini recente » Borderou de evaluare (job #1440290) | Borderou de evaluare (job #1079170) | Borderou de evaluare (job #1274063) | Borderou de evaluare (job #1662717) | Borderou de evaluare (job #2150116)
Borderou de evaluare (job #2150116)
Raport evaluator
Compilare:
user.cpp: In function ‘void read()’:
user.cpp:7:152: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std; short n,m;short v[maxn],used[maxn];vector<short> l[maxn];vector< pair<short,int> > sol;void read(){short x,y;scanf("%hd%hd",&n,&m);for(int i=1;i<=m;i++){scanf("%hd%hd",&x,&y);l[x].pb(y); l[y].pb(x);}}bool cmp(const pair<short,int> &x,const pair<short,int> &y){if(x.second==y.second) return x.first<y.first;return x.second>y.second;}void solve(){int nr=0,ind;for(int k=1;k<=n;k++){nr++;for(int i=1;i<=n;i++) used[i]=0;for(unsigned int i=0;i<l[k].size();i++) v[l[k][i]]=nr;for(unsigned int i=0;i<l[k].size();i++){ind=l[k][i];for(unsigned int j=0;j<l[ind].size();j++)if(l[ind][j]!=k && v[l[ind][j]]!=nr)used[l[ind][j]]++;}sol.clear();for(int i=1;i<=n;i++) if(used[i]) sol.pb(mp(i,used[i]));sort(sol.begin(),sol.end(),cmp);for(unsigned int i=0;i<sol.size();i++)printf("%d ",sol[i].first);printf("\n");}}int main(){freopen("fof.in","r",stdin);freopen("fof.out","w",stdout);read();solve();fclose(stdin);fclose(stdout);return 0;}
^
user.cpp:7:196: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std; short n,m;short v[maxn],used[maxn];vector<short> l[maxn];vector< pair<short,int> > sol;void read(){short x,y;scanf("%hd%hd",&n,&m);for(int i=1;i<=m;i++){scanf("%hd%hd",&x,&y);l[x].pb(y); l[y].pb(x);}}bool cmp(const pair<short,int> &x,const pair<short,int> &y){if(x.second==y.second) return x.first<y.first;return x.second>y.second;}void solve(){int nr=0,ind;for(int k=1;k<=n;k++){nr++;for(int i=1;i<=n;i++) used[i]=0;for(unsigned int i=0;i<l[k].size();i++) v[l[k][i]]=nr;for(unsigned int i=0;i<l[k].size();i++){ind=l[k][i];for(unsigned int j=0;j<l[ind].size();j++)if(l[ind][j]!=k && v[l[ind][j]]!=nr)used[l[ind][j]]++;}sol.clear();for(int i=1;i<=n;i++) if(used[i]) sol.pb(mp(i,used[i]));sort(sol.begin(),sol.end(),cmp);for(unsigned int i=0;i<sol.size();i++)printf("%d ",sol[i].first);printf("\n");}}int main(){freopen("fof.in","r",stdin);freopen("fof.out","w",stdout);read();solve();fclose(stdin);fclose(stdout);return 0;}
^
user.cpp: In function ‘int main()’:
user.cpp:7:859: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std; short n,m;short v[maxn],used[maxn];vector<short> l[maxn];vector< pair<short,int> > sol;void read(){short x,y;scanf("%hd%hd",&n,&m);for(int i=1;i<=m;i++){scanf("%hd%hd",&x,&y);l[x].pb(y); l[y].pb(x);}}bool cmp(const pair<short,int> &x,const pair<short,int> &y){if(x.second==y.second) return x.first<y.first;return x.second>y.second;}void solve(){int nr=0,ind;for(int k=1;k<=n;k++){nr++;for(int i=1;i<=n;i++) used[i]=0;for(unsigned int i=0;i<l[k].size();i++) v[l[k][i]]=nr;for(unsigned int i=0;i<l[k].size();i++){ind=l[k][i];for(unsigned int j=0;j<l[ind].size();j++)if(l[ind][j]!=k && v[l[ind][j]]!=nr)used[l[ind][j]]++;}sol.clear();for(int i=1;i<=n;i++) if(used[i]) sol.pb(mp(i,used[i]));sort(sol.begin(),sol.end(),cmp);for(unsigned int i=0;i<sol.size();i++)printf("%d ",sol[i].first);printf("\n");}}int main(){freopen("fof.in","r",stdin);freopen("fof.out","w",stdout);read();solve();fclose(stdin);fclose(stdout);return 0;}
^
user.cpp:7:889: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std; short n,m;short v[maxn],used[maxn];vector<short> l[maxn];vector< pair<short,int> > sol;void read(){short x,y;scanf("%hd%hd",&n,&m);for(int i=1;i<=m;i++){scanf("%hd%hd",&x,&y);l[x].pb(y); l[y].pb(x);}}bool cmp(const pair<short,int> &x,const pair<short,int> &y){if(x.second==y.second) return x.first<y.first;return x.second>y.second;}void solve(){int nr=0,ind;for(int k=1;k<=n;k++){nr++;for(int i=1;i<=n;i++) used[i]=0;for(unsigned int i=0;i<l[k].size();i++) v[l[k][i]]=nr;for(unsigned int i=0;i<l[k].size();i++){ind=l[k][i];for(unsigned int j=0;j<l[ind].size();j++)if(l[ind][j]!=k && v[l[ind][j]]!=nr)used[l[ind][j]]++;}sol.clear();for(int i=1;i<=n;i++) if(used[i]) sol.pb(mp(i,used[i]));sort(sol.begin(),sol.end(),cmp);for(unsigned int i=0;i<sol.size();i++)printf("%d ",sol[i].first);printf("\n");}}int main(){freopen("fof.in","r",stdin);freopen("fof.out","w",stdout);read();solve();fclose(stdin);fclose(stdout);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 36ms | 968kb | OK | 100 |
Punctaj total | 100 |