qq_43627860的博客

g2g c u l8r1.用map存储缩写和对应的扩展2.按空格分割然后判断是否是缩写主要是单行的读取，存储麻烦代码#include <iostream>#include <string>#include <sstream>#include <map>using namespace std;int main(){ int n, m; string a, b; cin >> n; map<

Tip to be Palindrome1.打表13000以内的回文数2.将本金加上最小的小费3.查找比总费用高的数代码#include <iostream>#include <cstdio>#include <cstring>using namespace std;bool strback[13000];void check(){ for(int i = 0; i <= 13000; i++){ int j = 0;

普通实现#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std ;int main(){ int m ; cin >> m ; while( m-- ){ int n ; int k = 2 ; cin >> n ; int str[7000] ; memset(str ,

普通方法实现#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std ;int main(){ int n ; char a[2000][100] ; int v[2000] ; while( cin >> n && n ){ memset( a , 0 , sizeof(a) ) ;

直接写#include<iostream>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int main(){ int n , m ; char a[200][200] ; int v[200][200]; while( cin >> m >> n ){ if( m == 0 && n == 0

先转二进制再转八进制十六进制 一位变四位转二进制 然后二进制 三位变一位转八进制#include<bits/stdc++.h>using namespace std;char a[100000];//输入的16进制数int b[400000];//转化为的二进制数int c[100000];//转化为的八进制数int main(){ int n; cin>>n; while(n--){ scanf("%s",a); int t=strlen(a);

拼接之后再查找#include<iostream>#include<cstring>#include<algorithm>#include<cmath>using namespace std ;int main(){ string str1 , str2 ; cin >> str1 >> str2 ; if(str1.size() < str2.size()){ swap( str1 , str2 )

阶乘后的位数**位数 = log10(n!) = log10(1) + log10(2)+… +log10(n) **#include<iostream> #include<cmath>#include<algorithm>using namespace std;int main(){ int n ; int m ; double sum ; cin >> n ; while( n-- ){ sum = 0 ; cin &

各个位数之和%9#include<iostream>#include<cstring>#include<algorithm>#include<string>#include<cmath>using namespace std;int main(){ string str ; while( cin >> str && str != "0" ){ int sum = 0 ; int len

素数环#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<cmath>using namespace std;int n;int a[30];int v[30];bool prime( int x ){ for( int i = 2 ; i <= sqrt(x) ; i++ ) if( x % i =

题目:http://210.43.224.19/oj/problem.php?cid=2433&pid=0&nsukey=IH8BRLzwKQLlXQVNFBAS0ZH9b6ExRVX7eGhPdtdCxUmTw2HuBsbZxuImbqUiEbJhEL7sAciI7JlKE2ofKLmRhfJRXFP7VLu0pn6Si5U3VPgdTa5mVC4FC6L9tzaEeQfoyQh...

#include<bits/stdc++.h>using namespace std;double loge=log(2.7182818284);double a,b,c;double f(double x){ double d; d=a*log(x)/loge+b*x*sin(x)+c; return d;}double eff(double x1,double ...

用sort函数对结构体排序，主要C语言代码#include<bits/stdc++.h>using namespace std;struct stu1 {int num;char input[10];int gra;} stu[10];***//定义结构体***bool comparison(stu1 a,stu1 b) {return a.gra<b.gra;...