摘要：
#includeint main() { int n,p,q,k; while(scanf("%d%d%d",&n,&p,&q)!=EOF) { k=n%(p+q); if(k<=p&&k!=0) printf("LOST\n"); else printf("WIN\n"); }... 阅读全文
摘要：
参考http://blog.csdn.net/xingyeyongheng/article/details/8785785#include#define ll long long#define N 20ll dp[N];//dp[N]记录长度为i的一的个数ll power(ll a) {ll sum... 阅读全文
摘要：
#include#include#define ii 1e-9double f(double x,double y) {return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x;}int main() { int t,n; double sta... 阅读全文
摘要：
#include#define mi 1e-9#define N 11000struct node{double x,y,z;}a[N];int n;double Max(double a,double b) {return a>b?a:b;}double ff(double h) { d... 阅读全文
摘要：
题目链接：http:// www.lydsy.com/JudgeOnline/problem.php?id=1026#include #include #include #include #include #include #include #include using namespace std... 阅读全文