2482 AC程序

#include<iostream>
using namespace std;
int main(){
    cout<<"1:  0,0->2,1->4,2->3,4->4,6->2,7->4,8\n2:  0,0->2,1->4,2->3,4->1,5->3,6->4,8\n3:  0,0->2,1->4,2->3,4->1,5->2,7->4,8\n4:  0,0->2,1->4,2->2,3->4,4->3,6->4,8\n5:  0,0->2,1->4,2->2,3->4,4->2,5->4,6->2,7->4,8\n6:  0,0->2,1->4,2->2,3->4,4->2,5->0,6->2,7->4,8\n7:  0,0->2,1->4,2->2,3->3,5->2,7->4,8\n8:  0,0->2,1->4,2->2,3->1,5->3,6->4,8\n9:  0,0->2,1->4,2->2,3->1,5->2,7->4,8\n10:  0,0->2,1->4,2->2,3->0,4->2,5->4,6->2,7->4,8\n11:  0,0->2,1->4,2->2,3->0,4->2,5->0,6->2,7->4,8\n12:  0,0->2,1->3,3->2,5->4,6->2,7->4,8\n13:  0,0->2,1->3,3->2,5->0,6->2,7->4,8\n14:  0,0->2,1->3,3->1,4->3,5->2,7->4,8\n15:  0,0->2,1->3,3->1,4->0,6->2,7->4,8\n16:  0,0->2,1->1,3->3,4->4,6->2,7->4,8\n17:  0,0->2,1->1,3->3,4->1,5->3,6->4,8\n18:  0,0->2,1->1,3->3,4->1,5->2,7->4,8\n19:  0,0->2,1->1,3->2,5->4,6->2,7->4,8\n20:  0,0->2,1->1,3->2,5->0,6->2,7->4,8\n21:  0,0->2,1->0,2->2,3->4,4->3,6->4,8\n22:  0,0->2,1->0,2->2,3->4,4->2,5->4,6->2,7->4,8\n23:  0,0->2,1->0,2->2,3->4,4->2,5->0,6->2,7->4,8\n24:  0,0->2,1->0,2->2,3->3,5->2,7->4,8\n25:  0,0->2,1->0,2->2,3->1,5->3,6->4,8\n26:  0,0->2,1->0,2->2,3->1,5->2,7->4,8\n27:  0,0->2,1->0,2->2,3->0,4->2,5->4,6->2,7->4,8\n28:  0,0->2,1->0,2->2,3->0,4->2,5->0,6->2,7->4,8\n29:  0,0->2,1->0,2->1,4->3,5->2,7->4,8\n30:  0,0->2,1->0,2->1,4->0,6->2,7->4,8\n31:  0,0->1,2->3,3->2,5->4,6->2,7->4,8\n32:  0,0->1,2->3,3->2,5->0,6->2,7->4,8\n33:  0,0->1,2->3,3->1,4->3,5->2,7->4,8\n34:  0,0->1,2->3,3->1,4->0,6->2,7->4,8\n35:  0,0->1,2->2,4->3,6->4,8\n36:  0,0->1,2->0,4->2,5->4,6->2,7->4,8\n37:  0,0->1,2->0,4->2,5->0,6->2,7->4,8\n";
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int a[1025],b[1025],c[1025];
void ct(string tree,int type) {

}
bool ch() {

}
int main(int argc, char** argv) {
    int n;
    cin>>n;
    string tree,tree2;
    while(n!=0) {
        cin>>tree;
        ct(tree,1);
        while(n>0) {
            n--;
            cin>>tree2;
            ct(tree2,2);
            if(ch())
                cout<<"YES\n";
            else 
                cout<<"NO\n";
        }
        cin>>n;
    }
    return 0;
}

传送门

https://aiqicha.baidu.com/company_detail_24897477451532

https://hanyu-word-gif.cdn.bcebos.com/bdd9f862d04c94a6d93ff119244ea85ba.gif

二分查找第一个比X大的数

太水了

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n+1];
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    int n1;
    scanf("%d",&n1);
    for(int i=1;i<=n1;i++){
        int t;
        scanf("%d",&t);
        for(int i=1;i<=n;i++){
            if(a[i]>t){
                printf("%d\n",a[i]);
                break;
            } 
        }
    }
    return 0;
}

3705ms

题号：7457

题目传送门

你们怎么把一个人的头像调出来的？？？

像这样：

https://video.helloworldroom.com/files/user/2019/09-14/195138a4511c636119.jpg

q

q

q

q

dddd

传送门

Quine咋做

#include <iostream>
#include <stdio.h>
using namespace std;
int a[1001][1001];
int main()
{
    int m, n, k, max = -99999, xi, yj, num = 0, mi, mj, sum = 0;
    scanf("%d%d%d", &m, &n, &k);
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            scanf("%d", &a[i][j]);
        }
    }
    mi = 0;
    mj = -1;
    while (1)
    {
        max = 0;
        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (a[i][j] > max)
                {
                    max = a[i][j];
                    xi = i;
                    yj = j;
                }
            }
        }
        if (max == 0)
            break;
        int temp = 0;

        if (mi == 0)
        {
            temp++;
            mi = 1;
            temp += abs(xi - mi) + 1;
        }
        else
        {
            temp += abs(xi - mi);
            temp += abs(yj - mj);
            temp++;
        }
        if ((xi + temp + num) <= k)
        {
            sum += a[xi][yj];
            mi = xi;
            mj = yj;
            num += temp;
            a[xi][yj] = 0;
        }
        else
        {
            break;
        }
    }
    printf("%d", sum);
    return 0;
}