HDOJ 1090

#include "stdio.h"
#include "stdlib.h"

int num;

int main(void)
{
	int i, j, k;
	while(scanf("%d", &num) != EOF)
	{
		for(k=0; k<num; k++)
		{
			scanf("%d %d", &i, &j);
			printf("%d\n", i+j);
		}
	}

	system("pause");
	return 0;
}

时间： 2024-08-29 13:12:19

HDOJ 1090的相关文章

【HDOJ 4764】 Stone (博弈)

[HDOJ 4764] Stone (博弈) Stone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1090 Accepted Submission(s): 761 Problem Description Tang and Jiang are good friends. To decide whose treat it is

HDOJ 题目分类

HDOJ 题目分类 /* * 一:简单题 */ 1000: 入门用:1001: 用高斯求和公式要防溢出1004:1012:1013: 对9取余好了1017:1021:1027: 用STL中的next_permutation()1029:1032:1037:1039:1040:1056:1064:1065:1076: 闰年 1084:1085:1089,1090,1091,1092,1093,1094, 1095, 1096:全是A+B1108:1157:1196:1

day1 hdoj 1089-1096题解

首先步入ACM的学习,不得不强烈推荐一套视频 https://space.bilibili.com/3071253#! 这位up主的视频很符合我这种没学过c++,c语言数组还不很懂,hdoj按顺序刷的想骂人的菜鸡首先基本输入输出格式即1089-1096题下面给出代码,原题请自己搜索 1089 #include<stdio.h> int main() { int a,b; while(scanf("%d%d",&a,&b)!=EOF) printf(&

【HDOJ】4328 Cut the cake

将原问题转化为求完全由1组成的最大子矩阵.挺经典的通过dp将n^3转化为n^2. 1 /* 4328 */ 2 #include <iostream> 3 #include <sstream> 4 #include <string> 5 #include <map> 6 #include <queue> 7 #include <set> 8 #include <stack> 9 #include <vector>

POJ Xiangqi 4001 && HDOJ 4121 Xiangqi

题目链接(POJ):http://poj.org/problem?id=4001 题目链接(HDOJ):http://acm.hdu.edu.cn/showproblem.php?pid=4121 Xiangqi Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1108 Accepted: 299 Description Xiangqi is one of the most popular two-player boa

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

HDOJ 4901 The Romantic Hero

DP....扫两遍组合起来 The Romantic Hero Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 547 Accepted Submission(s): 217 Problem Description There is an old country and the king fell in love with a

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]