题解列表

筛选

题解 2819: 数字反转

摘要:解题思路:注意事项:参考代码:#include <iostream>using namespace std;int main(){ long long n,sum=……

危险系数 dfs

摘要: #include #include using namespace std; int n,m; //点以及边信息 int map[10……

c++++++++++++++++++++++++

解题思路:注意事项:参考代码:#includeusingnamespacestd;intb[100];booljud(intk){if(k==2)return1;for(intj=2;j

2819: 数字反转题解

解题思路:注意事项:参考代码:#includeusingnamespacestd;intmain(){longlongn,sum=0;cin>>n;while(n){sum=sum*10+n%10;n/=10;}cout<

c++++++++++++++++++++++++

解题思路:注意事项:参考代码:#include#includeusingnamespacestd;intmain(){stringa,b="19";cin>>a;chars[11]={'1',

题解 3016: 第几项

解题思路:注意事项:for和while都可以!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!参考代码:#includeusingnamespacestd;intmain(){longlongs=0,