进制

作者： 作者的头像   大瓜娃子 ,  2022-03-01 15:14:54 ,  所有人可见 ,  阅读 183

1 


#include <iostream>
using namespace std;
int n;
char a[1000];
int main()
{
    int cnt = 0;
    cin>>n;
    while(n){
        int tmp;
        tmp = n%26;
        if(tmp == 0){
            tmp = 26;
        }
        a[cnt++] = tmp + 'A' - 1;
        n = (n-tmp)/26;//进制
    }
    for(int i = cnt-1; i >= 0; i--)
    {
        cout<<a[i];
    }
    return 0;
}

2 评论

用户头像
想我了就抱抱风   2023-01-20 13:31         踩      回复 
#最优配餐
from collections import deque
N = 1010
inf = float('inf')
w = [[0 for i in range(N)] for j in range(N)]
dist = [[inf for i in range(N)] for j in range(N)]
st = [[0 for i in range(N)] for j in range(N)] #1表示分店 2表示客户 3表示不能走
dx = [-1,0,1,0]
dy = [0,1,0,-1]

def bfs():
    q = deque()
    for i in range(1,n+1):
        for j in range(1,n+1):
            if st[i][j] == 1:
                q.append((i,j))
                dist[i][j] = 0
    while len(q):
        t = q.popleft()
        x = t[0]
        y = t[1]
        for i in range(4):
            a = x + dx[i]
            b = y + dy[i]
            if a <=0 or a > n or b <= 0 or b > n: continue
            if st[a][b] == 3: continue

            if dist[a][b] > dist[x][y] + 1:
                dist[a][b] = dist[x][y] + 1
                q.append((a,b))
n,m,k,d = map(int,input().split())

for _ in range(m):
    x,y = map(int,input().split())
    st[x][y] = 1

for _ in range(k):
    x,y,c = map(int,input().split())
    w[x][y] += c
    st[x][y] = 2

for _ in range(d):
    x,y = map(int,input().split())
    st[x][y] = 3

bfs()

res = 0
for i in range(1,n+1):
    for j in range(1,n+1):
        if st[i][j] == 2:
             res += dist[i][j] * w[i][j]
print(res)
用户头像
想我了就抱抱风   2023-01-20 13:13         踩      回复 
N = 210
inf = float("inf")
g = [[inf for i in range(N)] for j in range(N)]

def add(a,b,c):
    g[a][b] = min(g[a][b],c)

def Floyd():
    for i in range(1,n+1):
        g[i][i] = 0
    for k in range(1,n+1):
        for i in range(1,n+1):
            for j in range(1,n+1):
                g[i][j] = min(g[i][j],g[i][k] + g[k][j])

n,m,q = map(int,input().split())

for _ in range(m):
    a,b,c = map(int,input().split())
    add(a,b,c)

Floyd()

for _ in range(q):
    a,b = map(int,input().split())
    if g[a][b] == inf: print("impossible")
    else: print(g[a][b])