text stringlengths 1 24.5M |
|---|
#include <iostream>
using namespace std;
int main(){
int a[2][2] = {2, 3, 4, 1};
int b[2][2] = {5, 7, 6, 8};
int c[2][2];
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
c[i][j] = 0;
for(int k = 0; k < 2; k++){
c[i][j] += a[i][k] * b[k][j];
}
}
}
for(int i = 0; i < 2; i++)
for(int j = 0... |
#include<iostream>
#include <cstdio>
#include <list>
#include <vector>
#include <queue>
#include <stack>
#include <fstream>
using namespace std;
int n;
vector< list<int> > graph;
bool visited[100] = { 0 };
void CreateGraph()
{
cout << "input the vertex num:" << endl;
cin >> n;
vector< list<int> >::iterator ... |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<vector<int> > graph;
voidbfs(int v){
vector<int>::iterator it;
visited[v] = true;
cout << v << " ";
queue<int> q;
q.push(v);
while(!q.empty()){
v = q.front();
q.pop();
for(it = graph[v].begin(); it != graph[v].end(); it++){... |
#include <iostream>
using namespace std;
typedef int ElementType;
//typedef struct TNode *Position;
//typedef Position BinTree;
typedef struct TNode *BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
BinTree Insert(BinTree BST, ElementType X);
void PreOrder(BinTree BST);
void InOrder(BinTr... |
#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
BinTree Insert(BinTree BST, ElementType X);
BinTree Delete(BinTree BST, ElementType X);
Position Find(BinTree BST, ElementType X)... |
void swap(BiTree b){
if(b){
swap(b->lchild);
swap(b->rchild);
temp = b->lchild;
b->lchild = b->rchild;
b->rchild = temp;
}
}
|
void DeleteXTree(BiTree bt){
if(bt){
DeleteXTree(bt->lchild);
DeleteXTree(bt->rchild);
free(bt);
}
}
void Search(BiTree bt, ElemType x){
BiTree Q[];
if(bt){
if(bt->data == x){
DeleteXTree(bt);
exit(0);
}
InitQueue(Q);
EnQueue(Q, bt);
while(!IsEmpty(Q)){
DeQueue(Q, p);
if(p->lchild){
... |
#include <iostream>
using namespace std;
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode, *LinkList;
LinkList List_HeadInsert(LinkList &L){
LNode *s;
ElemType x;
L->next = NULL;
scanf("%d", &x);
while(x != 99999){
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
s->n... |
#include <iostream>
#include <cmath>
using namespace std;
int converse(int n, int d){
int arr[100], index = 0;
while(n != 0){
arr[index++] = n % d;
n = n / d;
}
int result = 0;
for(int i = index - 1; i >= 0; i--){
result = result + arr[i] * pow(10, i);
}
return result;
}
int main(){
int a, b;
cin >> a >... |
bool IsComplete(BiTree T){
InitQueue(Q);
if(!T) return 1;
EnQueue(Q, T);
while(!IsEmpty(Q)){
DeQueue(Q, p);
if(p){
EnQueue(Q, p->lchild);
EnQueue(Q, p->rchild);
}
else{
while(!IsEmpty(Q)){
DeQueue(Q, p);
if(p) return 0;
}
}
}
return 1;
}
|
void PreToPost(ElemType pre[], int l1, int h1, ElemType post[], int l1, int h2){
int half;
if(h1 >= l1){
post[h2] = pre[l1];
half = (h1 - l1) / 2;
PreToPost(pre, l1 + 1, l1 + half, post, l2, l2 + half - 1);
PreToPost(pre, l1 + half + 1, h1, post, l2 + half, h2 -1);
}
}
|
#include <iostream>
using namespace std;
typedef int ElemType;
typedef struct DNode{
ElemType data;
struct DNode *prior, *next;
}DNode, *Dlinklist;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode, *LinkList;
// 2.3.1
void Del_x_1(LinkList &L, ElemType x){
LNode *p;
if(L == NULL) return;
if(L-... |
#include <iostream>
#include <vector>
using namespace std;
vector<int> InOrder, PostOrder, Level(10000, -1);
// 递归层次é历
void getLevel(int root, int start, int end, int index);
int main(){
int n, cnt = 0;
cin >> n;
InOrder.resize(n);
PostOrder.resize(n);
//Level.resize(n);
//vector<int> InOrder(n), Pre... |
BiTree PreInCreat(ElemType A[], ElemType B[], int l1, int h1, int l2, int h2){
//åˆå§‹è°ƒç”¨ l1 = l2 = 1, h1 = h2 = n;
root = (BiTNode*)malloc(sizeof(BiTNode));
root->data = A[l1];
for(int i = l2; B[i] != root->data; i++);
llen = i - l2;
rlen = h2 - i;
if(llen)
root->lchild = PreInCreat(A, B, l1 + 1, l1 + lle... |
#include <iostream>
#include <vector>
using namespace std;
vector<int> InOrder, PreOrder, Level(10000, -1);
// 递归层次é历
void getLevel(int root, int start, int end, int index);
int main(){
int n, cnt = 0;
cin >> n;
InOrder.resize(n);
PreOrder.resize(n);
//vector<int> InOrder(n), PreOrder(n), Level(n);
f... |
#include <cstdio>
int month[13][2] = {
{0, 0}, {31, 31}, {28, 29}, {31, 31}, {30, 30}, {31, 31}, {30, 30}, {31, 31},
{31, 31}, {30, 30}, {31, 31}, {30, 30}, {31, 31}
};
bool isLeap(int year){
return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}
int main(){
int time1, y1, m1, d1;
int time2, y2, m2,... |
int BtDepth(BiTree T){
if(!T) return 0;
int front = -1, rear = -1;
int last = 0, level = 0;
BiTree Q[maxSize];
Q[++rear] = T;
BiTree p;
while(front < rear){
p = Q[++front];
if(p->lchild)
Q[++rear] = p->lchild;
if(p->rchild)
Q[++rear] = p->rchild;
if(front == last){
level++;
last = rear;
}... |
#include <iostream>
using namespace std;
int main(){
int a[] = {-1, 6, 5, 2, 8, 4, 1, 3, 7}; //数组从第二ä½å¼€å§‹, 第一ä½[0]为暂å˜å•å…ƒ
int len = sizeof(a) / sizeof(a[0]);
for(int i = 2; i < len; i++){
a[0] = a[i];
int low = 1, high = i - 1;
while(low <= high){
int m = (low + high) / 2;
if(a[0]... |
#include <iostream>
using namespace std;
int main(){
int a[] = {6, 5, 2, 8, 4, 1, 3, 7};
int len = sizeof(a) / sizeof(a[0]);
int m = len - 1, flag = 1;
while((m > 0) && (flag == 1)){
flag = 0;
for(int i = 1; i <= m; i++){
if(a[i - 1] > a[i]){
flag = 1;
int temp = a[i - 1];
a[i - 1] = a[i];
a[... |
#include <iostream>
using namespace std;
void adjust(int arr[], int len, int index)
{
int left = 2 * index ; //ä¸‹æ ‡ä»Ž0开始的è¯æ”¹ä¸º 2 * index + 1
int right = 2 * index + 1; //ä¸‹æ ‡ä»Ž0开始的è¯æ”¹ä¸º 2 * index + 2
int maxIdx = index;
if(left < len && arr[left] > arr[maxIdx]) maxIdx = left;
if(right ... |
#include <iostream>
using namespace std;
//åˆå¹¶å·¦å³å表
void Merge(int arr[], int left, int mid, int right)
{
int *temp = new int[right - left];
int t = 0;
int i = left;
int j = mid;
while(i < mid && j < right){
if(arr[i] <= arr[j]) temp[t++] = arr[i++];
else temp[t++] = arr[j++];
}
while(i < mid) temp[t+... |
#include <iostream>
using namespace std;
void quickSort(int list[], int low, int high)
{
if(low < high){
list[0] = list[low];
int key = list[low];
int left = low, right = high;
while(low < high){
while(low < high && list[high] >= key) high--;
list[low] = list[high];
while(low < high && list[low] <= ke... |
#include <iostream>
using namespace std;
int main(){
int a[] = {-1, 6, 5, 2, 8, 4, 1, 3, 7}; //为了和教æ一致，数组从第1ä½å¼€å§‹
int len = sizeof(a) / sizeof(a[0]);
for(int i = 1; i < len; i++){
int k = i;
for(int j = i + 1; j < len; j++){
if(a[j] < a[k]) k = j;
}
if(k != i){
int temp = a... |
#include <iostream>
using namespace std;
int main(){
int a[] = {6, 5, 2, 8, 4, 1, 3, 7};
int len = sizeof(a) / sizeof(a[0]);
int step = len / 2; //åˆæ¬¡å¢žé‡ä¸ºlen/2
while(step > 0){
for(int i = step; i < len; i += step){
while(i >= step && a[i - step] > a[i]){
int temp = a[i - step];
a[i - step] = a[... |
#include <iostream>
using namespace std;
int main(){
int a[] = {-1, 6, 5, 2, 8, 4, 1, 3, 7}; //数组从第二ä½å¼€å§‹,第一ä½[0]为暂å˜å•å…ƒ
int len = sizeof(a) / sizeof(a[0]);
for(int i = 2; i < len; i++){
if(a[i] < a[i - 1]){
a[0] = a[i];
a[i] = a[i - 1];
int j = i - 2;
while(a[0] < a[j]){
a[... |
#include <iostream>
#include <stdlib.h>
#include <cstdio>
#define MaxSize 20
typedef struct
{
char data[MaxSize];
int length;
} SqString;
int index(SqString s, SqString t)
{
int i=0,j=0;
while(i<s.length && j<t.length)
{
if(s.data[i]==t.data[j])
{
printf("%d %d %c %c\n",i,j,s.data[i],t.data[j]);
i++;
... |
#include <iostream>
#include <string>
using namespace std;
/* P 为模å¼ä¸²ï¼Œä¸‹æ ‡ä»Ž 0 开始 */
void GetNext(string P, int next[])
{
int p_len = P.size();
int i = 0; // P çš„ä¸‹æ ‡
int j = -1;
next[0] = -1;
while (i < p_len - 1)
{
if (j == -1 || P[i] == P[j])
{
... |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int judge(char l){
if((l>='0'&&l<='9')||(l>='a'&&l<='z')||(l>='A'&&l<='Z'))
return 1;
return 0;
}
int main(){... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct mooncake{
float mount, price, unit;
};
int cmp(mooncake a, mooncake b){
return a.unit > b.unit;
}
int main(){
int n, need;
cin >> n >> need;
vector<mooncake> a(n);
for(int i = 0; i < n; i++)
cin >> a[i].mount;
for(int i =... |
#include <iostream>
#include <vector>
using namespace std;
typedef struct TNode *BinTree;
struct TNode{
int Data;
BinTree Left;
BinTree Right;
};
BinTree insert(BinTree BST, int Data){
if(!BST){
BST = (BinTree)malloc(sizeof(struct TNode));
BST->Data = Data;
BST->Left = BST->Right = NULL;
}
else if(Data < ... |
#include <iostream>
#include <vector>
using namespace std;
vector<int> InOrder, PostOrder, Level(10000, -1);
// 递归层次é历
void getLevel(int root, int start, int end, int index);
int main(){
int n, cnt = 0;
cin >> n;
InOrder.resize(n);
PostOrder.resize(n);
//Level.resize(n);
//vector<int> InOrder(n), Pre... |
#include <iostream>
using namespace std;
int main() {
string s;
getline(cin, s);
int maxvalue = 0, temp;
int len = s.length();
for(int i = 0; i < len; i++) {
temp = 1;
for(int j = 1; j < len; j++) {
if(i - j < 0 || i + j >= len || s[i - j] != s[i + j])
bre... |
#include <iostream>
#include <vector>
using namespace std;
vector<int> InOrder, PreOrder, Level(10000, -1);
// 递归层次é历
void getLevel(int root, int start, int end, int index);
int main(){
int n, cnt = 0;
cin >> n;
InOrder.resize(n);
PreOrder.resize(n);
//Level.resize(n);
//vector<int> InOrder(n), PreOr... |
分æžï¼š1.æ¤é¢˜è€ƒæŸ¥çš„是对 0 -0 的特殊处ç†ã€‚当é‡åˆ° 0 时候把æ¤äººè½¬ä¸º1000å˜å‚¨, 所以读数æ®çš„时候è¦ä»¥å—符串形å¼è¯»å–
2.é历æ¯å¼ 照片，把与男主女主对应的异性亲密度用sumæ•°å—ç´¯åŠ èµ·æ¥ï¼Œ 并维护maxn[1] maxn[2]， 为男主女主的最亲密值 å’Œans[1], ans[2]容器，... |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string s = to_string(a + b);
int len = s.length();
for(int i = 0; i < len; i++){
cout << s[i];
if(s[i] == '-') continue;
if((i + 1) % 3 == len % 3 && i + 1 != len) cout << ",";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int m, n, e;
float a[1001] = {0}, c;
scanf("%d", &m);
for(int i = 0; i < m; i++){
scanf("%d%f", &e, &c);
a[e] += c;
}
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d%f", &e, &c);
a[e] += c;
}
int num = 0;
for(int i = 0; i < 1001; i++){
if(a... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v[100];
int book[100], maxdepth = -1;
void dfs(int index, int depth){
if(v[index].size() == 0){
book[depth]++;
maxdepth = max(maxdepth, depth);
return ;
}
for(int i = 0; i < v[index].size(); i++)
dfs(v[index][i], dep... |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int sum = 0;
for(int i = 0; i < s.length(); i++){
sum += s[i] - '0';
}
string str[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
string t = to_string(sum);
for(int i = 0; i < t.length(); i++){
... |
#include <iostream>
#include <climits>
using namespace std;
int main(){
int n, minn = INT_MAX, maxn = INT_MIN;
scanf("%d", &n);
string unlocked, locked;
for(int i = 0; i < n; i++){
string t;
cin >> t;
int h1, m1, s1, h2, m2, s2;
scanf("%d:%d:%d %d:%d:%d", &h1, &m1, &s1, &h2, &m2, &s2);
int tempIn = h1 * ... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
int start = 0, end = n - 1, sum = -1, temp = 0, tempindex = 0;
for(int i = 0; i < n; i++){
cin >> v[i];
temp = temp + v[i];
if(temp < 0){
temp = 0;
tempindex = i + 1;
}else if(temp > sum){
s... |
#include <iostream>
using namespace std;
int main(){
int a, now = 0, sum = 0;
cin >> a;
while(cin >> a){
if(a > now)
sum += 6 * (a - now);
else
sum += 4 * (now - a);
now = a;
sum += 5;
}
cout << sum;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
struct poly{
int exp;
double coe;
};
int cmp(poly a, poly b){
return a.exp > b.exp;
}
double result[2000];
int main(){
int n, m, number = 0;
cin >> n;
vector<poly> a(n);
for(int i = 0; i < n; i++)
cin >> a[i].exp >> a[i].coe;
cin >> m;
for(int i... |
#include <iostream>
#include <cctype>
#include <algorithm>
#include <cmath>
using namespace std;
long long convert(string n, long long radix){
long long sum = 0;
int index = 0, temp = 0;
for(auto it = n.rbegin(); it != n.rend(); it++){
temp = isdigit(*it) ? *it - '0' : *it - 'a' + 10;
sum += temp * pow(radix, i... |
#include <iostream>
using namespace std;
int main(){
char c[4] = {"WTL"};
double ans = 1.0;
for(int i = 0; i < 3; i++){
double maxvalue = 0.0;
int maxchar = 0;
for(int j = 0; j < 3; j++){
double temp;
scanf("%lf", &temp);
if(maxvalue <= temp){
maxvalue = temp;
maxchar = j;
}
}
ans *= m... |
#include <iostream>
#include <algorithm>
using namespace std;
struct node{
int id, best;
int score[4], rank[4];
}stu[2005];
int exist[1000000], flag = -1;
bool cmp1(node 1, node b){
return a.score[flag] > b.score[flag];
}
int main(){
int n, m, id;
cin >> n >> m;
for(int i = 0; i < n; i++){
cin >> stu[i].id >>... |
#include <cstdio>
#include <iostream>
using namespace std;
bool isPrime(int a){
if(a <= 1) return false;
for(int i = 2; i * i <= a; i++){
if(a % i == 0) return false;
}
return true;
}
int main() {
int n, d;
while(scanf("%d", &n) != EOF) {
if(n < 0) break;
scanf("%d", &d);
if(isPri... |
#include <iostream>
using namespace std;
int main(){
int n, d;
scanf("%d %d", &n, &d);
int arr[40], index = 0;
while(n != 0){
arr[index++] = n % d;
n = n / d;
}
int flag = 0;
for(int i = 0; i < index / 2; i++){
if(arr[i] != arr[index - i - 1]){
printf("No\n");
flag = 1;
break;
}
}
if(!flag) p... |
#include <iostream>
#include <queue>
using namespace std;
vector<int> PostOrder, InOrder, Level(10000, -1);
void getLevel(int root, int start, int end, int index);
int main(){
int n, cnt = 0;
cin >> n;
PostOrder.resize(n);
InOrder.resize(n);
for(int i = 0; i < n; i++)
cin >> PostOrder[i];
for(int i = 0; i < ... |
#include <iostream>
#include <string>
using namespace std;
int main(){
int a[10] = {0};
string s;
cin >> s;
int flag = 0, len = s.length();
for(int i = len - 1; i >= 0; i--){
int temp = s[i] - '0';
a[temp]++;
temp = temp * 2 + flag;
flag = 0;
if(temp >= 10){
temp = temp - 10;
flag = 1;
}
s[i] ... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct student {
long long int no;
int score, finrank, local, localrank;
};
bool cmp1(student a, student b) {
return a.score != b.score ? a.score > b.score : a.no < b.no;
}
int main() {
int n, m;
scanf("%d", &n);
vec... |
#include <iostream>
using namespace std;
int main(){
char c[14] = {"0123456789ABC"};
printf("#");
for(int i = 0; i < 3; i++){
int num;
scanf("%d", &num);
printf("%c%c", c[num/13], c[num%13]);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int n1 = (s.length()+ 2) / 3; // n1 <= n2 && n1 + n2 + n3 - 2 = N
int n2 = s.length() + 2 - n1 * 2;
for(int i = 0; i < n1 - 1; i++){
cout << s[i];
for(int j = 0; j < n2 - 2; j++)
cout << " ";
cout << s[s.length() - 1 - i];
cout ... |
#include <iostream>
#include <string>
#include <map>
using namespace std;
const int maxn = 2010;
const int INF = 100000000;
map<int, string> intToString;
map<string, int> stringToInt;
map<string, int> Gang;
int G[maxn][maxn] = {0}, weight[maxn] = {0};
int n, k, numPerson = 0;
bool vis[maxn] = {false};
void DFS(int n... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<string> v;
for(int i = 0; i < n; i++){
string id, s;
cin >> id >> s;
int len = s.length(), flag = 0;
for(int j = 0; j < len; j++){
switch(s[j]){
case '1' : s[j] = '@'; flag = 1; break;
case '0' : ... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct stu{
string name;
char gender;
string id;
int grade;
};
int cmp(stu a, stu b){
return a.grade < b.grade;
}
int main(){
int n, result = 0;
cin >> n;
vector<stu> m, f;
for(int i = 0; i < n; i++){
stu s;
cin >> s.name >>... |
#include <cstdio>
using namespace std;
int a[100001], m[100000];
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
m[a[i]]++;
}
for(int i = 0; i < n; i++) {
if(m[a[i]] == 1) {
printf("%d", a[i]);
return 0;
}
... |
#include <cstdio>
using namespace std;
int main(){
int cnt;
scanf("%d", &cnt);
int start[55], end[55], scan[55];
for(int i = 1; i < 55; i++){
scanf("%d", &scan[i]);
end[i] = i;
}
for(int i = 0; i < cnt; i++){
for(int j = 1; j < 55; j++)
start[j] = end[j];
for(int k = 1; k < 55; k++)
end[scan[k]] =... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,
scanf("%d", &n);
vector<int> dis(n + 1);
int sum = 0, left, right, cnt;
for(int i = 1; i <= n; i++){
int temp;
scanf("%d", &temp);
sum += temp;
dis[i] = sum;
}
scanf("%d", &cnt);
for(int i = 0; i < cnt; i++){
scanf("%d %d",... |
#include <iostream>
#include <string>
#include <string.h>
using namespace std;
char s1[100000], s2[100000];
int main(){
cin.getline(s1, 100000);
cin.getline(s2, 100000);
int lens1 = strlen(s1), lens2 = strlen(s2);
bool flag[256] = {false};
for(int i = 0; i < lens2; i++)
flag[s2[i]] = true;
for(int i = 0; i < l... |
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main(){
int m, n, k;
scanf("%d %d %d", &m, &n, &k);
for(int i = 0; i < k; i++){
bool flag = false;
stack<int> s;
vector<int> v(n + 1);
for(int j = 1; j <= n; j++)
scanf("%d", &v[j]);
int current = 1;
for(int j = 1; j <= n... |
#include <iostream>
#include <map>
using namespace std;
int main(){
int m, n;
scanf("%d %d", &m, &n);
map<int, int> arr;
int half = m * n / 2;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
int temp;
scanf("%d", &temp);
arr[temp]++;
if(arr[temp] > half){
printf("%d", temp);
return 0... |
#include <iostream>
using namespace std;
int main(){
int g1, s1, k1, g2, s2, k2, g, s, k;
scanf("%d.%d.%d %d.%d.%d", &g1, &s1, &k1, &g2, &s2, &k2);
k = (k1 + k2) % 29;
s = (s1 + s2 + (k1 + k2) / 29) % 17;
g = g1 + g2 + (s1 + s2 + (k1 + k2) / 29) / 17;
printf("%d.%d.%d", g, s, k);
return 0;
}
|
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
string a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a.length(), b.length());
int min2 = min(c.length(), d.length());
string weekday[7] = {"MON ", "TUE ", "WED ", "THU ", "FRI ", "SAT ", "SUN "};
char t[2];
int pos, j... |
#include <iostream>
using namespace std;
int main(){
int n, t, cnt = 0, a[100010];
cin >> n;
for(int i = 0; i < n; i++){
cin >> t;
a[t] = i;
}
for(int i = 1; i < n; i++){
if(i != a[i]){
while(a[0] != 0){
swap(a[0], a[a[0]]);
cnt++;
}
if(i != a[i]){
swap(a[0], a[i]);
cnt++;
}
}
... |
#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(char a, char b){
return a > b;
}
int main(){
string s;
cin >> s;
s.insert(0, 4 - s.length(), '0');
do{
string a = s, b = s;
sort(a.begin(), a.end(), cmp);
sort(b.begin(), b.end());
int result = stoi(a) - stoi(b);
s = to_string(resul... |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int i = 0;
while(s[i] != 'E') i++;
string t = s.substr(1, i-1);
int n = stoi(s.substr(i+1));
if(s[0] == '-') cout << "-";
if (n < 0){
cout << "0.";
for(int j = 0; j < abs(n) - 1; j++) cout << '0';
for (int j = 0; j < t.length(); j++)... |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int first, n, k, temp;
cin >> first >> n >> k;
int data[100000], next[100000], list[100000];
for(int i = 0; i < n; i++){
cin >> temp;
cin >> data[temp] >> next[temp];
}
int sum = 0;
while(first != -1){
list[sum++] = first;
first =... |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
scanf("%d\n", &n);
string ans;
for(int i = 0; i < n; i++) {
string s;
getline(cin , s);
int lens = s.length();
reverse(s.begin(), s.end());
if(i == 0) {
ans = s;
... |
#include <iostream>
#include <cstdlib>
using namespace std;
long long gcd(long long a, long long b) {
return b == 0 ? abs(a) : gcd(b, a % b);
}
int main(){
long long n, a, b, suma = 0, sumb = 1, gcdvalue;
scanf("%lld", &n);
for(int i = 0; i < n; i++){
scanf("%lld/%lld", &a, &b);
gcdvalue = gcd(a, b);
a = a /... |
#include <iostream>
#include <vector>
#include <stack>
#include <string>
using namespace std;
int find_pos(vector<int> &v, int data){
unsigned int i;
for(i = 0; i < v.size(); i++){
if(v[i] == data) break;
}
return i;
}
void post_traverse(vector<int> &pre, vector<int> &ino, int left, int right, int head){
int p... |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int [n];
int *b = new int [n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int i, j;
for (i = 0; i < n - 1 && b[i] <= b[i + 1]; i... |
#include <iostream>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
for(int i = 0; i < b.length(); i++){
for(int j = 0; j < a.length(); j++){
if(a[j] == b[i]){
a[j] = '#';
b[i] = '#';
break;
}
}
}
int cnt1 = 0, cnt2 = 0;
for(int i = 0; i < b.length(); i++)
if(b[i] != '#') cnt... |
#include <iostream>
#include <cmath>
using namespace std;
int main (){
int n;
cin >> n;
int m = sqrt(n);
int maxCount = 0;
int first = n;
for(int i = 2; i <= m; i++){
int count = 0;
int start = i;
int tmp = n;
while(tmp % start == 0){
count++;
tmp = tmp / start;
start++;
}
if(start - i > max... |
#include <iostream>
using namespace std;
int main(){
string s1[13] = {"###", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};
string s2[13] = {"###", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"};
int N, t;
string temp;
scanf("%d", &N);
ge... |
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(string s){
int a = stoi(s);
if(a < 2) return false;
for(int i = 2; i <= sqrt(a); i++){
if(a % i == 0) return false;
}
return true;
}
int main(){
int l, k;
scanf("%d %d", &l, &k);
string s;
cin >> s;
int flag = 0;
for(int i = 0; i < l... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
struct stu{
string id;
int sco;
};
struct site{
string siteId;
int cnt;
};
bool cmp1(stu a, stu b) {
return a.sco == b.sco ? a.id < b.id : a.sco > b.sco;
}
bool cmp2(site a, site b) {
return a.cnt == b.... |
#include <iostream>
using namespace std;
int main(){
int n, count = 0;
cin>>n;
while(n!=1){
if(n%2!=0) n=3*n+1;
n/=2;
count++;
}
cout<<count;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int sum = 0;
string str[10] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};
for(int i = 0; i < s.length(); i++)
sum += (s[i] - '0');
string sum_num = to_string(sum);
for(int i = 0; i < sum_num.lengt... |
#include <iostream>
#include <map>
using namespace std;
int main(){
int n, p=0, t=0;
string s;
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
map<char, int> m;
for(int j=0;j<s.size();j++){
m[s[j]]++;
if(s[j]=='P') p=j;
if(s[j]=='T') t=j;
}
if(m['P']==1 && m['A']!=0 && m['T']==1 && m.size()==3 && t-p!=1 &&... |
#include <iostream>
using namespace std;
int main(){
int n, max=-1, min=101, score;
cin >> n;
string maxname, minname, maxnum, minnum, name, num;
for(int i=0;i<n;i++)
{
cin >> name >> num >> score;
if(max < score){
max = score;
maxname = name;
maxnum = num;
}
if(min > score){
min = score;
m... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int arr[10000];
bool cmp(int a, int b) {return a > b;}
int main(){
int k, n, flag = 0;
cin >> k;
vector<int> v(k);
for(int i = 0; i < k; i++){
cin >> n;
v[i] = n;
while(n != 1){
if(n % 2 != 0) n = 3 * n + 1;
n = n / 2;
if... |
#include <iostream>
using namespace std;
int main(){
int a, i = 0;
cin >> a;
int b[3] = {0};
while(a != 0){
b[i++] = a % 10;
a = a / 10;
}
for(int k=0; k<b[2];k++)
cout << "B";
for(int k=0;k<b[1];k++)
cout << "S";
for(int k=0; k<b[0];k++)
cout << k+1;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n){
if(n < 2) return false;
for(int i = 2; i <= sqrt(n); i++){
if(n % i == 0) return false;
}
return true;
}
int main(){
int n, cnt = 0;
cin >> n;
for(int i = 2; i <= n; i++)
if(isPrime(i - 2) && isPrime(i)) cnt++;
cout << cnt;
r... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < n; i++)
cin >> a[i];
m %= n;
if(m != 0){
reverse(begin(a), begin(a) + n);
reverse(begin(a), begin(a) + m);
reverse(begin(a) + m, begin(a) + n);
}
for(... |
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main(){
stack<string> v;
string s;
while(cin >> s) v.push(s);
cout << v.top();
v.pop();
while(!v.empty()){
cout << " " << v.top();
v.pop();
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, flag = 0;
while (cin >> a >> b) {
if (b != 0) {
if (flag == 1) cout << " ";
cout << a * b << " " << b - 1;
flag = 1;
}
}
if (flag == 0) cout << "0 0";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long int a, b, c;
cin >> a >> b >> c;
string result;
result = a+b>c?"true":"false";
cout<<"Case #"<< i+1 << ": " << result << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, num, A1 = 0, A2 = 0, A5 = 0;
double A4 = 0.0;
cin >> n;
vector<int> v[5];
for(int i=0; i<n; i++){
cin >> num;
v[num%5].push_back(num);
}
for(int i=0; i<5; i++){
for(int j=0; j<v[i].size(); j++){
if(i == 0 && v[i][j]%2 == 0) A1... |
#include <iostream>
#include <vector>
using namespace std;
bool isprime(int a) {
for (int i = 2; i * i <= a; i++)
if(a % i == 0) return false;
return true;
}
int main() {
int M, N, num = 2, cnt = 0;
cin >> M >> N;
vector<int> v;
while (cnt < N) {
if (isprime(num)) {
c... |
#include <iostream>
#include <cctype>
using namespace std;
int main(){
string a, b, c, d;
cin >> a >> b >> c >> d;
char t[2];
int pos, i = 0, j = 0;
while(i < a.length() && i < b.length()){
if (a[i] == b[i] && (a[i] >= 'A' && a[i] <= 'G')){
t[0] = a[i];
break;
}
i++;
}
i = i + 1;
while (i< a.length(... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct node {
int num, de, cai;
};
int cmp(struct node a, struct node b) {
if ((a.de + a.cai) != (b.de + b.cai))
return (a.de + a.cai) > (b.de + b.cai);
else if (a.de != b.de)
return a.de > b.de;
else
... |
#include <iostream>
using namespace std;
int main() {
string a, b;
int m, n, counta = 0, countb = 0, ta = 0, tb = 0;
cin >> a >> m >> b >> n;
for (int i = 0; i < a.length(); i++)
if (m == (a[i] - '0')) counta++;
for (int i = 0; i < b.length(); i++)
if (n == (b[i] - '0')) countb++;
... |
#include <iostream>
using namespace std;
int main() {
string s;
int a, t = 0, temp = 0;
cin >> s >> a;
int len = s.length();
t = (s[0] - '0') / a;
if ((t != 0 && len > 1) || len == 1)
cout << t;
temp = (s[0] - '0') % a;
for (int i = 1; i < len; i++) {
t = (temp * 10 + s[i... |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int jiawin = 0, yiwin = 0;
int jia[3] = {0}, yi[3] = {0};
for(int i = 0; i < n; i++ ){
char s, t;
cin >> s >> t;
if(s == 'B' && t == 'C'){
jiawin++;
jia[0]++;
}else if(s == 'B' && t == 'J'){
yiwin++;
yi[2]++;
}else if(s == ... |
#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(char a, char b) {return a>b;}
int main(){
string s;
cin >> s;
s.insert(0, 4 - s.length(), '0');
do{
string a = s, b = s;
sort(a.begin(), a.end(), cmp);
sort(b.begin(), b.end());
int result = stoi(a) - stoi(b);
s = to_string(result);
... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct mooncake{
float mount, price, unit;
};
int cmp(mooncake a, mooncake b){
return a.unit > b.unit;
}
int main(){
int n, need;
cin >> n >> need;
vector<mooncake> a(n);
for(int i = 0; i < n; i++) scanf("%f", &a[i].mount);
for(int i... |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int a[10] = {0};
for (int i = 0; i < s.length(); i++)
a[s[i] - '0']++;
for(int i = 0; i< 10; i++)
if(a[i] != 0)
printf("%d:%d\n",i,a[i]);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, d;
cin >> a >> b >> d;
int t = a + b;
if(t == 0){
cout << 0;
return 0;
}
int s[100];
int i = 0;
while(t != 0){
s[i++] = t % d;
t = t / d;
}
for(int j = i-1; j >= 0; j--){
cout << s[j];
}
... |
#include <iostream>
using namespace std;
int main(){
int a[10], t;
for(int i = 0; i < 10; i++)
cin >> a[i];
for(int i = 1; i < 10; i++){
if(a[i] != 0){
cout << i;
t = i;
break;
}
}
for(int i = 0; i < a[0]; i++) cout << 0;
for(int i = 0; i < a[t] - 1; i++) cout << t;
for(int i = t + 1; i < 10; i++)... |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int i = 0;
while(s[i] != 'E') i++;
string t = s.substr(1, i-1);
int n = stoi(s.substr(i+1));
if(s[0] == '-') cout << "-";
if (n < 0){
cout << "0.";
for(int j = 0; j < abs(n) - 1; j++) cout << '0';
for (int j = 0; j < t.length(); j++)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.