THDC_02
F1
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,sum = 0;
cin>>n;
for(int i = 1 ; i <= n ; i++)
sum = sum + pow(-1,i)*i;
cout<<sum;
return 0;
}
F2
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a = n % 10;
n = n / 10;
int b = n % 10;
cout<<"Don vi:"<<a<<endl;
cout<<"Hang chuc:"<<b<<endl;
return 0;
}
F3
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cout<<"So MB su dung:";
cin>>n;
int s1 = 50;
int s2 = 40;
if(n <= 500)
cout<<"Cost:"<<50*n<<" USD";
if(n > 500 && n <= 900)
cout<<"Cost:"<<500*50 + (n-500)*40<<" USD";
if(n > 900)
cout<<"Cost:"<<500*50 + 400*40 + (n - 900)*30<<" USD";
return 0;
}
F4
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n , sum = 0;
cin>>n;
while(n != 0)
{
int t = n % 10;
if(t % 2 != 0)
sum = sum + t;
n = n / 10;
}
cout<<sum;
return 0;
}
F5
#include <bits/stdc++.h>
using namespace std;
long giaithua(int n)
{
int tich = 1;
for(int i = 1 ; i <= n ; i++)
tich = tich * i;
return tich;
}
int toHopChap(int n , int k)
{
return (double)giaithua(n)/(giaithua(k)*giaithua(n-k));
}
void InHeSoKhaiTrienDaThuc(int n)
{
for(int i = 0 ; i <= n ; i++)
cout<<toHopChap(n,i)<<" ";
}
int main()
{
int n,k;
cin>>n>>k;
cout<<giaithua(n)<<endl;
cout<<toHopChap(n,k)<<endl;
InHeSoKhaiTrienDaThuc(n);
return 0;
}
F6
#include <bits/stdc++.h>
using namespace std;
bool check_sochinhphuong(int n)
{
int s = sqrt(n);
if(pow(s,2) == n)
return true;
return false;
}
int main()
{
//a>
int n;
cin>>n;
int a[n];
for(int i = 0 ; i < n ; i++)
cin>>a[i];
int count = 0;
for(int i = 0 ; i < n ; i++)
{
if(a[i] >= 10 && a[i] <= 40)
count++;
}
cout<<count<<endl;
for(int i = 0 ; i < n ; i++)
{
if(check_sochinhphuong(a[i]) == 1)
cout<<a[i]<<" ";
}
return 0;
}
