题目连接:点击打开链接
解题思路:
暴力
完整代码:
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <set> using namespace std; const int INF = 1000000000; string s; int main() { #ifdef DoubleQ freopen("in.txt" , "r" , stdin); #endif // DoubleQ while(cin >> s) { string temp = ""; int len = s.length(); for(int i = len - 1 ; i >= 0 ; i --) temp += s[i]; cout << temp << endl; } }
题目连接:点击打开链接
解题思路:
函数秒杀众生
完整代码:
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <set> using namespace std; const int INF = 1000000000; int a , b; int main() { #ifdef DoubleQ freopen("in.txt" , "r" , stdin); #endif // DoubleQ while(cin >> a >> b) { cout << __gcd(a , b) << endl; } }
题目连接:点击打开链接
解题思路:
暴力
完整代码:
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <set> using namespace std; const int INF = 1000000000; int a[10001]; int main() { #ifdef DoubleQ freopen("in.txt" , "r" , stdin); #endif // DoubleQ memset(a , 0 , sizeof(a)); int k , cnt = 0; while(cin >> k) { cnt ++; if(cnt == 20) { cnt = 0; int maxx = -INF , pos; for(int i = 1 ; i <= 20 ; i ++) { if(a[i] > maxx) { maxx = a[i]; pos = i; } } cout << pos << endl; memset(a , 0 , sizeof(a)); } a[k]++; } }
时间: 2024-10-27 12:00:03