Codeforces Round #384 (Div. 2)(数学)
来源:互联网 发布:台湾中视直播软件 编辑:程序博客网 时间:2024/05/14 11:33
C. Vladik and fractions
time limit per test:1 second
memory limit per test:256 megabytes
input:standard input
output:standard output
Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can represent fraction as a sum of three distinct positive fractions in form .
Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that . Because Chloe can’t check Vladik’s answer if the numbers are large, he asks you to print numbers not exceeding 109.
If there is no such answer, print -1.
Input
The single line contains single integer n (1 ≤ n ≤ 104).
Output
If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 109, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.
If there are multiple answers, print any of them.
Examples
Input
3
Output
2 7 42
Input
7
Output
7 8 56
题解:2/n=1/n+1/n,那我们让其中一个是n,原问题就变成了1/n=1/x+1/y,通分变形一下(x-n)(y-n)=n*n,那我们让x-n=1,y-n=n*n即可,由于x,y,z要不同,所以当n是1的时候是不行的。
#include <bits/stdc++.h>#define ll long longusing namespace std;int main(){ ll n; cin>>n; if(n==1) { printf("-1\n"); } else printf("%I64d %I64d %I64d\n",n,n+1,n*(n+1));}
- Codeforces Round #384 (Div. 2)(数学)
- Codeforces Round #384(Div. 2)C. Vladik and fractions【数学】
- Codeforces Round #281 (Div. 2)E(数学)
- Codeforces Round #188 (Div. 2) A(数学划分)
- Codeforces Round #340 (Div. 2)(B) 数学
- Codeforces Round #341 (Div. 2)(B)数学
- Codeforces Round #342 (Div. 2)(A)贪心,数学
- Codeforces Round #246 (Div. 2)(B)数学
- Codeforces Round #246 (Div. 2)(C)数学,思维
- Codeforces Round #349 (Div. 2)-A. Pouring Rain(数学)
- Codeforces Round #353 (Div. 2)-B. Restoring Painting(数学)
- Codeforces Round #360 (Div. 2) D. Remainders Game(数学)
- Codeforces Round #298 (Div. 2) -- Polycarpus' Dice (数学推理)
- Codeforces Round #244 (Div. 2) E. Police Patrol(数学)
- Codeforces Round #428 (Div. 2) ( 组合数学)
- Codeforces Round #440 (Div. 2,)-数学&规律- Maximum splitting
- Codeforces Round #224 (Div. 2)(数学、dfs)
- Codeforces Round #282 (Div. 2) B.(数学)
- 机器学习入门(12)--线性回归之正规方程
- 第十六周5
- 第十六周OJ(3)学生信息排序
- poj 2002_Squares_hash
- 第十六周 项目1-(4)堆排序
- Codeforces Round #384 (Div. 2)(数学)
- 【读书笔记】循环引用(reference cycles)的问题
- 同步/异步 & 阻塞/非阻塞
- 机器学习入门(13)--逻辑回归(1)
- 会场安排问题
- 最小二乘法拟合球面源代码(matlab)
- Android绘图Canvas十八般武器之Shader详解及实战篇(上)
- 局域网连接sql--SQL Server 2008
- javascript笔记:自己写一个jqgrid框架(一)