博客几种可选代码配色方案-白红宇

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

阅读量：5331 次

发布时间：2019-06-15

本文共 7221 字，大约阅读时间需要 24 分钟。

autumn #include
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
     
      using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
      
       
         >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
      
       using namespace std;const int maxn = 200005;int p[maxn],a[maxn],b[maxn];bool vis[maxn];set
       
        
          >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;}