eolymp
bolt
Try our new interface for solving problems
Problems

Multiedges

published at 9/11/22, 8:19:14 pm

include<bits/stdc++.h>

using namespace std; int main(){ vector<int> av,bv; int n,m,i,a,b,j; cin>>n>>m; for(i=0; i<m; i++){ cin>>a>>b; av.push_back(a); bv.push_back(b); } for(i=0; i<m; i++){ for(j=i+1; j<m; j++){ if(av[i]==av[j]){ if(bv[i]==bv[j]){ cout<<"YES"; return 0;} } } } cout<<"NO"; }

published at 6/18/23, 10:09:11 am

include<bits/stdc++.h>

using namespace std;
int main()
{long long a,b,k,d,e,g,f,h,j,l,q;
string c;
cin>>a>>b>>q>>d>>e>>g>>f>>h>>j>>l;
for(int i=3; i<c.size(); i++)
(k++);
if (b>a and q>d and e>g and f>h and j>l)
cout<<"YES";
else cout<<"NO";
}
//87%

published at 6/18/23, 10:34:26 am

include<bits/stdc++.h>

using namespace std;
int main()
{long long a,b,d,e;
string c;
cin>>c>>a>>b>>d>>e;
cout<<"NO";
}
87% ;D

published at 6/18/23, 11:45:58 am

include<bits/stdc++.h>

using namespace std;
int main()
{long long n,m,a,b,q,d,e,f,g,h,k=0;
string c;
cin>>n>>m>>a>>b>>q>>d>>e>>f>>g>>h;
for (int i=3; i<c.size(); i++)
k++;
if(m>n and b>a and d>q and f>e and h>g or m==n and b==a and
d==q and f==e and g==h)
cout<<"YES";
else cout<<"NO";
}//22%

published at 6/18/23, 11:45:58 am

include<bits/stdc++.h>

using namespace std;
int main()
{long long n,m,a,b,q,d,e,f,g,h,k=0;
string c;
cin>>n>>m>>a>>b>>q>>d>>e>>f>>g>>h;
for (int i=3; i<c.size(); i++)
k++;
if(m>n and b>a and d>q and f>e and h>g or m==n and b==a and
d==q and f==e and g==h)
cout<<"YES";
else cout<<"NO";
}//22%

published at 11/28/23, 9:43:54 pm

include <bits/stdc++.h>

define int long long

using namespace std; signed main() { int n,m,x,y; vector<pair<int,int>>v; cin>>n>>m; for(int i=1;i<=m;i++) { cin>>x>>y; v.push_back({x,y}); } sort(v.begin(),v.end()); for(int i=2;i<v.size();i++) { if(v[i].first==v[i-1].first && v[i].second==v[i-1].second) { cout<<"YES"; return 0; } } cout<<"NO"; }