数字颠倒 字符反转
int main(void)
{
int num;
scanf("%d",&num);
while(num)
{
printf("%d",num%10);
num /= 10;
}
return 0;
}
字符反转
using namespace std;
int main(){
string str;
cin >> str;
for(int i = str.size()-1; i >=0;i--)
cout << str[i];
}
int 转2进制1的个数
using namespace std;
int main()
{
int n,ans=0;
cin>>n;
while(n>0)
{
ans+=(n%2);
n/=2;
}
cout<<ans;
return 0;
}
单词长度 句子逆序 数字颠倒
单词长度
package main
import (
"bufio"
"fmt"
"os"
"strings"
)
func main() {
reader := bufio.NewReader(os.Stdin)
result, err := reader.ReadString('\n')
if err != nil {
fmt.Println("read error:", err)
}
strArr := strings.Split(result, " ")
w := strArr[len(strArr)-1]
fmt.Printf("%d", len(w) - 1)
}
句子逆序
func ReverseWords() {
//myl:=list.New()
var str string
inputReader:=bufio.NewReader(os.Stdin)
str,err:=inputReader.ReadString('\n')
if err != nil {
fmt.Println(err)
}
end:=len(str)
str=str[:end-1]
res:=strings.Split(str," ")
for i := len(res) - 1; i > 0; i-- {
fmt.Printf("%s ",res[i])
}
fmt.Printf("%s",res[0])
//fmt.Printf("res is %v,len is %v\n",res,len(res))
}
数字颠倒
using namespace std;
int main(){
int n;
cin>>n;
string str = to_string(n);
reverse(str.begin(), str.end());
cout<<str;
return 0;
}
计算字符个数
a=input().lower()
b=input().lower()
print(a.count(b))
随机数去重排序
using namespace std;
int main()
{
int N,n;
set<int> ss;
while(cin>>N) //多组数据
{
ss.clear(); //清除上一组数据的影响
while(N--)
{
cin>>n;
ss.insert(n);
}
for (set<int>::iterator it = ss.begin(); it != ss.end(); it++)
{
cout << *it << endl;
}
}
return 0;
}
字符串隔8分
using namespace std;
void ***(string str) {
if (str == "")
return;
if (str.size() <= 8) {
str.append(8 - str.size(), '0');
cout << str << endl;
return;
}
cout << str.substr(0, 8) << endl;
sub(str.substr(8, str.size()));
}
int main() {
string str1, str2;
cin >> str1 >> str2;
sub(str1);
sub(str2);
return 0;
}
进制转换
int main(){
int a;
while (scanf("%x", &a) != EOF){
printf("%d\n", a);
}
return 0;
}
四舍五入
using namespace std;
int main()
{
float a;
cin>>a;
cout<<int(a+0.5);
return 0;
}
字符串排序
using namespace std;
int main()
{
int input;
while (cin >> input)
{
string str;
vector<string> vs;
while (input--)
{
cin >> str;
vs.push_back(str);
}
sort(vs.begin(), vs.end());
vector<string>::iterator vit;
for (vit = vs.begin(); vit != vs.end(); vit++)
{
cout << *vit << endl;
}
}
return 0;