cf(#div1 B. Dreamoon and Sets)(数论)
2014-10-15 09:24
204 查看
B. Dreamoon and Sets
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Dreamoon likes to play with sets, integers and
View Code
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Dreamoon likes to play with sets, integers and
#include<cstdio> #include<cstring> using namespace std; const int maxn=10005; __int64 ans[maxn][4]; void work() { __int64 k=1; for(int i=0;i<10000;i++) { ans[i][0]=k++; ans[i][1]=k++; ans[i][2]=k++; ans[i][3]=++k; k+=2; } } int main() { int n,k; work(); while(scanf("%d%d",&n,&k)!=EOF) { printf("%I64d\n",ans[n-1][3]*k); for(int i=0;i<n;i++) printf("%I64d %I64d %I64d %I64d\n",ans[i][0]*k,ans[i][1]*k,ans[i][2]*k,ans[i][3]*k); } return 0; }
View Code
相关文章推荐
- cf(#div1 A. Dreamoon and Sums)(数论)
- Codeforces Round #272 (Div. 1) A. Dreamoon and Sums(数论)
- Codeforces Round #272 (Div. 2) D. Dreamoon and Sets 构造
- CF——#181 (Div. 2) C(数论)
- Codeforces Round #272 (Div. 2) D Dreamoon and Sets(构造)
- Codeforces Round #272 (Div. 2) D. Dreamoon and Sets (思维 数学 规律)
- CF 359C Prime Number(数论)
- [Codeforces Round #357 DIV2D (CF681D)] Gifts by the List
- 【CF】Codeforces Round #124 (Div. 2) 197A Plate Game
- CF 17D - Notepad(数论取模+欧拉函数)
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) Problem F (Codeforces 831F) - 数论 - 暴力
- POJ Sumdiv (数论+二分等比数列求和)
- CF 179(div2) C(线段树 || 扫描法 )
- CF 172(div2) D(单调队列)
- CF 171(div2)A
- CF 170(div2)B
- CF Round #324 (Div2) D. Dima and lisa
- Dreamoon and Sets CodeForces - 476D(规律,思路题)
- CF 451 div2 A - E 题解
- CF 375(div 2) F题