hdu As Easy As A+B

纯水题 ,不解释

#include<stdio.h>
int t,n,num[1005];
int main( )
{scanf( "%d",&t );while( t-- ){scanf( "%d",&n );for( int i = 0; i < n; ++i )scanf( "%d",&num[i] );for( int i = 0,f = 1; i < n; ++i )for( int j = 1; j < n - i; ++j )if( num[j-1] > num[j] )num[j-1] ^= num[j] ^= num[j-1] ^= num[j];for( int i = 0; i < n; ++i )printf( i != n - 1?"%d ":"%d\n",num[i] ); }return 0;
}

转载于:https://www.cnblogs.com/Lvsi/archive/2011/04/28/2031858.html

hdu As Easy As A+B相关推荐

HDU 4565So Easy!2012长沙邀请赛A题（共轭构造+矩阵的快速幂）
So Easy! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total S ...
HDU 6607 Easy Math Problem（杜教筛 + min_25 + 拉格朗日插值）
Easy Math Problem 推式子 ∑i=1n∑j=1ngcd(i,j)Klcm(i,j)[gcd(i,j)∈prime]∑i=1n∑j=1ngcd(i,j)K−1ij[gcd(i,j)∈pr ...
HDU 4359 Easy Tree DP? 组合数学+动归
题意:定义一种树,每个节点的权值都是20到2n-1,每个权值出现一次,每个节点的左子树的权值和小于右子树,除非只有一个子树.给你n和d,问有n个节点且恰好深度是d的这种树有多少种. 比赛的时候我没有做 ...
HDU 6833 A Very Easy Math Problem
A Very Easy Math Problem 推式子 ∑ai=1n∑a2=1n⋯∑ax=1n(∏j=1xajk)f(gcd(a1,a2,-,ax))×gcd(a1,a2,-,ax)\sum_{a_ ...
So Easy!（HDU - 4565）
Problem Description A sequence S n is defined as: Where a, b, n, m are positive integers.┌x┐is the c ...
2020杭电多校第六场 A Very Easy Math Problem 莫比乌斯反演 (HDU 6833)
A Very Easy Math Problem 题解 ∑ a 1 = 1 n ∑ a 2 = 1 n ⋅ ⋅ ⋅ ∑ a x = 1 n ( ∏ j = 1 x a j k ) f ( g c d ...
HDU 2055 An easy problem
继续水水 #include <stdio.h> int main ( ) {int n;scanf ( "%d" , &n );while ( n-- ){in ...
HDU - 5572 An Easy Physics Problem(几何-碰撞问题)
题目链接:点击查看题目大意:在一个二维平面上,给出一个实心圆柱体,再给出一个可以视为质点的小球,小球初始时位于点 A ,会给出一个速度向量 VA,当小球碰到圆柱体时,会因碰撞弹开,规定碰撞不会丢失动 ...
HDU - 5475 An easy problem(线段树)
题目链接:点击查看题目大意:给定n次操作和一个m,每次操作后对m取模,每次操作分为两种,初始化当前的数为1: 1 x:当前的数乘上x后输出结果 2 x:当前的数除以第x个操作的数后输出结果题目分析 ...

hdu As Easy As A+B

hdu As Easy As A+B相关推荐

最新文章

热门文章