笨鸟

#include using namespace std;int main(){ double a[15]; double sum=0; int i; for(i=1;i<=12;i++) { cin>>a[i]; sum+=a[i]; } cout<<"$"<<sum/12.0<<endl;}

垂直柱状图显示字母出现的频率。

I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 86518 Accepted: 37514DescriptionFred Mapper is considering purchasing some l

DescriptionA single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2...Sk. Each group Sk consists of a sequence of pos

Ugly NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20294 Accepted: 9018DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or

关于素数。

HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 101103 Accepted: 49150DescriptionHow far can you make a stack of cards overhang a table? If yo

QuicksumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13823 Accepted: 9634DescriptionA checksum is an algorithm that scans a packet of data and return

Description题目描述：大家知道，给出正整数n，则1到n这n个数可以构成n！种排列，把这些排列按照从小到大的顺序（字典顺序）列出，如n=3时，列出1 2 3，1 3 2，2 1 3，2 3 1，3 1 2，3 2 1六个排列。任务描述：给出某个排列，求出这个排列的下k个排列，如果遇到最后一个排列，则下1排列为第1个排列，即排列1 2 3…n。比如：n = 3，k

Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19035 Accepted: 10435DescriptionSome positive integers can be represente

结构体数组= =简单题

A -Sum(1.5.1)Crawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uDescriptionYour task is to find the sum of all in

HumidexTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16610 Accepted: 6041DescriptionAdapted from Wikipedia, the free encyclopediaThe humidex is a me

Specialized Four-Digit NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7310 Accepted: 5343DescriptionFind and list all four-digit numbers in deci

DoublesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19093 Accepted: 11027DescriptionAs part of an arithmetic competency program, your students will b