XDU_PYL的博客

#include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); int n, m, a; cin >> n >> m >> a; cout << 1LL*(n/a+(n%a

#include #include #include #include #include #include using namespace std;int main() { int n; cin >> n; if(n % 2 == 0 && n > 2) { cout << "YES" << endl; } else {

#include #include #include #include #include #include #include using namespace std;int cnt[5];int main() { memset(cnt, 0, sizeof(cnt)); int n, x; int ans = 0; scanf("%d", &n

#include #include #include #include #include #include #include using namespace std;int main() { int ans = 0; int n, a, b, c; cin >> n; for(int i = 0; i < n; ++i) { ci

#include #include #include #include #include #include using namespace std;const int maxn = 60;int arr[maxn];int main() { int ans = 0; int n, k; cin >> n >> k; for(int i = 1;

#include #include #include #include #include #include #include using namespace std;int main() { string str; string ans = ""; cin >> str; int len = str.length(); for(int i

#include #include #include #include #include #include #include using namespace std;int main() { int m, n; cin >> m >> n; cout << m*n/2 << endl; return 0;}

#include #include #include #include #include #include #include using namespace std;int main() { int ans = 0; int tot = 0; int n, a, b; cin >> n; for(int i = 0; i < n; ++i

#include #include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); int n; string str; cin >> n; while(n--) {

注意：C语言字符数组必须预留出一个‘\0’的位置。#include #include #include #include #include #include #include using namespace std;int main() { char op[5]; int n; int ans = 0; cin >> n; w

#include #include #include #include #include #include #include using namespace std;int main() { string str; int cnt = 0; cin >> str; int len = str.length(); for(int i = 0

#include #include #include #include #include #include #include using namespace std;int main() { string str; bool flag = false; cin >> str; int len = str.length(); for(int

#include #include #include #include #include #include #include using namespace std;int main() { string str; int n; cin >> n >> str; int id = 0, ans = 0, pre = -1; while(i

#include #include #include #include #include #include #include using namespace std;int main() { string str; cin >> str; int len = str.length(); bool flag = false; for(int

#include #include #include #include #include #include #include using namespace std;int main() { string a, b; cin >> a >> b; int l1 = a.length(); int l2 = b.length(); int

#-*- coding: utf-8 -*-str = raw_input()cnt = [ 0 for i in range(4) ]for i in range(len(str)): if str[i] == '1': cnt[1] += 1 elif str[i] == '2': cnt[2] += 1 elif str[i]

#-*- coding: utf-8 -*-s = raw_input()l = []if ord(s[0]) >= ord('a') and ord(s[0]) <= ord('z'): l.append(chr(ord(s[0])-ord('a')+ord('A')))else: l.append(s[0])for i in range(1, len(s)):

#include #include #include #include #include #include #include using namespace std;const int maxn = 110;int arr[maxn];int main() { int sum = 0, t = 0; int n; scanf("%d", &n);

#include #include #include #include #include #include #include using namespace std;string ans[5] = { "Sheldon", "Leonard", "Penny", "Rajesh", "Howard" };int main() { int n; int x =

#include #include #include #include #include #include #include using namespace std;int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b);}int lcm(int a, int b) { return a / gcd

#include #include #include #include #include #include #include using namespace std;const int maxn = 30;int cnt[maxn];int main() { string str; memset(cnt, 0, sizeof(cnt)); cin >

Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtain a new one.GukiZ has strings a, b, and c. He wants to obtain stringk by swapping some letters

We all know that GukiZ often plays with arrays. Now he is thinking about this problem: how many arrays a, of length n, with non-negative elementsstrictly less then 2l meet the following condit

Professor GukiZ is concerned about making his way to school, because massive piles of boxes are blocking his way.In total there are n piles of boxes, arranged in a line, from left to right,i-th

#include #include #include #include #include #include #include #include #include using namespace std;int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b);}int main() { int

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, p, q; int ans = 0; cin >> n; for(int i = 0; i < n;

#include #include #include #include #include #include #include #include #include using namespace std;int main() { long long n; int ans = 0; cin >> n; while(n) { if(

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int i, j = 0; string s1 = "hello"; string s2; cin >> s2;

#include #include #include #include #include #include #include #include #include using namespace std;bool mark[10];int main() { int n; cin >> n; while(true) { ++n;

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n; int i = 0; cin >> n; for(i = 1; i <= n; ++i) {

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a, b; int ans = 0; cin >> a >> b; ans = a; while(

#include #include #include #include #include #include #include #include #include using namespace std;int main() { string s1; string s2; cin >> s1 >> s2; int len = s1.length

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, x; cin >> n >> m; x = min(n, m); if(x % 2 == 0)

#include #include #include #include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); string s1; string s2 = "";

Vanya has a scales for weighing loads and weights of masses w0, w1, w2, ..., w100 grams wherew is some integer not less than 2 (exactly one weight of each nominal value). Vanya wonders whether h

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, ans = 0; cin >> n >> m; while(n >= m) { ans

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int s[4]; int ans = 0; cin >> s[0] >> s[1] >> s[2] >> s[3];

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, t; string str; cin >> n >> t; cin >> str; while

#include #include #include #include #include #include #include #include #include using namespace std;int main() { string s1, s2; cin >> s1 >> s2; int l1 = s1.length(); int

#include #include #include #include #include #include #include #include #include using namespace std;bool check(int n) { for(int i = 2; i * i <= n; ++i) { if(n % i == 0) return