Bài 1 Tính tổng bình phương các số lẻ từ 1 đến n
#include<stdio.h>
#include<conio.h>
main()
{
int i,s=0,n;
printf("Nhap n:");
Bài 1 Tính tổng bình phương các số lẻ từ 1 đến n
#include<stdio.h>
#include<conio.h>
main()
{
int i,s=0,n;
printf("Nhap n:");
#include <stdio.h> | |
int main(){ | |
int m,n; | |
int a[100][100]; | |
printf("\nNhap so hang, so cot: "); | |
scanf("%d%d", &m, &n); | |
// Nhap mang 2 chieu | |
for(int i = 0;i < m;i++){ | |
for(int j = 0; j < n;j++){ |
#include <bits/stdc++.h> | |
#define _for(i,a,b) for (int i=(a),_b_=(b);i<_b_;i++) | |
#define _fod(i,a,b) for (int i=(a),_b_=(b);i>_b_;i--) | |
#define _it(i,v) for (typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i) | |
#define _all(v) v.begin(), v.end() | |
#define __(v) memset(v,0,sizeof(v)) | |
#define fi first | |
#define se second | |
#define arrayin(a,n) for(int i=0;i<n;i++) cin>>a[i]; |
#include <bits/stdc++.h> | |
#define fi first | |
#define se second | |
#define _all(v) v.begin(), v.end() | |
#define __(v) memset(v,0,sizeof(v)) | |
#define arrayin(a,n) for(int i=0;i<n;i++) cin>>a[i]; | |
#define _for(i,a,b) for (int i=(a),_b_=(b);i<_b_;i++) | |
#define _fod(i,a,b) for (int i=(a),_b_=(b);i>_b_;i--) | |
#define arrayout(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" ";cout<<"\n"; |
import sys | |
import gensim | |
from gensim.models import word2vec | |
def w2v(s1, s2, wordmodel): | |
if s1 == s2: | |
return 1.0 |
sudo su | |
# Java | |
yum -y install java-1.8.0-openjdk-devel | |
# Build Esentials (minimal) | |
yum -y install gcc gcc-c++ kernel-devel make automake autoconf swig git unzip libtool binutils | |
# Extra Packages for Enterprise Linux (EPEL) (for pip, zeromq3) | |
yum -y install epel-release |
#include <iostream> | |
#include <conio.h> | |
#include <math.h> | |
using namespace std; | |
// Hang so e | |
// Duoc dung neu F(x) = 0 co chua e. |
#include <iostream> | |
#include <math.h> | |
using namespace std; | |
// the Euler constant | |
const double e = 2.718281828459; |
username: [email protected]
password:Hieu_761319
username: root