제출 #151465

#제출 시각아이디문제언어결과실행 시간메모리
151465pathRonald (COCI17_ronald)C++14
45 / 120
44 ms888 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define mp make_pair typedef long long int ll; const int N=1e3+5; int n,m,x,y,a[N],tmp; int main(){ cin.tie(NULL); ios_base::sync_with_stdio(false); cin>>n>>m; while(m--){ cin>>x>>y; a[x]++; a[y]++; } for(int i=1;i<=n;i++) if(!(a[i]%2)) tmp=1; if(tmp) cout<<"NE\n"; else cout<<"DA\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...