Codeforces 743C Vladik and fractions(数学)
来源:互联网 发布:新日铁住金软件 编辑:程序博客网 时间:2024/05/17 04:51
题意:给定 n 值,输出符合的 x, y, z 。
思路:
即 x = n, y = n+1, z = n*(n+1)
ac code:
#include<stdio.h>#include<cstring>#include<cmath>#include<algorithm>#define HardBoy main()#define ForMyLove return 0;using namespace std;const int MYDD = 1103;int HardBoy {int n;scanf("%d", &n);if(n == 1){puts("-1");} else {printf("%d %d %d\n", n, n+1, n*(n+1)); } ForMyLove}
0 0
- codeforces 743 C. Vladik and fractions (数学)
- Codeforces 743C Vladik and fractions(数学)
- 【44.64%】【codeforces 743C】Vladik and fractions
- codeforces 743 C. Vladik and fractions(构造)
- 743C. Vladik and fractions codeforces
- CodeForces-743C Vladik and fractions(构造)
- 【Codeforces 743C Vladik and fractions】
- codeforce 743 C. Vladik and fractions (数学构造)
- Codeforces 743C-Vladik and fractions(构造)
- codeforces 743-C. Vladik and fractions(构造)
- Codeforces Round #384(Div. 2)C. Vladik and fractions【数学】
- 数学题(Vladik and fractions,743C)
- Codeforces Round #384 (Div. 2) 743C Vladik and fractions
- Codeforces Round #384 (Div. 2) C Vladik and fractions
- Codeforces Round #384 (Div. 2)-C. Vladik and fractions
- Codeforces Round #384 (Div. 2) C. Vladik and fractions
- Codeforces Round #384 (Div. 2) C. Vladik and fractions
- codeforces #384 Vladik and fractions (构造算法)
- 一个简单的信号量
- Java集合框架基础——List泛型
- 注解@PostConstruct与@PreDestroy讲解及实例
- spingmvc 文件下载打包zip
- Linux上的ftp配置,及错误500 OOPS: could not bind listening IPv4 socket解决
- Codeforces 743C Vladik and fractions(数学)
- 程序员面试金典: 9.1数组与字符串 3判断一个字符串字符重新排列后是否可变成另一个字符串
- mybatis一对一关联关系
- android 5.0机上INSTALL_FAILED_DUPLICATE_PERMISSION错误的解决办法
- 好用的工具集合
- linux怎么查看连接的创建时间
- IDEA建maven项目,默认创建src目录
- 1141
- 自定义Toast