hdu-2673-shǎ崽 OrOrOrOrz(水题)】的更多相关文章

#include <cstdio> #include <algorithm> using namespace std; int main() { int n; while (scanf("%d",&n)!=EOF) { ]; ; i<n; i++) scanf("%d",&a[i]); sort(a,a+n); ,end=n-,flag=; printf(]); while (begin<=end) { if (f…
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=2673 拍两次序,交替输出 #include<iostream> #include<algorithm> #include<cstdio> using namespace std; #define MAX_NUMBER 10000 bool myfunction1 (int i,int j) { return (i<j); } bool myfunction2 (in…
注意输出格式 #include <iostream> #include <algorithm> using namespace std; +]; int main() { int n; while (cin>>n) { ; i<n; i++) cin>>arr[i]; sort(arr, arr+n); cout<<arr[n-]; ; i*<n-; i++) { == i){ cout<<" "<…
题意:排序后按题目要求输出 思路:排序 #include<iostream> #include<stdio.h> #include<algorithm> using namespace std; int main(){ ],n,i,j; while(~scanf("%d",&n)){ ;i<n;++i) scanf("%d",&a[i]); sort(a,a+n); i=; j=n-; while(i<…
Friendship of Frog Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5578 Description N frogs from different countries are standing in a line. Each country is represented by a lowercase letter. The distance betwee…
ZYB's Biology Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5590 Description ZYB(ZJ−267)在NOIP拿到600分之后开始虐生物题,他现在扔给你一道简单的生物题:给出一个DNA序列和一个RNA序列,问它们是否配对. DNA序列是仅由A,C,G,T组成的字符串,RNA序列是仅由A,C,G,U组成的字符串. DNA和RNA匹配当且仅当每…
L - House Building Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5538 Description Have you ever played the video game Minecraft? This game has been one of the world's most popular game in recent years. The wor…
Problem Description Acmer in HDU-ACM team are ambitious, especially shǎ崽, he can spend time in Internet bar doing problems overnight. So many girls want to meet and Orz him. But Orz him is not that easy.You must solve this problem first. The problem…
Number Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 89984    Accepted Submission(s): 21437 Problem Description A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A…
Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21106    Accepted Submission(s): 9498 Problem Description In many applications very large integers numbers are required. Some of these…