DragonOne的博客

#include <stdio.h> #include <string> using namespace std; int main() { string a; a.resize(100); //需要预先分配空间 scanf("%s", &a[0]); puts(a.c_str()); return 0; }

单词总数 #include<iostream> #include<algorithm> #include<vector> #include<string> using namespace std; vector<string> v; string s; int main() { while (cin>>s) ...

1.位运算 int gcd(int a,int b) { while(b^=a^=b^=a%=b); return a; //最大公约数 }

另解 #include <iostream> using namespace std; int main() { int n, m, x = 0; cin >> n; cin >> m; for (int i = 2; i <= n; i++) { x = (x + m) % i; } cout << x + 1 ...

#include<stdio.h> #include<stdlib.h> #include<string.h> char s[100]; int n; char t[30], temp[30]; int main() { t[0] = '\0'; gets(s); int len =strlen(s); for (int i = 0; i < le...

#include<iostream> using namespace std; int f1 = 1, f2 = 1; int k, n; int main() { cin >> n; if (n % 2 != 0) k = n / 2; else k = (n / 2) - 1; for (int i = 0; i < k; i++) { f1...

#include<iostream> #include<string> using namespace std; int main() { string s; cin >> s; int leth = s.length(); long long sum = 0; for (int i = 0; i &...

#include<iostream> #include<algorithm> #define INF 0x3f3f3f3f using namespace std; long long dp[100000]; int w[100000], t[100000], m, n; //w为面值 t为个数 m为凑的钱数 n为硬币的种类数 int main() { memset(...