int main(){
scanf("%d%d", &N, &M);
rep(i, 1, N) rep(j, 1, M) scanf("%d", a[i] + j);
per(j, M, 1) per(i, N, 1) ans[i][j] = std::min(calc(i, j), a[i][j]);
rep(i, 1, N) rep(j, 1, M) printf(j == M ? "%d\n" : "%d ", ans[i][j]);
return 0;
}
int main()
{
int m = 0;
int n = 0;
printf("Enter the numbers m and n. Please, do m + n < 1000: ");
scanf("%d %d", &m, &n);
int lengthMas = m + n;
int *mas = new int[lengthMas];
for(int i = 0; i < lengthMas; i++)
mas[i] = rand();
for(int i = 0; i < lengthMas; i++)
printf("%d, ", mas[i]);
printf("\n");
per(mas, 0, m-1);
per(mas, m, lengthMas-1);
per(mas, 0, lengthMas-1);
for(int i = 0; i < lengthMas; i++)
printf("%d, ", mas[i]);
printf("\n");
delete[] mas;
return 0;
}
static void print_stats(
struct task* t,
struct st_event_record *release,
struct st_event_record *completion)
{
int64_t lateness;
u64 response;
lateness = completion->data.completion.when;
lateness -= release->data.release.deadline;
response = completion->data.completion.when;
response -= release->data.release.release;
if (want_ms)
printf(" %5u, %5u, %10.2f, %10.2f, %8d, %10.2f, %10.2f,%7d\n",
release->hdr.pid,
release->hdr.job,
nano_to_ms(per(t)),
nano_to_ms(response),
lateness > 0,
nano_to_ms(lateness),
lateness > 0 ? nano_to_ms(lateness) : 0,
completion->data.completion.forced);
else
printf(" %5u, %5u, %10llu, %10llu, %8d, %10lld, %10lld,%7d\n",
release->hdr.pid,
release->hdr.job,
(unsigned long long) per(t),
(unsigned long long) response,
lateness > 0,
(long long) lateness,
lateness > 0 ? (long long) lateness : 0,
completion->data.completion.forced);
}
int main(){
long long int n,m,r,p,q,q1,q2;
while(scanf("%lld %lld",&m,&n)!=EOF){
if(m==0&&n==0)
break;
p=m*n;
q1=per(p);
q2=per(p-2);
q=q1/q2;
printf("%lld\n",q);
}
return 0;
}
int main(int argc,char *argv[])
{
//1-soclet
int fd_listen = socket (AF_INET,SOCK_STREAM,0);
printf("listen\n");
per(fd_listen);
//2-bind
struct sockaddr_in seraddr;
memset(&seraddr,0,sizeof(seraddr));
seraddr.sin_family = AF_INET;
seraddr.sin_port = htons(SERVER_PORT);
seraddr.sin_addr.s_addr = inet_addr(SERVER_IP);
int judge = bind(fd_listen,(const struct sockaddr*)&seraddr,sizeof(seraddr));
printf("bind\n");
per(judge);
//3-listen
judge = listen(fd_listen,5);
per(judge);
printf("listen finish\n");
//4-int accept(int sockfd, struct sockaddr *addr, socklen_t *addrlen); it's a block fun
int fd_client;
while(1){
struct sockaddr_in clientaddr;
socklen_t len = sizeof(clientaddr);
memset(&clientaddr,0,sizeof(clientaddr));
fd_client = accept(fd_listen,\
(struct sockaddr*)&clientaddr,&len);
printf("fdclient = %d \n",fd_client);
per(fd_client);
printf("%s: %d connect!\n",\
inet_ntoa(clientaddr.sin_addr),\
ntohs(clientaddr.sin_port));
if(fork()==0)
{
close(fd_listen);
child_main(fd_client);
exit(0);
}
}
//5- print the server info
//6-recv
close(fd_client);
}
void permutationset ( int n, std::vector<std::vector<int>>* set, std::vector<int>* sign, bool out ){
if ( n<= 0 ) return;
std::vector<int> per (n );
for ( int i = 0;i<n;i++)per[i]= i+1;
int k, l, swap, s = 0;
for(;;){
set->push_back ( per );
sign->push_back ( s%2 == 0?1:-1 );
for ( k = n-1;k>0 && per[k-1]>per[k];k--);
if ( k == 0 ) if(!out )return;else break;
for ( l = n-1;l>= k && per[k-1]>per[l];l--);
if ( l>= k ){
swap = per[k-1], per[k-1]= per[l], per[l]= swap, s++;
for ( l = n-1;k<l;k++, l--){
swap = per[k], per[k]= per[l], per[l]= swap, s++;
}
}
}
out = true;
if ( true ){
for ( int i = 0;i<set->size ();i++){
for ( int j = 0;j<n;j++){
std::cout << (*set )[i][j] ;
}
std::cout << ' ' << (*sign )[i] <<std::endl;
}
}
}
int main( int argc, char* argv[] )
{
//! [Creating a Convolutional code]
//! [Creating a Convolutional code structure]
//! [Creating a trellis]
/*
We are creating a trellis structure with 1 input bit.
The constraint length is 4, which means there are 3 registers associated
with the input bit.
There are two output bits, the first one with generator 4 (in octal) associated
with the input bit.
*/
fec::Trellis trellis({4}, {{013, 017}}, {015});
//! [Creating a trellis]
/*
The trellis is used to create a code structure.
We specify that one bloc will conatins 1024 branches before being terminated.
*/
auto options = fec::Convolutional::Options(trellis, 1024);
options.termination(fec::Convolutional::Tail);
options.algorithm(fec::Approximate);
//! [Creating a Convolutional code structure]
/*
A code is created and ready to operate
*/
std::unique_ptr<fec::Codec> codec(new fec::Convolutional(options));
//! [Creating a Convolutional code]
std::cout << per(codec, 3.0) << std::endl;
return 0;
}
int main(int argc,char *argv[])
{
int fd_client = socket(AF_INET,SOCK_STREAM,0);
//connect
struct sockaddr_in seraddr;
memset(&seraddr,0,sizeof(seraddr));
seraddr.sin_family = AF_INET;
seraddr.sin_port = htons(SER_PORT);
seraddr.sin_addr.s_addr = inet_addr(SER_IP);
int judge = connect (fd_client,\
(struct sockaddr*)&seraddr,sizeof(seraddr));
printf("connet\n");
per(judge);
//send
char p[1024] = "";
/*
int *parr = (int *)calloc(1024*100,sizeof(int));
int recvn = recv(fd_client,parr,1024*400,0);
int sendn = send(fd_client,parr,...)
大数据量下的发送会丢失、接收会丢失。因此高速传输是要考虑的问题
加入缓冲区？
*/
while(1){
memset(p,0,1024);
read(0,p,1024);
send(fd_client,p,strlen(p),0);
recv(fd_client,p,1024,0);
printf("from server: %s\n",p);
}
close(fd_client);
return 0;
}
int main(int argc, char **argv)
{
int ch;
int i,j;
if( argc != 3){
printf("Usage: list limit numberofvairations\n"
" list 20 4 \n");
exit(0);
}
LIMIT = atoi(argv[1]);
NOVAR = atoi(argv[2]);
// printf(" Limit = %d\t NOVAR = %d\n", LIMIT, NOVAR);
arr = (char *)malloc(sizeof(NOVAR));
if( arr == 0 ){
perror("Unable to allocate memory\n");
exit(EXIT_FAILURE);
}
for( i = 0; i < NOVAR; i++ ) {
arr[i] = '0' + i;
}
pch = (char *)malloc(sizeof(LIMIT));
if( pch == 0 ){
perror("Unable to allocate memory\n");
exit(EXIT_FAILURE);
}
per(0);
free(pch);
free(arr);
}
vector<int> nth_permutation(int cnt, int n) {
vector<int> idx(cnt), per(cnt), fac(cnt);
rep(i,0,cnt) idx[i] = i;
rep(i,1,cnt+1) fac[i - 1] = n % i, n /= i;
for (int i = cnt - 1; i >= 0; i--)
per[cnt - i - 1] = idx[fac[i]],
idx.erase(idx.begin() + fac[i]);
return per; }
static void print_task_info(struct task *t)
{
if (want_ms)
printf("# task NAME=%s PID=%d COST=%.2f PERIOD=%.2f CPU=%d\n",
tsk_name(t),
t->pid,
nano_to_ms(exe(t)),
nano_to_ms(per(t)),
tsk_cpu(t));
else
printf("# task NAME=%s PID=%d COST=%lu PERIOD=%lu CPU=%d\n",
tsk_name(t),
t->pid,
(unsigned long) exe(t),
(unsigned long) per(t),
tsk_cpu(t));
}
vector<vector<int>> permute(vector<int>& nums) {
if(nums.size() == 0)
return ans;
sort(nums.begin(),nums.end());
vis.resize(nums.size());
per(nums);
return ans;
}
int main(void)
{
int fd;
char *buf;
unsigned int p = 0xdccae000 - 0xc0000000;
fd = open("/dev/mem", O_RDWR);
if (fd == -1)
per("open");
buf = mmap(0, PAGE_SIZE, PROT_READ|PROT_WRITE, MAP_SHARED, fd, p);
if (buf == MAP_FAILED)
per("mmap");
puts(buf);
munmap(buf, PAGE_SIZE);
close(fd);
return 0;
}
int main(void)
{
int fd;
unsigned char buf[11];
unsigned int p =0x1ccb8000;
buf[10] = 0;
fd = open("/dev/mem", O_RDWR);
if (fd == -1)
per("open");
if (p != lseek(fd, p, SEEK_SET))
per("lseek");
if (read(fd, buf, 10) < 0)
per("read");
printf("%x\n", (unsigned int)(0xff & buf[0]));
printf("%x\n", (unsigned int)(0xff & buf[1]));
return 0;
}
long long int per(long long int x){
int y;
if(x==1)
return 1;
else{
y=x*per(x-1);
return y;
}
}
int main()
{
char *palabras[] = {"a","b","c","d","e",
"f","g","h","i","j", "k", "l", "m","n",
"o", "p", "q", "r", "s","t","u", "v", "w",
"x", "y", "z"};
int s = sizeof(palabras)/sizeof(palabras[0]);
per(palabras,s);
muestraArreglo(palabras,s);
return 0;
}
// get an item at a specified position of the list (retrieve)
ItemType List::get(int index)
{
ItemType dataItem;
bool success = (index >= 1) && (index <= size);
if (success)
{
Person per(items[index - 1].getName(), items[index - 1].getTel());
dataItem = per;
}
return dataItem;
}
vec project_to_plane(const vec& r, const vec& normal) {
pvecerror("vec project_to_plane(const vec& r, const vec& normal)");
vec per(normal || r);
if (per == dv0) {
// either one of vectors is 0 or they are parallel
return dv0;
}
vec ax = unit_vec(per || normal);
vfloat v = ax * r;
return v * ax;
}
bool
CCardOperatorBase::isBiggerStraight(const list<int>& lstPer, const list<int>& lstNow){
list<int> per(lstPer);
list<int> now(lstNow);
per.pop_front();
now.pop_front();
int perVal = getValue(per.front());
int nowVal = getValue(now.front());
return nowVal > perVal;
}
bool logic::insertPerson(string& name, string& gender, int& born, int& death)
{
bool dataExisted = false;
people per(name,gender,born,death);
if (checkIfpersonOnList(per))
dataExisted = true;
else
theData.insertPersonToDatabase(per);
return dataExisted;//Returns true if person is already on the list.
}
int main()
{
int m = 0;
printf("Input m ");
scanf("%d", &m);
int mas[11];
for (int i = 0; i < 11; ++i) {
mas[i] = i + 1;
printf("%d, ", mas[i]);
}
printf("\n");
per(mas, 0, m - 1);
per(mas, m, 10);
per(mas, 0, 10);
for (int i = 0; i < 11; ++i) {
printf("%d, ", mas[i]);
}
return 0;
}
void per(int i)
{
int j;
if( i == LIMIT ){
printf("%s\n",pch);
return;
}
for(j=0;j<NOVAR;j++){
pch[i] = arr[j];
per(i+1);
}
}
//@ Main Function
int main() {
fac[0] = 1;
rep(i, 1, maxn) fac[i] = fac[i-1] * i % mod;
inv[maxn-1] = csl::pow(1LL, fac[maxn-1], mod-2, mod);
per(i, 1, maxn) inv[i-1] = inv[i] * i % mod;
int _, __ = 0;
for (scanf("%d", &_); _; _--) {
printf("Case #%d: ", ++__);
ll n, m, k;
scanf(i64 i64 i64, &n, &m, &k);
printf(i64 "\n", solve(n, m, k));
}
return 0;
}
AxisRotate::AxisRotate(const QImage &im, const int newW, const int newH): image(im)
{
mx.fill(0.0);
my.fill(0.0);
mz.fill(0.0);
per.fill(0.0);
minusTran.fill(0.0);
tran.fill(0.0);
minusTran(0,0) = minusTran(1,1) = minusTran(2,2) = minusTran(3,3) =
tran(0,0) = tran(1,1) = tran(2,2) = tran(3,3) = 1.0;
mx(0,0)=mx(1,1)=mx(2,2)=mx(3,3)=1.0;
my(0,0)=my(1,1)=my(2,2)=my(3,3)=1.0;
mz(0,0)=mz(1,1)=mz(2,2)=mz(3,3)=1.0;
move(0,0)=move(1,1)=move(2,2)=move(3,3)=1.0;
move(0,3)=newW/2-im.width()/2;
move(1,3)=newH/2-im.height()/2;
minusTran(0,3) = im.width()/2.0;
minusTran(1,3) = im.height()/2.0;
//minusTran(2,3) = 0;
nw = newW;
nh = newH;
tran(0,3) = -im.width() /2.0;
tran(1,3) = -im.height()/2.0;
//tran(2,3) = 0;
per(0,0) = per(1,1) = per(3,3) = 1.0;
per(3,2) = 1.0/-200.0;
rotatedImage = NULL;
}
void per(vector <int> & nums) {
if(v.size() == nums.size()) {
ans.push_back(v);
return;
}
for(int i = 0;i < nums.size();i++) {
if(vis[i] != 1 && last != nums[i]) {
vis[i] = 1;
v.push_back(nums[i]);
per(nums);
last = *(v.rbegin());
v.pop_back();
vis[i] = 0;
}
}
}
int main() {
// for a simple second test
// let's just output in a csv our kernels over 2D surfaces
CovMat<2> eye;
eye << 1, 0,
0, 1;
FeatVec<2> mean;
mean << 2, 2;
const std::vector<double> std_params = {1.0, 1.0, 1.0};
const std::vector<double> lin_params = {-2.0, 1.0, 1.0};
KernExpression<2> se(se_generator<2>(std_params), mean, eye);
KernExpression<2> per(per_generator<2>(std_params), mean, eye);
KernExpression<2> lin(lin_generator<2>(lin_params), mean, eye);
KernExpression<2> rq(rq_generator<2>(std_params), mean, eye);
auto& se_x_per = se * per;
auto& se_x_lin = se * lin;
auto& per_x_lin = per * lin;
auto& per_p_lin = per + lin;
auto& se_p_per = se + per;
std::ofstream se_dump("../../data-plots/se.csv");
std::ofstream per_dump("../../data-plots/per.csv");
std::ofstream lin_dump("../../data-plots/lin.csv");
std::ofstream rq_dump("../../data-plots/rq.csv");
std::ofstream se_x_per_dump("../../data-plots/se_x_per.csv");
std::ofstream se_x_lin_dump("../../data-plots/se_x_lin.csv");
std::ofstream per_x_lin_dump("../../data-plots/per_x_lin.csv");
std::ofstream per_p_lin_dump("../../data-plots/per_p_lin.csv");
std::ofstream se_p_per_dump("../../data-plots/se_p_per.csv");
test_2d_expression(se, se_dump, 100, 4);
test_2d_expression(per, per_dump, 100, 4);
test_2d_expression(lin, lin_dump, 100, 4);
test_2d_expression(rq, rq_dump, 100, 4);
test_2d_expression(se_x_per, se_x_per_dump, 100, 4);
test_2d_expression(se_x_lin, se_x_lin_dump, 100, 4);
test_2d_expression(se_p_per, se_p_per_dump, 100, 4);
test_2d_expression(per_x_lin, per_x_lin_dump, 100, 4);
test_2d_expression(per_p_lin, per_p_lin_dump, 100, 4);
return 0;
}
int main(int argc, char* argv[])
{
vector<int> ary;
// for(int i=0; i<3; i++)
// {
// ary.push_back(i);
// }
ary.push_back(1);
ary.push_back(1);
ary.push_back(2);
ary.push_back(2);
Permulation per(ary);
per.Run();
printf("Hello World!\n");
return 0;
}
//@ Main Function
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int _, __ = 1;
for(std::cin >> _; _; --_, ++__) {
//std::cout << "Case #" << __ << ": ";
int n, m, p; cin >> n >> m >> p;
fac[0] = 1;
rep(i, 1, p) fac[i] = fac[i-1] * i % p;
inv[p-1] = csl::pow(ll(1), fac[p-1], p-2, ll(p));
per(i, 1, p) inv[i-1] = inv[i] * i % p;
cout << lucas(n + m, m, p) << endl;
}
return 0;
}
SPROUT_CXX14_CONSTEXPR ::perceptron<FloatType, In, Hid, Out>
make_trained_perceptron() {
// random number generator
sprout::random::default_random_engine rng(SPROUT_UNIQUE_SEED);
// perceptron
::perceptron<FloatType, In, Hid, Out> per(rng);
// training
per.train(
train_data.begin(), train_data.end(),
teach_data.begin(), teach_data.end(),
500, 0.1
);
return per;
}
main()
{
int a;
printf("Enter the no :");
scanf("%d",&a);
if(pal(a))
printf("The no is palindrome .\n");
if(fiba(a))
printf("The no is fibanocci .\n");
if(pri(a))
printf("The no is prime .\n");
if(arm(a))
printf("The no is armstrong .\n");
if(per(a))
printf("The no is perfect .\n");
return 0;
}
