开发者社区云计算文章正文

uva10783 Odd Sum

2023-08-04 35

版权

本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。

简介： uva10783 Odd Sum

#include <cstdio>usingnamespacestd;
intmain()
{
inttests;
scanf("%d", &tests);
for (inti=0; i<tests; i++)
    {
inta, b;
scanf("%d%d", &a, &b);
if (!(a&1))
a++;
if (!(b&1))
b--;
intnum= (b-a) /2+1;
printf("Case %d: %d/n", i+1, (a+b) *num/2);
    }
return0;
}

kgduu

xindoo

8月前

算法

uva 10891 game of sum

题目链接详细请参考刘汝佳《算法竞赛入门经典训练指南》 p67

xindoo

15 0 0

爱编程的大李子

UVA524素数环 Prime Ring Problem

爱编程的大李子

77 0 0

谙忆

HDOJ(HDU) 1977 Consecutive sum II(推导、、)

谙忆

89 0 0

yexx

算法

[LeetCode]--39. Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimit

yexx

1002 0 0

yexx

[LeetCode]--40. Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the

yexx

1268 0 0

yexx

[LeetCode]--15. 3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not

yexx

1235 0 0

yexx

[LeetCode]--404. Sum of Left Leaves

Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 15 respective

yexx

951 0 0

yexx

Java

[LeetCode]--371. Sum of Two Integers

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. Credits: Special thanks to @fujiaozhu for addin

yexx

1130 0 0

yexx

[LeetCode]--263. Ugly Number

Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ug

yexx

829 0 0

yexx

[LeetCode]--112. Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tr

yexx

1218 0 0

uva10783 Odd Sum

热门文章

最新文章

相关电子书