NaiveRed's Blog

Don't Panic!

Home Archives Tags
2016-02-15
Problem Solving►UVa

UVa 12952 - Tri-du

Contents

  1. 1. Problem
  2. 2. Solution
  3. 3. Code

Problem

題目網址

給你兩張卡,找出較容易贏的卡。

Solution

輸出兩個值中的最大值。

Code

UVa 12952UVa 12952 - Tri-du
1
2
3
4
5
6
7
8
9
10
11
#include<stdio.h>
#define MAX(a,b) ((a)>(b)?(a):(b))
int main()
{
int a, b;

while (scanf("%d%d", &a, &b) != EOF)
printf("%d\n", MAX(a, b));

return 0;
}
Share Comments
  • UVa
Newer
UVa 908 - Re-connecting Computer Sites
Older
UVa 13012 - Identifying tea

Recents

  • VS Code for C and CPP
  • UVa 10158 - War
  • UVa 10528 - Major Scales
  • UVa 12908 - The book thief
  • UVa 11235 - Frequent values
  • UVa 11223 - O: dah dah dah!
  • UVa 394 - Mapmaker
  • UVa 10901 - Ferry Loading III
  • UVa 1730 - Sum of MSLCM
  • UVa 10633 - Rare Easy Problem

Categories

  • Chore2
  • Problem Solving258
    • CodeForces1
    • UVa253
    • ZeroJudge4
  • 學習筆記26
    • ML(Hung-yi Lee)13
    • Python2
    • 機器學習基石11
  • 心情隨筆2

Archives

  • May 20186
  • April 20184
  • March 201840
  • December 20177
  • March 20174
  • February 20174
  • January 20174
  • October 20161
  • September 201616
  • August 201648
  • July 201651
  • June 201618
  • May 201629
  • April 201620
  • March 201612
  • February 201621
  • January 20163
© 2020 NaiveRed
Powered by Hexo and Theme by landscape
Home Archives Tags