Đê 2
Bài 1:
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int M,N,K;
cin>>M>>N>>K;
// 1 phong k giuong
int s,p;
if(M % K == 0 && N % K == 0 )
{
s = M / K;
p = N / K;
cout<<s+p;
}
if(M % K != 0 || N % K != 0)
{
if(N % K != 0 && M % K != 0)
{
s = M / K + 1;
p = N / K + 1;
cout<<s+p;
}
else if(M % K != 0)
{
s = M / K + 1;
p = N / K;
cout<<s+p;
}
else if(N % K != 0)
{
s = M / K;
p = N / K + 1;
cout<<s+p;
}
}
return 0;
}
Bài 2:
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b;
cout<<"Seri A:";
cin>>a;
cout<<"Seri B:";
cin>>b;
int s1 = a % 1000000000;
int s2 = s1 % 10;
int s3 = (s1/10)%10;
int s4 = a % 10;
int s5 = (a / 10) % 10;
int s6 = (a % 100000) % 10;
int s7 = b % 1000000000;
int s8 = s7 % 10;
int s9 = (s7/10)%10;
int s10 = b % 10;
int s11 = (b / 10) % 10;
int s12 = (b % 100000) % 10;
int sum2 = s2 + s3 + s4 + s5 + s6;
int sum1 = s8 + s9 + s10 + s11 + s12;
if(sum1 > sum2)
cout<<"A Win and B Lost";
if(sum1 < sum2)
cout<<"A Lost and B Win";
if(sum1 == sum2)
cout<<"A Draw B";
return 0;
}
Bài 3:
Code:
#include <bits/stdc++.h>
using namespace std;
int count(int n)
{
int j = 0;
while(n != 0)
{
int t = n % 10;
j++;
n = n / 10;
}
return j;
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i = 0 ; i < n ; i++)
cin>>a[i];
int d = 0 , b = 0 , c = 0;
for(int i = 0 ; i < n ; i++)
{
if(a[i] % 2 == 0)
d++;
if(a[i] % 3 == 0 || a[i] % 5 == 0)
b++;
if(count(abs(a[i])) == 3)
c++;
}
cout<<d<<endl;
cout<<b<<endl;
cout<<c<<endl;
return 0;
}
