UVa 10763 - Foreign Exchange
2014-07-28 16:05
197 查看
#include<iostream> #include<cstring> #include<cstdlib> #include<cstdio> #include<cmath> #include<string> using namespace std; int n_cmp(const void *a,const void *b) { return *(int*)a-*(int*)b; } int a[500000+2],b[500000+2]; int main() { #ifdef test freopen("sample.txt","r",stdin); #endif int num; while(scanf("%d",&num)!=EOF) { if(!num) break; for(int i=0; i<num; i++) scanf("%d %d",&a[i],&b[i]); qsort(a,num,sizeof(a[0]),n_cmp); qsort(b,num,sizeof(b[0]),n_cmp); int flag=0; for(int i=0; i<num; i++) if(a[i]!=b[i]) { flag=1; break; } if(flag==0) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }把本题转化为把两边的数组快排后比较,也可以用结构体排序。本题注意不光要找能相反对应的,还要求数量一致!
相关文章推荐
- UVA 10763 - Foreign Exchange【排序】
- Uva 10763 Foreign Exchange
- 紫书 习题 5-3 uva 10763
- UVa 10763 - Foreign Exchange
- 经典第五章 习题 5-4 UVA 10763 Foreign Ex(思维题目)
- uva 10763
- Uva - 10763 - Foreign Exchange
- UVa 10763: Foreign Exchange
- UVa-10763-Foreign Exchange
- UVA10763 交流生
- UVa-10763 交流生
- UVA 10763 Foreign Exchange
- UVA 10763
- UVa 10763 - Foreign Exchange
- uva 10763
- UVa 10763 - Foreign Exchange
- uva 10763
- uva 10763 - Foreign Exchange
- Uva - 10763 - Foreign Exchange
- UVA10763解题报告