Source code for submission s687

Go to diff to previous submission

fn.cpp

  1. #include <iostream>
  2. #include <cctype>
  3. #include <cmath>
  4. #include <complex>
  5. #include <cstdio>
  6. #include <string>
  7. #include <list>
  8. #include <map>
  9. #include <queue>
  10. #include <set>
  11. #include <sstream>
  12. #include <stack>
  13. #include <utility>
  14. #include <vector>
  15.  
  16. using namespace std;
  17.  
  18. #define DEBUG(x) cout << ">>> " #x << " : " << x << endl;
  19.  
  20. int main() {
  21. int n,m;
  22. while( scanf("%d %d", &n, &m) == 2 ) {
  23. map<int,int> neighbours;
  24. bool found = false;
  25.  
  26. for( int i = 0; i < n; i++ ) {
  27. neighbours[i] = 0;
  28. }
  29.  
  30. for( int i = 0; i < m; i++ ) {
  31. int u,v;
  32. scanf( "%d %d", &u, &v );
  33.  
  34. if( ++neighbours[u] >= 4 ) { found = true; }
  35. if( ++neighbours[v] >= 4 ) { found = true; }
  36. }
  37.  
  38. if( found ) {
  39. printf( "YES\n" );
  40. } else {
  41. printf( "NO\n" );
  42. }
  43. }
  44.  
  45. return 0;
  46. }
  47.  

Diff to submission s624

fn.cpp

--- c5.s624.cteam018.fn.cpp.0.fn.cpp
+++ c5.s687.cteam018.fn.cpp.0.fn.cpp
@@ -24,4 +24,7 @@
                 bool found = false;
 
+                for( int i = 0; i < n; i++ ) {
+                        neighbours[i] = 0;
+                }
 
                 for( int i = 0; i < m; i++ ) {