GT1
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int tich = 1;
for(int i = 1 ; i <= n ; i++)
tich = tich * i;
cout<<tich;
return 0;
}
SUM1
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int sum = 0;
for(int i = 1 ; i <= n ;i++)
sum = sum + i;
cout<<sum;
return 0;
}
VL01
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
for(int i = a ; i <= b ; i++)
cout<<i<<" ";
return 0;
}
VL03
#include <bits/stdc++.h>
using namespace std;
int sum(int n)
{
int sum = 0;
for(int i = 2 ; i <= n ;i++)
sum = sum + i;
return sum;
}
int main()
{
int n;
cin>>n;
cout<<sum(n) + 2*n;
return 0;
}
VL04
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
double sum = 0;
for(int i = 2 ; i <= n ; i++)
sum = sum + (double)1/i;
cout<<fixed<<setprecision(4)<<sum;
return 0;
}
VL07
#include <bits/stdc++.h>
using namespace std;
int giaithua(int n)
{
int tich = 1;
for(int i = 1 ; i <= n ; i++)
tich = tich * i;
return tich;
}
int main()
{
int n,k;
cin>>n>>k;
cout<<(double)giaithua(n)/(giaithua(k)*giaithua(n-k));
return 0;
}
VL08
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,sum = 0;
cin>>a>>b;
for(int i = a ; i <= b ;i++)
{
if(i % 2 == 0)
sum = sum + i;
}
cout<<sum;
return 0;
}
VL09
#include <bits/stdc++.h>
using namespace std;
int giaithua(int n)
{
int tich = 1;
for(int i = 1 ; i <= n ; i++)
tich = tich * i;
return tich;
}
int main()
{
double x , sum = 0;
int n;
cin>>x>>n;
for(int i = 1 ; i <= n ;i++)
sum = sum + pow(x,i)/giaithua(i);
cout<<fixed<<setprecision(2)<<sum;
return 0;
}
VL10
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i = 0;
cin>>n;
while(n != 0)
{
int t = n % 10;
i++;
n = n / 10;
}
cout<<i;
return 0;
}
VL11
#include <bits/stdc++.h>
using namespace std;
bool check_nguyento(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 main()
{
int n;
cin>>n;
if(check_nguyento(n) == 1)
cout<<"YES";
else
cout<<"NO";
return 0;
}
VL12
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,sum=0;
cin>>n;
for(int i = 1 ; i < n ; i++)
{
if(n % i == 0)
sum = sum + i;
}
if(sum == n)
cout<<"YES";
else
cout<<"NO";
return 0;
}
VL14
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
while(1)
{
if(abs(a) > abs(b))
a = abs(a) - abs(b);
if(abs(b) > abs(a))
b = abs(b) - abs(a);
if(abs(a) == abs(b))
break;
if(a == 0 || b == 0)
break;
}
if(a == 0 || b == 0)
cout<<abs(a - b);
else
cout<<abs(a);
return 0;
}
VL15
Code:
#include <bits/stdc++.h>
using namespace std;
int UCLN(int a , int b)
{
while(1)
{
if(abs(a) > abs(b))
a = abs(a) - abs(b);
if(abs(b) > abs(a))
b = abs(b) - abs(a);
if(abs(a) == abs(b))
break;
if(a == 0 || b == 0)
break;
}
if(a == 0 || b == 0)
return abs(a - b);
else
return abs(a);
}
int main()
{
int a,b;
cin>>a>>b;
if(a == 0 && abs(b) != 0)
cout<<0;
if(b == 0)
cout<<"INVALID";
else
{
int s = a / UCLN(a,b);
int p = b / UCLN(a,b);
if(abs(p) != 1)
{
if(a > 0 && b > 0)
cout<<s<<" "<<p;
else if(a < 0 && b < 0)
cout<<abs(s)<<" "<<abs(p);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s)<<" "<<abs(p);
}
if(abs(p) == 1 && a != 0)
{
if(a > 0 && b > 0)
cout<<s;
else if(a < 0 && b < 0)
cout<<abs(s);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s);
}
}
return 0;
}
VL16
Code:
#include <bits/stdc++.h>
using namespace std;
int UCLN(int a , int b)
{
while(1)
{
if(abs(a) > abs(b))
a = abs(a) - abs(b);
if(abs(b) > abs(a))
b = abs(b) - abs(a);
if(abs(a) == abs(b))
break;
if(a == 0 || b == 0)
break;
}
if(a == 0 || b == 0)
return abs(a - b);
else
return abs(a);
}
int main()
{
int a,b;
cin>>a>>b;
if(a == 0 && abs(b) != 0)
cout<<0;
if(b == 0)
cout<<"INVALID";
else
{
int s = a / UCLN(a,b);
int p = b / UCLN(a,b);
if(abs(p) != 1)
{
if(a > 0 && b > 0)
cout<<s<<" "<<p;
else if(a < 0 && b < 0)
cout<<abs(s)<<" "<<abs(p);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s)<<" "<<abs(p);
}
if(abs(p) == 1 && a != 0)
{
if(a > 0 && b > 0)
cout<<s;
else if(a < 0 && b < 0)
cout<<abs(s);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s);
}
}
return 0;
}
VL17
Code:
#include <bits/stdc++.h>
using namespace std;
int UCLN(int a , int b)
{
while(1)
{
if(abs(a) > abs(b))
a = abs(a) - abs(b);
if(abs(b) > abs(a))
b = abs(b) - abs(a);
if(abs(a) == abs(b))
break;
if(a == 0 || b == 0)
break;
}
if(a == 0 || b == 0)
return abs(a - b);
else
return abs(a);
}
int main()
{
int a,b;
cin>>a>>b;
if(a == 0 && abs(b) != 0)
cout<<0;
if(b == 0)
cout<<"INVALID";
else
{
int s = a / UCLN(a,b);
int p = b / UCLN(a,b);
if(abs(p) != 1)
{
if(a > 0 && b > 0)
cout<<s<<" "<<p;
else if(a < 0 && b < 0)
cout<<abs(s)<<" "<<abs(p);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s)<<" "<<abs(p);
}
if(abs(p) == 1 && a != 0)
{
if(a > 0 && b > 0)
cout<<s;
else if(a < 0 && b < 0)
cout<<abs(s);
else if(a < 0 || b < 0)
cout<<"-"<<abs(s);
}
}
return 0;
}
VL18
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n != 0)
{
int t = n % 10;
cout<<t;
n = n / 10;
}
return 0;
}
VL19
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int count = 0;
for(int i = b - 1 ; i > a ; i--)
{
if(i % 3 == 0)
{
cout<<i<<" ";
count++;
}
}
if(count == 0)
cout<<"NOT FOUND";
return 0;
}
VT01
Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long num[n];
for(int i = 0 ; i < n ; i++)
cin>>num[i];
long long max = num[0];
for(int i = 0 ;i < n ;i++)
{
if(max < num[i])
max = num[i];
}
cout<<max;
return 0;
}
