codeforces 66 D. Petya and His Friends(数论)
来源:互联网 发布:盗梦空间limbo 知乎 编辑:程序博客网 时间:2024/05/21 10:37
给定n,要求给出n个数,是的任意两数不互质,但所有数的最大公约数为1
很简单,所有数的最大公约数为1只需三个数最大公约数为1,假设a,b,c为素数,设第一个数为ab,第二个数为ac,第三个数为bc,则这三个数最大公约数已经为1,那么剩下的数只要满足与他们不互质即可,不妨令以后的数为 bc*i(i>1),则问题已解。
#include<cstdio> #include<cstring> #include<cmath> #include<cstdlib> #include<iostream> #include<algorithm> #include<vector> #include<map> #include<queue> #include<stack> #include<string>#include<map> #include<set>using namespace std; #define LL long long int main() { int n; cin>>n; if(n<=2) cout<<-1<<endl; else { cout<<6<<endl; cout<<15<<endl; for(int i=1;i<=n-2;i++) cout<<10*i<<endl; } return 0; }
0 0
- codeforces 66 D. Petya and His Friends(数论)
- codeforces 66D D. Petya and His Friends( 数论+构造)
- CodeForces 66 D.Petya and His Friends(构造+数论+高精度)
- Codeforces 66 D Petya and His Friends(找规律)
- CodeForces 66D - Petya and His Friends(构造)
- CF 66D Petya and His Friends
- CF 61 div2 D. Petya and His Friends
- [数论] Codeforces 516E. Drazil and His Happy Friends
- [数论] Codeforces 819D R #421 D.Mister B and Astronomers & 516E R #292 E. Drazil and His Happy Friends
- CodeForces - 515B Drazil and His Happy Friends
- codeforces 515B B. Drazil and His Happy Friends(模拟)
- codeforces#292B_Drazil and His Happy Friends-暴力水题
- codeforces 111B B. Petya and Divisors(数论)
- Codeforces 439D Devu and his Brother
- Codeforces 439D Devu and his Brother
- CodeForces 439D Devu and his Brother
- Codeforces 689D Friends and Subsequences(二分+RMQ)
- Codeforces 689D Friends and Subsequences(二分+RMQ)
- cocos2dx 按钮随按下切换图标
- 俄罗斯方块
- WORD VBA 操作WORD 文本框
- Unity客户端框架笔记(状态模式和策略模式在游戏中的应用)
- 参数化查询 但未提供该参数(将null插入数据库)
- codeforces 66 D. Petya and His Friends(数论)
- nyoj 117 求逆序数【线段树 树状数组 归并排序】
- java实现自动编号系统(类似于word中自动编号)
- Linux cp命令
- functor 是什么?
- LintCode-乱序字符串
- css与div的一些属性使用
- 6.12
- 二叉查找树的表示javascript