poj 1003 1004 1005水
2015-11-02 16:53
423 查看
#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;
}
相关文章推荐
- 强烈的求知欲望
- 买楼10大误解
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1001
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points
- POJ-2409-Let it Bead&&NYOJ-280-LK的项链
- POJ-1695-Magazine Delivery-dp
- POJ1523 SPF dfs
- POJ-1001 求高精度幂-大数乘法系列
- POJ-1003 Hangover
- POJ-1004 Financial Management
- 用单调栈解决最大连续矩形面积问题
- 2632 Crashing Robots的解决方法
- 1573 Robot Motion (简单题)
- POJ 1200 Crazy Search(简单哈希)
- 【高手回避】poj3268,一道很水的dijkstra算法题