poj 1003 1004 1005水

最新推荐文章于 2022-02-21 23:07:16 发布

yeqm_

最新推荐文章于 2022-02-21 23:07:16 发布

阅读量329

点赞数

分类专栏：水文章标签： poj 水

本文链接：https://blog.csdn.net/yeqm_/article/details/49588803

版权

水专栏收录该内容

8 篇文章 0 订阅

订阅专栏

#include<iostream>  
#include<map>
#include<string>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =2005;
const  int  mod = 10007;
int n,m;

//#define _DEBUG_ 1;

int main()    
{  
#ifdef _DEBUG_
	fstream fin("G:/1.txt");
#else
#define fin cin
#endif
	float c;
	while(fin>>c,c){
		int i =1;
		float sum = (float)1/(i+1);
		while(sum<c){
			i++;
			sum+=(float)1/(i+1);
		}
		printf("%d card(s)\n",i);
	}
	return 0;
}

</pre><pre name="code" class="cpp">#include<iostream>  
#include<map>
#include<string>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =2005;
const  int  mod = 10007;
int n,m;
//
//#define _DEBUG_ 1;


int main()    
{  
#ifdef _DEBUG_
<span style="white-space:pre">	</span>fstream fin("G:/1.txt");
#else
#define fin cin
#endif
<span style="white-space:pre">	</span>float sum=0,tmp;
<span style="white-space:pre">	</span>FOR(i,1,12){
<span style="white-space:pre">		</span>fin>>tmp;
<span style="white-space:pre">		</span>sum+=tmp;
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>sum/=12;
<span style="white-space:pre">	</span>printf("$%.2f\n",sum);
<span style="white-space:pre">	</span>return 0;
}

#include<iostream>  
#include<map>
#include<string>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =2005;
const  int  mod = 10007;
int n,m;
//
//#define _DEBUG_ 1;

int main()    
{  
#ifdef _DEBUG_
	fstream fin("G:/1.txt");
#else
#define fin cin
#endif
	float a,b;int t;
	fin>>t;
	FOR(i,1,t){
		fin>>a>>b;
		float s = 3.1415926*(sqr(a)+sqr(b))/100;
		int base = s;
		if(s>base)
			base+=1;
		printf("Property %d: This property will begin eroding in year %d.\n",i,base);
	}
	printf("END OF OUTPUT.");
	return 0;
}