课程满意度计算

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
int n,m,ans;
int main()
{
    cin>>n>>m;
    unordered_map<int,int>hash;
    for(int i=1;i<=m;i++)//每门课程初始化
    {
        hash[i]=0;
    }
    for(int i=1;i<=n;i++)//每个同学
    {
        int A;cin>>A;//A门课
        for(int i=1;i<=A;i++)
        {
            int x;cin>>x;//课程编号
            hash[x]++;
        }
    }
    for(auto& [k,v]:hash)//遍历每一门课程
    {
        if(v == n)ans++;
    }
    cout<<ans<<endl;
    return 0;
}

有序数组去重

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
const int N = 1010;
vector<int> nums;
bool vis[N]={0};
int n,x;
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>x;
        if(!vis[x])
        {
            vis[x]=1;
            nums.push_back(x);
        }
    }
    for(auto x:nums)cout<<x<<' ';
    return 0;
}

有序序列插入一个整数

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
vector<int>nums;
int n,x;
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>x;
        nums.push_back(x);
    }
    cin>>x;
    nums.push_back(x);
    sort(nums.begin(),nums.end());
    for(auto x:nums)cout<<x<<' ';
    return 0;
}

打印质数表

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
int N;
bool is_primes(int n)
{
    if(n < 2)return false;
    
    for(int i=2;i<=n/i;i++)
    {
        if(n % i == 0)return false;
    }
    return true;
}
int main()
{
    cin>>N;
    for(int i=2;i<=N;i++)
    {
        if(is_primes(i))cout<<i<<' ';
    }
    return 0;
}

斗兽棋

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
string g,t;
struct str
{
    string str1,str2,str3;
}strs;
int main()
{
    str s[8]={{"elephant","tiger","tiangou yiwusuoyou"},{"tiger","elephant","tiangou txdy"},
             {"tiger","cat","tiangou yiwusuoyou"},{"cat","tiger","tiangou txdy"},
             {"cat","mouse","tiangou yiwusuoyou"},{"mouse","cat","tiangou txdy"},
             {"mouse","elephant","tiangou yiwusuoyou"},{"elephant","mouse","tiangou txdy"}};
    
    cin>>g>>t;
    for(int i=0;i<8;i++)
    {
        if(g == s[i].str1 && t == s[i].str2)
        {
            cout<<s[i].str3<<endl;
            return 0;
        }
    }
    cout<<"tiangou yiwusuoyou"<<endl;
    return 0;
}

笨小猴 HASH

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
string s;
unordered_map<char,int> hashtable;
bool is_primes(int x)
{
    if(x < 2)return false;
    for(int i=2;i<=x/i;i++)
    {
        if(x % i == 0)
        {
            return false;
        }
    }
    return true;
}
int main()
{
    cin>>s;
    for(int i=0;i<s.size();i++)
    {
        hashtable[s[i]]++;
    }
    int min=111111,max=0;
    for(auto& [k,v]:hashtable)
    {
        if(v < min)
        {
            min = v;
        }
        if(v > max)
        {
            max = v;
        }
    }
    if(is_primes(max-min))
    {
        cout<<"Lucky Word"<<endl<<max-min<<endl;
    }
    else
    {
        cout<<"No Answer"<<endl<<0<<endl;
    }
    return 0;
}

潜伏者

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<int,int> PII;
string A,B,C;
unordered_map<char,char>hashtable;
bool flag=true;
int main()
{
    getline(cin,A);
    getline(cin,B);
    getline(cin,C);
    for(int i=0;i<A.size();i++)
    {
        if(hashtable[A[i]] == '\0')
        {
            hashtable[A[i]] =B[i];
        }
        else if(hashtable[A[i]] != B[i])
        {
            flag=false;
            break;
        }
    }
    int mp[5000]={0};
    for(int i='A';i<='Z';i++)
    {
        if(mp[hashtable[i]])return !printf("Failed");
        else
        {
            mp[hashtable[i]]=1;
        }
    }
    if(hashtable.size() != 26 || !flag)
    {
        cout<<"Failed"<<endl;
    }
    else
    {
        for(int i=0;i<C.size();i++)
        {
            cout<<hashtable[C[i]];
        }
    }
    return 0;
}