小白27

题目

#include <bits/stdc++.h>
//#pragma GCC optimize(2)
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long ll;

void init()
{

}

void solve()
{
    ll a,b,c;
    cin>>a>>b>>c;
    if(b*c%a==0)
        cout<<b*c/a<<endl;
    else cout<<"-1"<<endl;
}
int main() {
    int _=1;
    cin>>_;
    while(_--)
    {
        init();
        solve();
    }
    return 0;
}

题目

#include <bits/stdc++.h>
//#pragma GCC optimize(2)
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long ll;

void init() {

}

void solve() {
    long double PI = (1.0*acos(-1))/2-1;
    ll n;
    while (cin >> n) {
        //cout<<PI*(long double)(n*n)<<endl;
        long double res=PI*(long double)(n*n);
        printf("%.6Lf\n",res);
    }
}

int main() {
    int _ = 1;
    //cin>>_;
    while (_--) {
        init();
        solve();
    }
    return 0;
}

题目

#include <bits/stdc++.h>
//#pragma GCC optimize(2)
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
int mm[maxn][26];
void init() {
    memset(mm,0,sizeof(mm));
}

void solve() {
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    for(int i=0;i<s.size();i++)
    {
        //cout<<s[i];
        mm[i%k][s[i]-'a']++;
    }
    ll sum=0;
    for(int i=0;i<k;i++)
    {
        int max_=0;
        for (int j = 0; j < 26; ++j) {
            if(mm[i][j]>max_)
                max_=mm[i][j];
        }
        sum+=n/k-max_;
    }
    cout<<sum;
}

int main() {
    int _ = 1;
    //cin>>_;
    while (_--) {
        init();
        solve();
    }
    return 0;
}