棰樼洰鍦板潃:
http://acm.hdu.edu.cn/showproblem.php?pid=2094
棰樼洰鎻忚堪:
Problem Description
鏈変竴緹や漢錛屾墦涔掍箵鐞冩瘮璧涳紝涓や袱鎹夊鎾曟潃錛屾瘡涓や釜浜轟箣闂存渶澶氭墦涓鍦烘瘮璧涖?br>鐞冭禌鐨勮鍒欏涓嬶細(xì)
濡傛灉A鎵撹觸浜?jiǎn)B錛孊鍙堟墦璐ヤ簡(jiǎn)C錛岃孉涓嶤涔嬮棿娌℃湁榪涜榪囨瘮璧涳紝閭ｄ箞灝辮瀹氾紝A涓瀹氳兘鎵撹觸C銆?br>濡傛灉A鎵撹觸浜?jiǎn)B錛孊鍙堟墦璐ヤ簡(jiǎn)C錛岃屼笖錛孋鍙堟墦璐ヤ簡(jiǎn)A錛岄偅涔圓銆丅銆丆涓夎呴兘涓嶅彲鑳芥垚涓哄啝鍐涖?br>鏍規(guī)嵁榪欎釜瑙勫垯錛屾棤闇寰幆杈冮噺錛屾垨璁稿氨鑳界‘瀹氬啝鍐涖備綘鐨勪換鍔″氨鏄潰瀵逛竴緹ゆ瘮璧涢夋墜錛屽湪緇忚繃浜?jiǎn)鑻ヲq插満鎾曟潃涔嬪悗錛岀‘瀹氭槸鍚﹀凡緇忓疄闄呬笂浜х敓浜?jiǎn)鍐犲啗銆?br>
Input
杈撳叆鍚湁涓浜涢夋墜緹わ紝姣忕兢閫夋墜閮戒互涓涓暣鏁皀(n<1000)寮澶達(dá)紝鍚庤窡n瀵歸夋墜鐨勬瘮璧涚粨鏋滐紝姣旇禌緇撴灉浠ヤ竴瀵歸夋墜鍚嶅瓧錛堜腑闂撮殧涓絀烘牸錛夎〃紺猴紝鍓嶈呮垬鑳滃悗鑰呫傚鏋渘涓?錛屽垯琛ㄧず杈撳叆緇撴潫銆?br>
Output
瀵逛簬姣忎釜閫夋墜緹わ紝鑻ヤ綘鍒ゆ柇鍑轟駭鐢熶簡(jiǎn)鍐犲啗錛屽垯鍦ㄤ竴琛屼腑杈撳嚭“Yes”錛屽惁鍒欏湪涓琛屼腑杈撳嚭“No”銆?br>
Sample Input
3
Alice Bob
Smith John
Alice Smith
5
a c
c d
d e
b e
a d
0
Sample Output
Yes
No
鏈変竴緹や漢錛屾墦涔掍箵鐞冩瘮璧涳紝涓や袱鎹夊鎾曟潃錛屾瘡涓や釜浜轟箣闂存渶澶氭墦涓鍦烘瘮璧涖?br>鐞冭禌鐨勮鍒欏涓嬶細(xì)
濡傛灉A鎵撹觸浜?jiǎn)B錛孊鍙堟墦璐ヤ簡(jiǎn)C錛岃孉涓嶤涔嬮棿娌℃湁榪涜榪囨瘮璧涳紝閭ｄ箞灝辮瀹氾紝A涓瀹氳兘鎵撹觸C銆?br>濡傛灉A鎵撹觸浜?jiǎn)B錛孊鍙堟墦璐ヤ簡(jiǎn)C錛岃屼笖錛孋鍙堟墦璐ヤ簡(jiǎn)A錛岄偅涔圓銆丅銆丆涓夎呴兘涓嶅彲鑳芥垚涓哄啝鍐涖?br>鏍規(guī)嵁榪欎釜瑙勫垯錛屾棤闇寰幆杈冮噺錛屾垨璁稿氨鑳界‘瀹氬啝鍐涖備綘鐨勪換鍔″氨鏄潰瀵逛竴緹ゆ瘮璧涢夋墜錛屽湪緇忚繃浜?jiǎn)鑻ヲq插満鎾曟潃涔嬪悗錛岀‘瀹氭槸鍚﹀凡緇忓疄闄呬笂浜х敓浜?jiǎn)鍐犲啗銆?br>
Input
杈撳叆鍚湁涓浜涢夋墜緹わ紝姣忕兢閫夋墜閮戒互涓涓暣鏁皀(n<1000)寮澶達(dá)紝鍚庤窡n瀵歸夋墜鐨勬瘮璧涚粨鏋滐紝姣旇禌緇撴灉浠ヤ竴瀵歸夋墜鍚嶅瓧錛堜腑闂撮殧涓絀烘牸錛夎〃紺猴紝鍓嶈呮垬鑳滃悗鑰呫傚鏋渘涓?錛屽垯琛ㄧず杈撳叆緇撴潫銆?br>
Output
瀵逛簬姣忎釜閫夋墜緹わ紝鑻ヤ綘鍒ゆ柇鍑轟駭鐢熶簡(jiǎn)鍐犲啗錛屽垯鍦ㄤ竴琛屼腑杈撳嚭“Yes”錛屽惁鍒欏湪涓琛屼腑杈撳嚭“No”銆?br>
Sample Input
3
Alice Bob
Smith John
Alice Smith
5
a c
c d
d e
b e
a d
0
Sample Output
Yes
No
涓閬撳緢鏄庢樉鐨勬暟鎹粨鏋勯, 鐢ㄦ嫇鎵戞帓搴忚В鍐?
褰?杈撳叆 A 鎴樿儨 B 鏃? 璁?B 鎸囧悜 A, 琛ㄧずB鏇捐鎵撹觸榪?
鏈鍚庢寚鍚戠┖鐨勫氨琛ㄧず娌℃湁浜烘垬鑳滆繃浠? 濡傛灉榪欐牱鐨勪漢浠?br>瀛樺湪涓涓?閭ｄ箞鏄庢樉,鏈鍚庣殑鍐犲啗灝辨槸浠栦簡(jiǎn). 榪欓噷鎴戠敤鍒頒簡(jiǎn)
C++ STL 鐨刴ap set 鐢ㄦ潵瀹炵幇 B->A 鐨勬槧灝勫叧緋?
浠ｇ爜濡備笅 :
//MiYu鍘熷垱, 杞笘璇鋒敞鏄?: 杞澆鑷?______________鐧界櫧銇眿
#include <iostream>
#include <set>
#include <map>
#include <string>
using namespace std;
map <string, string> mp;
set <string> st;
int main ( )
{
int N;
while ( cin >> N, N )
{
st.clear();
mp.clear();
string s1,s2;
for ( int i = 0; i != N; ++ i )
{
cin >> s1 >> s2;
st.insert ( s1 );
st.insert ( s2 );
mp[ s2 ] = s1;
}
set <string>::iterator beg = st.begin();
int nCount = 0;
for ( ; beg != st.end (); ++ beg )
{
if ( !mp[ *beg ].length () )
{
++ nCount;
}
}
puts ( nCount == 1 ? "Yes" : "No" );
}
return 0;
}
#include <iostream>
#include <set>
#include <map>
#include <string>
using namespace std;
map <string, string> mp;
set <string> st;
int main ( )
{
int N;
while ( cin >> N, N )
{
st.clear();
mp.clear();
string s1,s2;
for ( int i = 0; i != N; ++ i )
{
cin >> s1 >> s2;
st.insert ( s1 );
st.insert ( s2 );
mp[ s2 ] = s1;
}
set <string>::iterator beg = st.begin();
int nCount = 0;
for ( ; beg != st.end (); ++ beg )
{
if ( !mp[ *beg ].length () )
{
++ nCount;
}
}
puts ( nCount == 1 ? "Yes" : "No" );
}
return 0;
}
]]>
棰樼洰鍦板潃 :
http://acm.hdu.edu.cn/showproblem.php?pid=2673
鍩烘湰灝辨槸 褰撳墠鏈澶у?鍜?鏈灝忓?鐨勪氦鏇胯緭鍑簙
寰堢畝鍗曠殑姘撮, 鐩存帴浠ｇ爜:
//MiYu鍘熷垱, 杞笘璇鋒敞鏄?: 杞澆鑷?______________鐧界櫧銇眿
#include <stdio.h>
#include <stdlib.h>
int num[10001];
int cmp ( const void *a, const void *b )
{
return *( ( int * )a ) - *( ( int * )b );
}
int main ()
{
int N,i,j,k;
while ( scanf ( "%d",&N ) != EOF )
{
for ( i = 0; i != N; ++ i )
{
scanf ( "%d",num + i );
}
qsort ( num , N ,sizeof (int), cmp );
i = N - 1, j = 0;
for ( k = 0; k != N; ++ k )
{
if ( k % 2 == 0 )
{
printf ( !j ? "%d" : " %d",num[i--] );
}
else
{
printf ( " %d",num[j++] );
}
}
putchar ('\n');
}
return 0;
}
#include <stdio.h>
#include <stdlib.h>
int num[10001];
int cmp ( const void *a, const void *b )
{
return *( ( int * )a ) - *( ( int * )b );
}
int main ()
{
int N,i,j,k;
while ( scanf ( "%d",&N ) != EOF )
{
for ( i = 0; i != N; ++ i )
{
scanf ( "%d",num + i );
}
qsort ( num , N ,sizeof (int), cmp );
i = N - 1, j = 0;
for ( k = 0; k != N; ++ k )
{
if ( k % 2 == 0 )
{
printf ( !j ? "%d" : " %d",num[i--] );
}
else
{
printf ( " %d",num[j++] );
}
}
putchar ('\n');
}
return 0;
}
鍙﹀娌′簨鍋氱敤 map 鍋氫簡(jiǎn)涓嬈? 鏃墮棿涓婂鍔犱簡(jiǎn) 46 MS .
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
map < int ,int > mp;
int main ()
{
int N,i,k;
while ( scanf ( "%d",&N ) != EOF )
{
int num;
mp.clear();
for ( i = 0; i != N; ++ i )
{
scanf ( "%d",&num );
mp[ num ] = 1;
}
map < int ,int >::iterator beg = mp.begin();
map < int ,int >::iterator end = mp.end();
end --;
for ( k = 0; k != N; ++ k )
{
if ( k % 2 == 0 )
{
printf ( !k ? "%d" : " %d",end->first );
end --;
}
else
{
printf ( " %d",beg->first );
beg ++;
}
}
putchar ('\n');
}
return 0;
}
#include <algorithm>
#include <map>
using namespace std;
map < int ,int > mp;
int main ()
{
int N,i,k;
while ( scanf ( "%d",&N ) != EOF )
{
int num;
mp.clear();
for ( i = 0; i != N; ++ i )
{
scanf ( "%d",&num );
mp[ num ] = 1;
}
map < int ,int >::iterator beg = mp.begin();
map < int ,int >::iterator end = mp.end();
end --;
for ( k = 0; k != N; ++ k )
{
if ( k % 2 == 0 )
{
printf ( !k ? "%d" : " %d",end->first );
end --;
}
else
{
printf ( " %d",beg->first );
beg ++;
}
}
putchar ('\n');
}
return 0;
}
]]>
棰樼洰鍦板潃 :
http://acm.hdu.edu.cn/showproblem.php?pid=1106
寰堢畝鍗曠殑涓閬撴按棰? 灝辨槸鐩存帴瀛楃涓叉媶鍒嗗氨琛屼簡(jiǎn)
浠ｇ爜:
//MiYu鍘熷垱, 杞笘璇鋒敞鏄?: 杞澆鑷?______________鐧界櫧銇眿
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int cmp ( const void *p, const void *t )
{
return *(int *)p - *(int *)t;
}
char s[1010];
int a[1010];
int main()
{
while ( scanf("%s",s) != EOF )
{
char *t;
int n = 1;
memset ( a, 0, sizeof ( a ) );
t = strtok ( s,"5" );
a[0] = atoi ( t );
while ( t = strtok ( NULL,"5" ) )
{
a[ n ++ ] = atoi ( t );
}
qsort ( a, n, sizeof ( int ), cmp );
for ( int i = 0; i != n; ++ i )
{
printf(i ? " %d" : "%d",a[i]);
}
putchar ( '\n' );
}
return 0;
}
#include <stdio.h>#include <stdlib.h>#include <string.h>int cmp ( const void *p, const void *t ){ return *(int *)p - *(int *)t;}char s[1010];int a[1010];int main(){ while ( scanf("%s",s) != EOF ) { char *t; int n = 1; memset ( a, 0, sizeof ( a ) ); t = strtok ( s,"5" ); a[0] = atoi ( t ); while ( t = strtok ( NULL,"5" ) ) { a[ n ++ ] = atoi ( t ); } qsort ( a, n, sizeof ( int ), cmp ); for ( int i = 0; i != n; ++ i ) { printf(i ? " %d" : "%d",a[i]); } putchar ( '\n' ); } return 0;}]]>