UVA 10763 - Foreign Exchange
2011-11-30 11:33
302 查看
判断u->v 和 v -> u是否成对出现。
#include<stdio.h> #include<string.h> #define MAXD 1005 int G[MAXD][MAXD]; int N, u, v; bool check() { for( int i = 1; i <= 1000; i ++) for( int j = 1; j <= 1000; j ++) if( G[i][j] != 0) return false; return true; } void init() { memset(G, 0, sizeof G); for( int i = 0; i < N; i ++) { scanf( "%d%d", &u, &v); G[u][v] ++; G[v][u] --; } } int main() { while( true) { scanf( "%d", &N); if( N == 0) break; init(); if( check() ) printf( "YES\n"); else printf( "NO\n"); } return 0; }
相关文章推荐
- Foreign Exchange UVA - 10763
- 紫书 习题 5-3 uva 10763
- UVa 10763 - Foreign Exchange
- Uva 10763 - Foreign Exchange
- uva 10763
- UVA 10763 Foreign Exchange
- Uva - 10763 - Foreign Exchange
- UVa-10763-Foreign Exchange
- UVa 10763 - Foreign Exchange
- UVa 10763 - Foreign Exchange
- UVA - 10763 Foreign Exchange
- UVA - 10763 Foreign Exchange
- uva 10763
- Uva - 10763 - Foreign Exchange
- UVa-10763-Foreign Exchange
- uva:10763 - Foreign Exchange(排序)
- UVa 10763(Foreign Exchange)
- UVA 10763
- UVa 10763 (STL) Foreign Exchange
- 10763--Foreign Exchange--Uva