来了!第一代k++模版
2024-08-09 10:08:51
发布于:广东
在森林湖踩缝纫机时发明的
会更新
//k++ v1.2
#define cai if
#define jiuduolian else
#define whatcanisay namespace
#define kao bool
#define ikun endl
#define kunt int
#define manbaout std
#define man long
#define manba double
#define kun for
#define kunout cout
#define kunin cin
#define lao char
#define laoda double
#define jiji string
#define ji vector
#define zhouji while
#define kan scanf
#define cao printf
#define getkun getline
#define heizi size
#define kobi sort
#include<bits/stdc++.h>
using whatcanisay manbaout;
kunt lll(kunt o){
kunt totle=0;
zhouji(o!=0){
totle+=o%10;
o/=10;
}
return totle;
}
kunt l,d,x;
kunt main(){
kunin>>l>>d>>x;
kun(kunt i=l;i<=d;i++){
cai(lll(i)==x){
kunout<<i<<endl;
break;
}
}
kun(kunt i=d;i>=l;i--){
cai(lll(i)==x){
kunout<<i<<endl;
break;
}
}
return 0;
}
全部评论 4
https://www.acgo.cn/application/1870763133040070656
谢谢!2025-04-06 来自 浙江
0//k++ v1.2 #define ko max #define bi min #define wa void #define ac struct #definr tle class #define seeyouagain return #define basketball include #define MAN bits #define kar char #define cai if #define jiuduolian else #define whatcanisay namespace #define kao bool #define ikun endl #define kunt int #define manbaout std #define man long #define manba double #define kun for #define kunout cout #define kunin cin #define lao char #define laoda double #define jiji string #define ji vector #define zhouji while #define kan scanf #define cao printf #define getkun getline #define heizi size #define kobi sort #include<bits/stdc++.h> using whatcanisay manbaout; kar mp[1000][1000]; kunt vis[110][110],dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}}; kunt n,m; kunt a[15]={0,0,0,0,0,0,0,0,0,0}; ac node { kunt x,y; kar val; }; wa bfs(kunt x,kunt y){ vis[x][y]=1; node start ={x,y,mp[x][y]}; queue<node> q; q.push(start); while(!q.empty()){ node head = q.front(); q.pop(); kun(kunt i=0;i<4;i++){ kunt xx=head.x+dir[i][0]; kunt yy=head.y+dir[i][1]; cai(mp[xx][yy]==mp[head.x][head.y]&&xx>=1&&xx<=n) } } } kunt lll(kunt o){ kunt a=o%10; kunt b=o%100/10; kunt c=o/100; return a*a*a+b*b*b+c*c*c==o; } kunt n; kunt main(){ return 0; }
2024-08-09 来自 广东
06
2024-08-09 来自 广东
0看着用
2024-08-09 来自 广东
0
有帮助,赞一个