cf #327 Div.2 Problem A Wizards' Duel
来源:互联网 发布:淘宝刷欢乐豆原理2017 编辑:程序博客网 时间:2024/06/04 19:47
#include <iostream>#include <cstdio>using namespace std;int main(){ int l,p,q; scanf("%d%d%d",&l,&p,&q); double ans; ans=(double)l*1.0/(p+q)*p; printf("%lf\n",ans); return 0;}
0 0
- cf #327 Div.2 Problem A Wizards' Duel
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- Codeforces Round #327 (Div. 2) A. Wizards' Duel 反思
- Codeforces Round #327 (Div. 2) (A. Wizards' Duel 简单数学)
- Codeforces Round #327 (Div. 2) A. Wizards' Duel
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- Codeforces Round #327 (Div. 2) A. Wizards' Duel(水)
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- A. Wizards' Duel
- CodeForces-591A Wizards' Duel
- Codeforces 591A Wizards' Duel
- Codeforces 591A Wizards' Duel
- codeforces 591A Wizards' Duel
- 大水题--CodeForces - 591A Wizards' Duel
- Code Forces 591 A. Wizards' Duel(水~)
- cf#320 Div.2 Problem C A Problem about Polyline
- cf#320 Div.2 Problem C A Problem about Polyline
- cf #327 Div.2 Problem B Rebranding
- 通过拼音来搜索对应的汉字字段
- 什么是MySql数据库
- 【算法】n皇后问题
- Response详解
- Android应用开发编译框架流程与IDE及Gradle概要
- cf #327 Div.2 Problem A Wizards' Duel
- codeforces #38E
- last -- 列出目前与过去登录系统的用户相关信息
- cf #327 Div.2 Problem B Rebranding
- ServletContext
- 机器学习算法学习三:K-means聚类
- putty教程以及plink的知识(转)
- Android中获取CPU序列号
- javascript 自定义进度条