zoukankan      html  css  js  c++  java
  • 【HDU】5162 Jump and Jump...

    题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=5162

    发现自己写的max宏有点问题

    改成这样:#define max(a,b) ((a>b)?(a):(b)),后面的返回值也要一个括号

    #include <iostream>
    #include <algorithm>
    #include <cstdlib>
    #include <cstdio>
    #include <string>
    #include <cstring>
    #include <cmath>
    #include <ctime>
    using namespace std;
    
    
    #define read() freopen("in.txt", "r", stdin)
    #define write() freopen("out.txt", "w", stdout)
    #define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )  
    #define For( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i ) 
    #define clr( a , x ) memset ( a , x , sizeof a )  
    #define cpy( a , x ) memcpy ( a , x , sizeof a ) 
    #define max(a,b) ((a>b)?(a):(b))
    #define LL long long 
    #define MaxSize 100000
    
    int main()
    {
    	//read();
    	int T;
    	scanf("%d",&T);
    	int n;
    	while(T--)
    	{
    		int a,b,c;
    		int cp[20];
    		scanf("%d",&n);
    		for (int i = 0; i < n; ++i)
    		{
    			scanf("%d%d%d",&a,&b,&c);
    			cp[i]=max(max(a,b),c);
    
    		}
    		int rank;
    		for (int i = 0; i < n; ++i)
    		{
    			rank = 0;
    			for (int j = 0; j < n; ++j)
    			{
    				if (cp[j] >= cp[i])
    				{
    					rank++;
    				}
    			}
    			if (i==n-1)
    			{
    				printf("%d
    ",rank );
    			}else
    			{
    				printf("%d ",rank );
    			}
    		}
    
    	}
    
        return 0;
       
    }
    

      

  • 相关阅读:
    【BZOJ2138】stone
    【ARC076F】 Exhausted
    [SDOI2018]战略游戏
    CF536D Tavas in Kansas
    [JSOI2018]战争
    ###学习《C++ Primer》- 5
    ###学习《C++ Primer》- 4
    ###Linux基础
    ###Linux基础
    ###Linux基础
  • 原文地址:https://www.cnblogs.com/acmsummer/p/4248278.html
Copyright © 2011-2022 走看看