百练 2000 Gold Coins

解析C语言代码:求序列和及打印操作
本文提供了一段使用C语言实现的代码示例,该代码通过读取用户输入的整数序列,并计算序列中从第一个元素到指定元素的累加和,最后输出结果。代码通过循环结构和条件判断实现输入验证和序列计算,展示了C语言的基本语法和应用。
# include <stdio.h>
int main()
{
	int n,i,j,t,sum;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)
			break;
		sum=1;t=2;i=1;
		while(i!=n)
		{	
			for(j=0;j<t;j++)
			{
				sum=sum+t;
				i++;
				if(i==n)
					break;
			}
			t++;
		}
		printf("%d %d\n",n,sum);
	}
	return 0;
}

A. 纪念品 (Souvenir) A C D E F G H 传统题 1000ms 256MiB Description Xiaowei suddenly acquires a superpower. He knows the daily prices of N N souvenirs for the next T T days. The price of a souvenir refers to the number of gold coins required to buy the souvenir or the number of gold coins that can be earned by selling a souvenir. Every day, Xiaowei can carry out the following two types of transactions any number of times: Choose a souvenir. If he has enough gold coins with him, buy the souvenir at its price for that day. Sell any souvenir he has and earn gold coins equal to the price of the souvenir for that day. The gold coins earned by selling souvenirs on a day can be used to buy souvenirs on the same day too. Similarly, souvenirs purchased on a day can also be sold for gold coins on the same day. After T T days, Xiaowei’s superpower will disappear. Therefore, he will sell all the souvenirs he still has on the T T-th day. Currently, Xiaowei has M M gold coins, and he wants to have as many gold coins as possible after the superpower disappears. What is the maximum number of gold coins he can have? Input Format The first line contains three positive integers T T, N N and M M - the number of days for which Xiaowei knows souvenir prices, the number of souvenirs, and the number of gold coins that Xiaowei currenly has. i i-th of the next T T lines contains N N positive integers P i , 1 , P i , 2 , . . . , P i , N , P i,1 ​ ,P i,2 ​ ,...,P i,N ​ , where P i , j P i,j ​ denotes the price of the j j-th souvenir on the i i-th day. Output Format Print one line containing a positive integer denoting the maximum number of gold coins Xiaowei can have after his superpower disappears. 输入数据 1 6 1 100 50 20 25 20 25 50 输出数据 1 305 The best strategy is: On the second day, spend all 100 100 gold coins to buy 5 5 units of souvenir 1 1. Sell all the 5 5 units of souvenir 1 1 on the third day and get 125 125 gold coins. Buy 6 6 units of souvenir 1 1 on the fourth day. 5 5 gold coins are left. On the sixth day, sell all souvenirs for 300 300 gold coins. On the fourth day there were 5 5 gold coins remaining, so now there are 305 305 gold coins remaining. After the superpower disappears, Xiaowei has 305 305 gold coins, which is the maximum possible. 输入数据 2 3 3 100 10 20 15 15 17 13 15 25 16 输出数据 2 217 The best strategy is: On the first day, spend all the gold coins to buy 10 10 units of souvenir 1 1. Sell all the units of souvenir 1 1 on the next day and get 150 150 gold coins. Buy 8 8 units of souvenir 2 2 and 1 1 unit of souvenir 3 3. 1 1 gold coin is remaining. On the third day, sell all souvenirs and get 216 216 gold coins. On the second day, there was 1 1 gold coin left, so in total there are 217 217 gold coins left. After the superpower disappears, Xiaowei has 217 217 gold coins, which is the maximum possible. Constraints For 10 % 10% of the data, T = 1 T=1. For 30 % 30% of the data, T ≤ 4 , N ≤ 4 , M ≤ 100 , 10 ≤ P i , j ≤ 1001 T≤4,N≤4,M≤100,10≤P i,j ​ ≤1001. For another 15 % 15% of the data, T ≤ 100 , N = 1 T≤100,N=1. For another 15 % 15% of the data, T = 2 , N ≤ 100 T=2,N≤100. For 100 % 100% of the data, T ≤ 100 , N ≤ 100 , M ≤ 10 3 , 1 ≤ P i , j ≤ 10 4 T≤100,N≤100,M≤10 3 ,1≤P i,j ​ ≤10 4 . It is guaranteed that at any time, the number of gold coins that Xiaowei has can't exceed 10 4 10 4 .
10-27
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值