liuchuo / pat Goto Github PK

#include<iostream>
using namespace std;
int temp, N, cnt = 0;
bool num[100002] = { 0 };
int main(){
	cin >> N;
	for (int i = 0; i < N; i++) {
		scanf("%d", &temp);
		if (temp > N || temp <= 0)
			continue;
		num[temp] = true;
	}
	while (++cnt){
		if (num[cnt] == false)break;
	}
	cout << cnt;
	return 0;
}

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int n, k, p, maxFacSum = -1;
vector<int> v, ans, tempAns;
void init() {
	int temp = 0, index = 1;
	while (temp <= n) {
		v.push_back(temp);
		temp = pow(index, p);
		index++;
	}
}
void dfs(int index, int tempSum, int tempK, int facSum) {
	if (tempK == k ) {
		if (tempSum == n) {
			if (facSum > maxFacSum) {
				ans = tempAns;
				maxFacSum = facSum;
			}
		}
		return;
	}
	while(index >= 1) {
		if (tempSum + v[index] <= n) {
			tempAns[tempK] = index;
			dfs(index, tempSum + v[index], tempK + 1, facSum + index);
		}if (index == 1)
			return;
		index--;
	}
}
int main() {
	scanf("%d%d%d", &n, &k, &p);
	init(); tempAns.resize(k);
	dfs(v.size() - 1, 0, 0, 0);
	if (maxFacSum == -1) {
		printf("Impossible");
		return 0;
	}
	printf("%d = ", n);
	for (int i = 0; i < ans.size(); i++) {
		if (i != 0) printf(" + ");
		printf("%d^%d", ans[i], p);
	}
	return 0;
}

#include <cstdio>
#include <vector>
#include <algorithm>

#define _HASH(x) (\
	(x[0] - 'A') * 26 * 26 * 10 +\
	(x[1] - 'A') * 26 * 10 +\
	(x[2] - 'A') * 10 +\
	(x[3] - '0') \
)

#define _UNHASH(val, str) do {\
	str[4] = 0; \
	str[3] = val % 10 + '0'; \
	str[2] = val % (10 * 26) / 10 + 'A'; \
	str[1] = val % (10 * 26 * 26) / (10 * 26) + 'A'; \
	str[0] = val / (10 * 26 * 26) + 'A'; \
} while (0)

int main(int argc, char* argv[]) {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif

	int stuNum, couNum;
	scanf("%d%d", &stuNum, &couNum);
	getchar();
	std::vector<std::vector<int>> Course(couNum + 1, std::vector<int>());
	char name[5];
	int num, couInd, hashedName;
	for (int i=0; i!=stuNum; ++i) {
		scanf("%s %d", name, &num);
		hashedName = _HASH(name);
		for (int j=0; j!=num; ++j) {
			scanf("%d", &couInd);
			Course[couInd].push_back(hashedName);
		} getchar();
	}

	for (int i=1; i!=couNum + 1; ++i) {
		printf("%d %zu\n", i, Course[i].size());
		std::sort(Course[i].begin(), Course[i].end());
		for (auto j : Course[i]) {
			_UNHASH(j, name);
			puts(name);
		}
	}
	return 0;
}

#include <iostream>
#include <algorithm>
#include <stdlib.h>
using namespace std;

int main() {
	int n;
	long long p;
	cin >> n >> p;
	if (n == 0) {
		cout << n;
		return 0;
	}
	long long int *a = new long long int[n];
	for (int i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n);
	int result = 1;
	for (int i = 0; i < n; i++) {
		result = max((int)(upper_bound(a, a+n, a[i] * p) - (a+i)), result);
	}
	cout << result;
	return 0;
}

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int inf = 999999999;
int n, m, k, ds, station;
int e[1020][1020], dis[1020];
bool visit[1020];
int main() {
	fill(e[0], e[0] + 1020 * 1020, inf);
	//--------新增代码-------
	for (int i = 0; i < 1020; i++){
		e[i][i] = 0;
	}
	//-----------------------
	fill(dis, dis + 1020, inf);
	scanf("%d%d%d%d", &n, &m, &k, &ds);
	string s, t;
	for (int i = 0; i < k; i++) {
		int tempdis;
		cin >> s >> t >> tempdis;
		int a, b;
		if (s[0] == 'G') {
			s = s.substr(1);
			a = n + stoi(s);
		}
		else {
			a = stoi(s);
		}
		if (t[0] == 'G') {
			t = t.substr(1);
			b = n + stoi(t);
		}
		else {
			b = stoi(t);
		}
		//----------这里添加了求min-------
		e[a][b] = e[b][a] = min(tempdis, e[a][b]);
		//--------------------------------
	}
	int ansid = -1;
	double ansdis = -1, ansaver = inf;
	for (int index = n + 1; index <= n + m; index++) {
		double mindis = inf, aver = 0;
		fill(dis, dis + 1020, inf);
		fill(visit, visit + 1020, false);
		dis[index] = 0;
		for (int i = 0; i < n + m; i++) {
			int u = -1, minn = inf;
			for (int j = 1; j <= n + m; j++) {
				if (visit[j] == false && dis[j] < minn) {
					u = j;
					minn = dis[j];
				}
			}
			if (u == -1) break;
			visit[u] = true;
			for (int v = 1; v <= n + m; v++) {
				if (visit[v] == false && dis[v] > dis[u] + e[u][v])
					dis[v] = dis[u] + e[u][v];
			}
		}
		for (int i = 1; i <= n; i++) {
			if (dis[i] > ds) {
				mindis = -1;
				break;
			}
			if (dis[i] < mindis) mindis = dis[i];
			aver += 1.0 * dis[i];
		}
		if (mindis == -1) continue;
		aver = aver / n;
		if (mindis > ansdis) {
			ansid = index;
			ansdis = mindis;
			ansaver = aver;
		}
		else if (mindis == ansdis && aver < ansaver) {
			ansid = index;
			ansaver = aver;
		}
	}
	if (ansid == -1)
		printf("No Solution");
	else
		printf("G%d\n%.1f %.1f", ansid - n, ansdis, ansaver);
	return 0;
}

#include<iostream>
#include<cmath>
using namespace std;
long int num,temp;
int main(){
	cin >> num;
	int first = 0, len = 0, maxn = sqrt(num);
	for (int i = 2; i <= maxn; i++){
		int j; temp = 1;
		for ( j = i; j <= maxn; j++){
			temp *= j;
			if (num%temp != 0)break;
		}
		if (j - i > len){
			len = j - i;
			first = i;
		}
	}
	if (first == 0)cout << 1 << endl << num;
	else {
		cout << len << endl;
		for (int i = 0; i < len; i++){
			cout << first + i;
			if (i != len - 1)
				cout << '*';
		}
	}
	return 0;
}

long long int *a = new long long int [n];

    cout << b[num / 13];
    if((num % 13) && (num / 13)) {
        cout << " " << a[num % 13];
    } else if(num % 13) {
        cout << a[num % 13];
    } else if(num == 0) {
        cout << a[num % 13];
    }

#include <iostream>
int main(int argc, char** argv) {
	int num=4;
	if((num % 13) && (num / 13)) {
        num=1 ;
    } else if(num % 13) {
        num=2;
    } else if(num == 0) {
        num=3;
    }
    return 0;
}

#include <iostream>
int main(int argc, char** argv) {
	int temp=4; 
	if (temp / 13 > 0){
		temp=1;
		if (temp % 13)
			temp=2;
	}
	else
		temp=3;
	return 0;
}

#include <iostream>
#include <string>
#include <cctype>
using namespace std;
string a[13] = { "tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct",
"nov", "dec" };
string b[13] = { "", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy",
"lok", "mer", "jou" };
void func1(string s) {
	int len = s.length(), num = 0;
	for (int i = 0; i < len; i++)
		num = num * 10 + (s[i] - '0');
	if (num / 13) {
		cout << b[num / 13];
		if (num % 13)
			cout << ' ' << a[num % 13];
	}
	else
		cout << a[num % 13];
}
void func2(string s) {
	int len = s.length(), num = 0;
	if (len == 4) {
		cout << 0;
		return;
	}
	else if (len == 3) {
		for (int i = 1; i <= 12; i++) {
			if (s == a[i]) {
				cout << i;
				return;
			}
			if (s == b[i]) {
				cout << i * 13;
				return;
			}
		}
	}
	else {
		string temp1 = s.substr(0, 3), temp2 = s.substr(4, 3);
		for (int i = 1; i <= 12; i++) {
			if (temp1 == b[i]) num += i * 13;
			if (temp2 == a[i]) num += i;
		}
		cout << num;
	}
	return;
}
int main() {
	int n;
	cin >> n;
	getchar();
	for (int i = 0; i < n; i++) {
		string s;
		getline(cin, s);
		if (isdigit(s[0]))
			func1(s);
		else
			func2(s);
		cout << endl;
	}
	return 0;
}