投稿
  1. 高性能架构探索首页
  2. C/C++

博客几种可选代码配色方案

admin • • C/C++ • 阅读 135 
autumn
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}



emacs
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
 
colorful
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
 
perldoc
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
pastie
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
manni
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
Monokai
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
使用SyntaxHighlighter更改的配色
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}

　　

原文链接: https://www.cnblogs.com/ZhaoxiCheung/p/6915846.html

欢迎关注

微信关注下方公众号，第一时间获取干货硬货；公众号内回复【pdf】免费获取数百本计算机经典书籍

    博客几种可选代码配色方案

原创文章受到原创版权保护。转载请注明出处：https://www.ccppcoding.com/archives/254496

非原创文章文中已经注明原地址，如有侵权，联系删除

关注公众号【高性能架构探索】，第一时间获取最新文章

转载文章受原作者版权保护。转载请注明原作者出处！

赞 (0)
adminadmin
0 0
上一篇 2023年2月14日 上午8:00
下一篇 2023年2月14日 上午8:02

相关推荐