Submission #151464

#TimeUsernameProblemLanguageResultExecution timeMemory
151464pathRonald (COCI17_ronald)C++14
15 / 120
43 ms2296 KiB
//https://github.com/mostafa-saad/MyCompetitiveProgramming/blob/master/Olympiad/COCI/official/2015/contest4_solutions/solutions.pdf

#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]++;
        if(a[x]>1||a[y]>1) 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...