CodeForces 417ESquare Table【随机数】
来源:互联网 发布:美津浓跑鞋矩阵图 编辑:程序博客网 时间:2024/06/06 09:37
Description
While resting on the ship after the "Russian Code Cup" a boy named Misha invented an interesting game. He promised to give his quadrocopter to whoever will be the first one to make a rectangular table of size n × m, consisting of positive integers such that the sum of the squares of numbers for each row and each column was also a square.
Since checking the correctness of the table manually is difficult, Misha asks you to make each number in the table to not exceed 108.
Input
The first line contains two integers n and m (1 ≤ n, m ≤ 100) — the size of the table.
Output
Print the table that meets the condition: n lines containing m integers, separated by spaces. If there are multiple possible answers, you are allowed to print anyone. It is guaranteed that there exists at least one correct answer.
Sample Input
1 1
1
1 2
3 4
毫无算法可言==rand()函数是个好东西==
#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include<cstring>using namespace std;bool num[1000003];int main(){ //freopen("cin.txt","r",stdin); int n,m; memset(num,0,sizeof(num)); for(int i=0;i<=1000;i++) num[i*i]=1; while(~scanf("%d%d",&n,&m)){ int a,b,c,d; while(true){ a=rand()%100+1; b=rand()%100+1; c=rand()%100+1; d=rand()%100+1; int s1=(m-1)*a*a+b*b; int s2=(n-1)*a*a+c*c; int s3=(m-1)*c*c+d*d; int s4=(n-1)*b*b+d*d; if(num[s1]&&num[s2]&&num[s3]&&num[s4]) break; } for(int i=0;i<n-1;i++){ for(int j=0;j<m-1;j++) printf("%d ",a); printf("%d\n",b); } for(int j=0;j<m-1;j++) printf("%d ",c); printf("%d\n",d); } return 0;}
- CodeForces 417ESquare Table【随机数】
- CodeForces - 417E(随机数)
- Table CodeForces
- Codeforces 417E Square Table(随机算法)
- Codeforces 417E Square Table(随机算法)
- codeforces D. Multiplication Table
- 【CODEFORCES】 C. Table Decorations
- codeforces E Square Table
- Table Decorations CodeForces
- Codeforces Maximum in Table
- CodeForces 359A Table
- codeforces 359A Table
- Multiplication Table CodeForces
- Levko and Table CodeForces
- CodeForces 245D Restoring Table
- CodeForces 245D Restoring Table
- Codeforces 448 D. Multiplication Table
- Codeforces 448D Multiplication Table
- Mongodb数据导出工具mongoexport和导入工具mongoimport介绍
- POJ-3685Matrix
- Junit原理详解二
- mapreduce中的context类
- 实验六 磁盘调度算法
- CodeForces 417ESquare Table【随机数】
- HTML5学习之路--SVG配合js制作动画
- GlassFish移植Tips
- iOS视图间的最小距离如何在Auto Layout 下进行设置?
- Java中判断String不为空的问题
- Java设计模式_行为型_观察者模式_任意行为的监听
- Android 代码片段(一)
- iOS两个app应用之间的互相跳转
- Jquery-zTree的基本用法