AtCoder Beginner Contest 205

AtCoder Beginner Contest 205

A - kcal

题意：

题解：

代码：

#include 

#define int long long
#define debug(x) cout << #x << " = " << x << endl;
using namespace std;

inline int read() {
   
   int s = 0, w = 1;
   char ch = getchar();
   while (ch < '0' || ch > '9') {
   if (ch == '-') w = -1; ch = getchar();}
   while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
   return s * w;
}

int const MAXN = 2e5 + 10;
int n, m, T;

signed main() {
   
    cin >> n >> m;
    cout << m * 1.0 / 100 * n << endl;
    return 0;
}

B - Permutation Check

题意：

题解：

代码：

#include 

#define int long long
#define debug(x) cout << #x << " = " << x << endl;
using namespace std;

inline int read() {
   
   int s = 0, w = 1;
   char ch = getchar();
   while (ch < '0' || ch > '9') {
   if (ch == '-') w = -1; ch = getchar();}
   while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
   return s * w;
}

int const MAXN = 2e5 + 10;
int n, m, T;

signed main() {
   
    set<int> s;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
   
        int t;
        cin >> t;
        s.insert(t);
    }
    if (s.size() != n) cout << "No";
    else cout << "Yes";
    return 0;
}

C - POW

题意：

题解：

代码：

#include 

// #define int long long
#define debug(x) cout << #x << " = " << x << endl;
using namespace std;

inline int read() {
   
    int s = 0, w = 1;
    char ch = getchar()