PT001
Code C
#include <stdio.h>
int main(){
int a,b;
scanf("%d%d", &a, &b);
printf("%d", a+b);
return 0;
}
Code C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
scanf("%d%d", &a, &b);
printf("%d", a+b);
return 0;
}
PT002
CODE C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
double x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
cout<<fixed<<setprecision(4)<<sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
return 0;
}
CODE C
#include <stdio.h>
#include <math.h>
int main()
{
double x1,y1,x2,y2;
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
printf("%.4lf",sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)));
return 0;
}
PT004
CODE C
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d", &a, &b);
if((a * b) % 2 != 0)
printf("Odd");
else
printf("Even");
return 0 ;
}
CODE C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if((a * b) % 2 != 0)
cout<<"Odd";
else
cout<<"Even";
return 0 ;
}
PT005
#include <iostream>
using namespace std;
int main()
{
//n la so nut that
int n,year,month,day;
cin>>n;
if(n >= 30 && n < 365)
{
month = n /30;
day = n % 30;
if(month >= 1 && day >= 1)
{
cout<<month<<" months"<<endl;
cout<<day<<" days"<<endl;
}
else if(month >= 1)
cout<<month<<" months"<<endl;
}
else if(n >=1 && n < 30)
cout<<n<<" days"<<endl;
else if(n >= 365)
{
year = n / 365;
month = (n % 365) / 30;
day = (n % 365) % 30;
if(year >= 1 && month >= 1 && day >= 1)
{
cout<<year<<" years"<<endl;
cout<<month<<" months"<<endl;
cout<<day<<" days"<<endl;
}
else if(year >= 1 && month >= 1)
{
cout<<year<<" years"<<endl;
cout<<month<<" months"<<endl;
}
else if(year >= 1 && day >= 1)
{
cout<<year<<" years"<<endl;
cout<<day<<" days"<<endl;
}
else if(month >= 1 && day >= 1)
{
cout<<month<<" months"<<endl;
cout<<day<<" days"<<endl;
}
else if(year >= 1)
cout<<year<<" years"<<endl;
}
return 0;
}
PT006
CODE C
#include <stdio.h>
int main(){
int xi,yi;
scanf("%d%d", &xi, &yi);
if(xi > 0 && yi > 0)
printf("The coordinate point (%d, %d) lies in the I quandrant.", xi, yi);
else if(xi < 0 && yi > 0)
printf("The coordinate point (%d, %d) lies in the II quandrant.", xi, yi);
else if(xi < 0 && yi < 0)
printf("The coordinate point (%d, %d) lies in the III quandrant.", xi, yi);
else if(xi > 0 && yi < 0)
printf("The coordinate point (%d, %d) lies in the IV quandrant.", xi, yi);
else
printf("The coordinate point (%d, %d) lies at the origin.", xi, yi);
return 0 ;
}
C++
#include <bits/stdc++.h
int main()
{
int xi,yi;
cin>>xi>>yi;
if(xi > 0 && yi > 0)
cout<<"The coordinate point ("<<xi<<","<<yi<<") lies in the I quandrant.";
else if(xi < 0 && yi > 0)
cout<<"The coordinate point ("<<xi<<","<<yi<<") lies in the II quandrant.";
else if(xi < 0 && yi < 0)
cout<<"The coordinate point ("<<xi<<","<<yi<<") lies in the III quandrant.";
else if(xi > 0 && yi < 0)
cout<<"The coordinate point ("<<xi<<","<<yi<<") lies in the IV quandrant.";
else
cout<<"The coordinate point ("<<xi<<","<<yi<<") lies at the origin.";
return 0 ;
}
PT007
#include <bits/stdc++.h>
using namespace std;
int main()
{
float a,b,c;
cin>>a>>b>>c;
if( a > 0 && b > 0 && c > 0)
{
if(a == b && b == c && a == c)
cout<<"Tam giac deu"<<endl;
else if(a == b || b == c || a == c )
cout<<"Tam giac can"<<endl;
else
cout<<"Tam giac thuong"<<endl;
}
return 0;
}
PT008
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
float a,b,c;
scanf("%f%f%f", &a, &b, &c);
float x1,x2;
float delta = b*b - 4*a*c;
//ax^2 + bx + c = 0
if(a == 0)
{
//bx+c=0
if(b == 0 && c == 0)
printf("\n");
else if(b == 0)
printf("\n No solution");
else
printf("\n", -c/b);
}
else
{
if(delta == 0)
printf("\n %.4f", -b/2*a);
else if(delta < 0)
printf("\nNo solution");
else
{
x1 = (-b + sqrt(delta)) / (2*a);
x2 = (-b - sqrt(delta)) / (2*a);
printf("\n%.4f", x1);
printf("\n%.4f", x2);
}
}
return 0;
}
PT009
#include <bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b>>c;
if(a+b > c && a + c > b && b + c > a)
cout<<fixed<<setprecision(6)<<sqrt(((a+b+c)/2)*(((a+b+c)/2)-a)*(((a+b+c)/2)-b)*(((a+b+c)/2)-c));
else
cout<<"No Solution";
return 0 ;
}
PT010
Cách 1:
#include<stdio.h>
int main (){
int T;
scanf("%d",&T);
float a1,b1,c1,a2,b2,c2;
float D,Dx,Dy;
for (int i =0;i < T;i++){
scanf("%f%f%f%f%f%f",&a1,&b1,&c1,&a2,&b2,&c2);
D = a1*b2-a2*b1;
Dx = c1*b2-c2*b1;
Dy = a1*c2-a2*c1;
if (D == 0){
if(Dx==0 && Dy==0) printf("Many solutions\n");
else printf("No solution\n");
}
else printf ("%.6f %.6f\n",Dx/D,Dy/D);
}
return 0;
}
Cách 2:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
if(t >= 1 && t <= 10)
{
double a1,b1,c1,a2,b2,c2,d,dx,dy;
for(int i = 1 ; i <= t ; i++)
{
cin>>a1>>b1>>c1>>a2>>b2>>c2;
d = a1*b2 - a2*b1;
dx = c1*b2 - c2*b1;
dy = a1*c2 - a2*c1;
if(d == 0)
{
if(dx == 0 && dy == 0)
{
cout<<"Many solutions"<<endl;
}
else
{
cout<<"No solution"<<endl;
}
}
else
{
cout<<fixed<<setprecision(6)<<dx/d<<" "<<fixed<<setprecision(6)<<dy/d<<endl;
}
}
}
}
Cách 3:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int count = 0 ;
int t;
cin>>t;
if(t >= 1 && t <= 10)
{
do
{
float a1,b1,c1,a2,b2,c2;
cin>>a1>>b1>>c1>>a2>>b2>>c2;
float d = a1*b2 - a2*b1;
float dx = c1*b2 - c2*b1;
float dy = a1*c2 - a2*c1;
if(d == 0)
{
if(dx + dy == 0)
{
cout<<"Many solutions"<<endl;
}
else
{
cout<<"No solution"<<endl;
}
}
else
{
cout<<fixed<<setprecision(6)<<dx/d<<" "<<fixed<<setprecision(6)<<dy/d<<endl;
}
count++;
}while(count != t);
}
}
PT011
#include <stdio.h>
#include <math.h>
int main()
{
const float PI = 3.14159;
float a,b,d;
scanf("%f%f%f", &a, &b, &d);
printf("\n%.4f",(float)1/2*a*b*sin((d * PI) / 180));
}
PT012
Cách 1:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string name[]={"January","February","March","April","May","June","July","August","September","October","November","December"};
if(n>=1 && n <= 12)
{
cout<<name[n-1];
}
else
{
cout<<"invalid Month number!";
}
}
Cách 2:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int thang;
cin >> thang;
switch(thang)
{
case 1:
cout << "January";
break;
case 2:
cout << "February";
break;
case 3:
cout << "March";
break;
case 4:
cout << "April";
break;
case 5:
cout << "May";
break;
case 6:
cout << "June";
break;
case 7:
cout << "July";
break;
case 8:
cout << "August";
break;
case 9:
cout << "September";
break;
case 10:
cout << "October";
break;
case 11:
cout << "November";
break;
case 12:
cout << "December";
break;
default:
cout << "invalid Month number!";
break;
}
return 0;
}
PT013
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
if(n >= 1)
{
for(int i = 0;i < n;i++)
{
cin>>num[i];
}
int count=0;
for(int i=0;i<n;i++)
{
int k = num[i];
if(k % 3 == 0 || k % 7 == 0)
{
count++;
}
}
cout<<count;
}
}
PT014
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
if(n > -1 && n <= 30)
{
long long tich1 = 1 , tich2 = 1;
for(int i = 1 ; i <= n ;i++)
{
if(i % 2 == 0)
{
tich1 = tich1 * i;
}
else
{
tich2 = tich2 * i;
}
}
if(n % 2 == 0)
{
cout<<tich1;
}
else if(n % 2 != 0)
{
cout<<tich2;
}
else if( n == 1 || n == 0)
{
n == 1;
cout<<n;
}
}
}
PT015
#include <bits/stdc++.h>
using namespace std;
int main()
{
int m,n;
cin>>m;
for(int k = 0 ; k < m ; k++)
{
cin>>n;
for(int i = 0 ; i <= n ; i++)
{
for(int j = 1 ; j < i ; j++)
{
cout<<"*"<<" ";
}
cout<<endl;
cout<<endl;
}
for(int i = 1 ; i <= n ; i++)
{
for(int j = n ; j >= i ; j--)
{
cout<<"*"<<" ";
}
cout<<endl;
cout<<endl;
}
}
return 0;
}
PT016
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
int year[N];
for(int i = 0; i < N; i++)
{
cin>>year[i];
}
int count = 0;
int k;
for(int i = 0; i < N; i++)
{
k = year[i];
if(k % 19 == 0 || k % 19 == 3 || k % 19 == 6 || k % 19 == 9 || k % 19 == 11 || k % 19 == 14 || k % 19 == 17)
{
count++;
}
}
cout<<count;
}
PT017
#include <bits/stdc++.h>
using namespace std;
short tach(int n)
{
short k , s = 0;
while(n != 0)
{
k = n % 10;
s = s + k;
n = n / 10;
}
return s;
}
int main()
{
int n,j;
cin>>n;
int a,b,sum = 0;
cin>>a>>b;
if(n >= 1 && n <= 10000)
{
if(a >= 1 && b <= 36 && a <= b)
{
for(short i = 1; i <= n ; i++)
{
j = i;
int t = tach(j);
if(t >= a && t <= b)
{
sum = sum + i;
}
}
cout<<sum<<endl;
}
}
}
PT018
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a;
int i = 0 ;
cin>>n;
if(n == 0)
{
i++;
}
while(n != 0)
{
a = n % 10;
if(a % 2 == 0)
{
i++;
}
n = n / 10;
}
cout<<i<<endl;
}
PT019
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a;
cin>>n;
int i = 0;
while(n != 0)
{
a = n % 10;
if(a % 2 != 0)
{
i++;
}
n = n / 10;
}
cout<<i<<endl;
}
PT020
#include <bits/stdc++.h>
using namespace std;
int tongtach(int n)
{
int a,sum = 0;
while(n != 0)
{
a = n % 10;
sum = sum + a;
n = n / 10;
}
return sum;
}
int main()
{
int n, tong = 0;
cin>>n;
for(int i = 0 ; i <= n ; i++)
{
if(tongtach(i) % 10 == 9)
{
tong++;
}
}
cout<<tong;
}
PT021
#include <bits/stdc++.h>
using namespace std;
int tongchan(long long n)
{
int a,sum = 0;
long long k;
if(n >= 0)
k = n;
else
k = -n;
while(k != 0)
{
a = k % 10;
if(a % 2 == 0)
sum = sum + a;
k = k / 10;
}
return sum;
}
int main()
{
int t;
cin>>t;
if(t <= 20)
{
for(int i = 1 ; i <= t ; i++)
{
long long n;
cin>>n;
cout<<tongchan(n)<<endl;
}
}
}
PT022
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
if(t >= 1 && t <= 10)
{
unsigned int n;
for(int i = 1 ; i <= t ; i++)
{
cin>>n;
if(n > 0)
{
if(n % 4 == 0 && n % 100 != 0 || n % 400 == 0)
{
cout<<"leap year"<<endl;
}
else
{
cout<<"none"<<endl;
}
}
}
}
}
PT023
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >>n;
for(int j = 1; j <= n; j++){
if (j%2==1){
for(int i = 1; i <= j; i+=2){
cout << 1;
if(i==j)
break;
cout << 0;
}
}
else if(j%2==0){
for(int i = 1; i <= j; i+=2){
cout << 0;
if(i==j)
break;
cout << 1;
}
}
cout << endl;
}
return 0;
}
PT024
#include <iostream>
using namespace std;
void conver(int n)
{
if(n > 0)
{
int t = n % 2;
conver(n/2);
cout<<t;
}
}
int main()
{
int n;
cin>>n;
conver(n);
}
PT025
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a <= b)
{
if(a > 0 && b > 0)
cout<<"Positive";
else if(a < 0 && b > 0)
cout<<"Zero";
else if(a < 0 && b < 0)
{
int count = 0;
for(int i = a ; i <= b ; i++)
{
count++;
}
if(count % 2 == 0)
cout<<"Positive";
else
cout<<"Negative";
}
}
}
PT026
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a <= b)
{
if(a > 0 && b > 0)
cout<<"Positive";
else if(a < 0 && b > 0)
cout<<"Zero";
else if(a < 0 && b < 0)
{
int count = 0;
for(int i = a ; i <= b ; i++)
{
count++;
}
if(count % 2 == 0)
cout<<"Positive";
else
cout<<"Negative";
}
}
}
PT027
#include <bits/stdc++.h>
using namespace std;
string viethoa(string k)
{
for (int i = 0; i < k.size(); i++)
{
if (k[i] >= 'a' && k[i] <= 'z')
{
k[i] -= 32;
}
}
return k;
}
int main()
{
string s[]={"ABSINT","BEER"," BRANDY","CHAM-PAGNE","GIN","RUM","SAKE","TEQUILA","VODKA","WHISKEY","WINE"};
string age[]={"1","2","3","4","5","6","7","8","9","10","11","12","13","14","15","17","18"};
int n;
string k;
cin>>n;
string num[n];
for(int i = 0 ; i < n ;i++)
{
cin>>num[i];
}
int count = 0;
for(int i = 0 ; i < n ;i++)
{
for(int j = 0 ; j < 16 ; j++)
{
if(s[j] == viethoa(num[i]) || age[j] == num[i])
count++;
}
}
cout<<count;
return 0 ;
}
PT028
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[3]={2,3,5};
int a = num[0], b = num[1], c = num[2];
bool K;
for(int i = 2 ; i <= n ; i++)
{
if(n % i == 0)
{
if(i % a == 0 || i % b == 0 || i % c == 0)
K = true;
else
{
K = false;
break;
}
}
}
if( K == true || n == 1)
cout<<"YES";
else
cout<<"NO";
}
PT029
PT030
PT031
PT032
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,n,s = 0, i = 0,k;
cin>>a>>b>>n;
while(1)
{
k = a - b;
s = s + k;
i++;
if((n-s) <= a)
{
i++;
break;
}
}
cout<<i;
}
PT033
#include <bits/stdc++.h>
using namespace std;
int main()
{
float n,m,p;
cin>>n>>m>>p;
/*
n la so tien ban dau
m la ty so lai suat
p la so tien mong muon
*/
cout<<ceilf((log10(p/n)/log10(1+(m/100))));
}
PT034
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n , sum = 0;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
cin>>num[i];
for(int i = 0 ; i < n ; i++)
{
int a =num[i];
int k = a % 10;
a = a / 10;
sum = sum + pow(a,k);
}
cout<<sum;
return 0;
}
PT035
#include <bits/stdc++.h>
using namespace std;
int sum(int n)
{
int sum = 0;
for(int i = 1 ; i < n ; i++)
{
if(n % i == 0)
sum = sum + i;
}
return sum;
}
int main()
{
int n;
cin>>n;
if(n <= sum(n))
cout<<"YES";
else
cout<<"NO";
}
PT036
PT037
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin>>n;
int num[n];
for(int i = 0; i < n ; i++)
{
cin>>num[i];
}
int min = num[0];
for(int i = 0 ; i < n ; i++)
{
if(min > num[i])
{
min=num[i];
}
}
cout<<min<<endl;
}
PT038
PT039
#include <bits/stdc++.h>
using namespace std;
const int MIN = 1;
void inputArray(int num[10000],int n)
{
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
}
bool songuyento(int n)
{
int count = 0;
for(int i = 1 ; i <= n ; i++)
{
if(n % i == 0)
count++;
}
if(count == 2)
return true;
return false;
}
int maxsonguyento(int num[10000], int n)
{
int max = MIN;
for(int i = 0 ; i < n ; i++)
{
if(num[i] > max)
{
if(num[i] > max && songuyento(num[i]))
max = num[i];
}
}
if( max == MIN)
return 0;
else
return max;
}
int main()
{
int num[10000];
int n;
cin>>n;
inputArray(num,n);
if(maxsonguyento(num , n) == 0)
cout<<" ";
else
cout<<maxsonguyento(num , n);
}
PT040
#include <bits/stdc++.h>
using namespace std;
int count(int n)
{
int i = 0;
while(n != 0)
{
int t = n % 10;
i++;
n = n / 10;
}
return i;
}
int mux(int k , int n)
{
int tich = 1;
for(int i = 1 ; i <= n ;i++)
{
tich = tich * k;
}
return tich;
}
int ArmstrongNumber(int n)
{
int k = count(n), sum = 0;
while(n != 0)
{
int t = n % 10;
int s = mux(t,k);
sum = sum + s;
n = n / 10;
}
return sum;
}
int main()
{
int n;
cin>>n;
if(n <= 20)
{
for(int i = 0 ; i < n ; i++)
{
if(i == ArmstrongNumber(i))
cout<<i<<" ";
}
}
return 0;
}
PT041
#include <bits/stdc++.h>
using namespace std;
int lucasNumber(int n)
{
if(n == 0)
return 2;
if(n == 1)
return 1;
return lucasNumber(n - 1) + lucasNumber(n - 2);
}
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
for(int i = 0 ; i < n ;i++)
{
cout<<lucasNumber(num[i])<<endl;
}
}
PT042
#include <bits/stdc++.h>
using namespace std;
int count(int n)
{
int i = 0,k;
while(n != 0)
{
k = n % 10;
i++;
n = n / 10;
}
return i;
}
int sum(int n)
{
int k,z,sum = 0;
while(n != 0)
{
k = n % 10;
z = count(n);
sum = sum + pow(k,z);
n = n / 10;
}
return sum;
}
int main()
{
int n;
cin>>n;
if(n == sum(n))
cout<<"YES";
else
cout<<"NO";
}
PT043
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
for(int i=0;i<n;i++)
{
cin>>num[i];
}
int sum=0;
for(int i=0;i<n;i++)
{
sum = sum + num[i];
}
cout<<sum;
return 0;
}
PT044
#include <bits/stdc++.h>
using namespace std;
int songuyento(int n)
{
if (n < 2)
return 0;
for (int i = 2; i <= sqrt(n); i++)
if (n%i == 0)
return 0;
return 1;
}
int main()
{
int m;
cin>>m;
for(int j = 1 ; j <= m ; j++)
{
if(songuyento(j))
{
cout<<j<<" ";
}
}
}
PT045
#include <bits/stdc++.h>
using namespace std;
bool chinhphuong(int n)
{
int k = sqrt(n);
if(k*k == n)
return true;
return false;
}
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
int MIN = 10000;
for(int i = 0 ; i < n ; i++)
{
int flag = chinhphuong(num[i]);
if(flag == 1)
{
if(MIN > num[i])
MIN = num[i];
}
}
cout<<MIN;
return 0;
}
PT046
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
for(int i = 0 ; i < n ; i++)
{
int k = num[i];
if(k >= 5 && k <= 7)
{
cout<<k<<" ";
}
}
}
PT047
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
int max = num[0];
for(int i = 0 ; i < n ; i++)
{
if(max < num[i])
{
max = num[i];
}
}
cout<<max<<" ";
int count = 0;
for(int i = 0 ; i < n ; i++)
{
if(max == num[i])
{
count++;
}
}
cout<<count;
}
PT047
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
bool k;
for(int i = 0 ; i < n ;i++)
{
if(num[i] > num[i+1])
{
k = false;
break;
}
else
k = true;
}
if(k == 1)
cout<<"Yes";
else
cout<<"No";
return 0;
}
PT049
PT050
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
if(n >= 1)
{
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
int sum = 0;
for(int i =0 ; i < n ; i++)
{
sum = sum + num[i];
}
cout<<fixed<<setprecision(4)<<(float)sum/n;
}
}
PT051
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long num[n];
if(n >= 2 && n <= 100)
{
for(long long i = 0 ; i < n ; i++)
{
cin>>num[i];
}
long long max = num[0];
for(long long i = 0 ; i < n ; i++)
{
if(max < num[i])
{
max = num[i];
}
}
long long min = num[0];
for(long long i = 0 ; i < n ; i++)
{
if(min > num[i])
{
min = num[i];
}
}
cout<<max - min;
}
}
PT052
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
int min = num[0];
for(int i = 0 ; i < n ;i++)
{
if(min > num[i])
min = num[i];
}
int max = num[0];
for(int i = 0 ; i < n ; i++)
{
if(max < num[i])
max = num[i];
}
int a,b,count1 = 0,count2 = 0;
for(int i = 0 ; i < n ; i++)
{
if(count1 < 1)
{
if(max == num[i])
{
a = i;
count1++;
}
}
if(count2 < 1)
{
if(min == num[i])
{
b = i;
count2++;
}
}
}
if((a-b) < 0)
cout<<-(a - b);
else
cout<<a-b;
return 0;
}
PT055
#include <bits/stdc++.h>
using namespace std;
long long LucasNumber(int n)
{
if(n == 0)
return 2;
if(n == 1)
return 1;
if(n >= 2)
return LucasNumber(n - 1) + LucasNumber(n - 2);
}
int main()
{
int n;
cin>>n;
if(n >= 1 && n <= 80)
{
for(int i = 0 ; i <= n ; ++i)
{
cout<<LucasNumber(i)<<" ";
}
}
}
PT056
PT060
#include <bits/stdc++.h>
using namespace std;
int NumberA135370(int n)
{
if(n == 1)
return 1;
if(n % 2 == 0)
return n + NumberA135370(n - 1);
if(n % 2 != 0)
return 2 * n + NumberA135370(n - 1);
}
int main()
{
int n;
cin>>n;
cout<<NumberA135370(n)<<" ";
}
PT060
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
if(m >= 1 && n >= m)
{
float num[n];
for(int i = 0 ; i < n ; i++)
{
cin>>num[i];
}
for(int i = 0 ; i < n - 1 ; i++)
{
for(int j = i + 1 ; j < n ; j++)
{
if(num[i] < num[j])
{
float t = num[i];
num[i] = num[j];
num[j] = t;
}
}
}
float sum = 0;
for(int i = 0 ; i < m ; i++)
{
sum = sum + num[i];
}
cout<<fixed<<setprecision(1)<<sum<<endl;
}
}
