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; j < 2; j++)
cout << c[i][j] << " ";
return 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 it;
for (int i = 0; i < n; ++i)
{
list<int> i1;
int t;
while (cin >> t&&t != n)//输入æ¯ä¸ªé¡¶ç‚¹ç›¸è¿žçš„图，以最终节点为结æŸæ ‡å¿—
i1.push_back(t);
graph.push_back(i1);
}
}
void CreateGraph1()
{
int n;
vector< list<int> >::iterator it;
ifstream in("data.txt");
in >> n;
for (int i = 0; i < n; ++i)
{
list<int> i1;
int t;
while (in >> t&&t != n)//输入æ¯ä¸ªé¡¶ç‚¹ç›¸è¿žçš„图，以最终节点为结æŸæ ‡å¿—
i1.push_back(t);
graph.push_back(i1);
}
}
void dfs(int v)//以v开始åšæ·±åº¦ä¼˜å…ˆæœç´¢
{
list<int>::iterator it;
visited[v] = true;
cout << v << " ";
for (it = graph[v].begin(); it != graph[v].end(); it++)
if (!visited[*it])
dfs(*it);
}
void dfs_noRecursion(int v)//以v开始åšæ·±åº¦ä¼˜å…ˆæœç´¢,éžé€’归实现
{
list<int>::iterator it;
visited[v] = true;
cout << v << " ";
stack<int>mystack;
mystack.push(v);
while (!mystack.empty())
{
v = mystack.top();
mystack.pop();
if (!visited[v])
{
cout << v << " ";
visited[v] = true;
}
for (it = graph[v].begin(); it != graph[v].end(); it++)
{
if (!visited[*it])
{
mystack.push(*it);
}
}
}
cout << endl;
}
void bfs(int v)//以v开始åšå¹¿åº¦ä¼˜å…ˆæœç´¢ï¼ˆéžé€’归实现，借助队列）
{
list<int>::iterator it;
visited[v] = true;
cout << v << " ";
queue<int> myque;
myque.push(v);
while (!myque.empty())
{
v = myque.front();
myque.pop();
for (it = graph[v].begin(); it != graph[v].end(); it++)
{
if (!visited[*it])
{
cout << *it << " ";
myque.push(*it);
visited[*it] = true;//访问过
}
}
}
cout << endl;
}
int main()
{
CreateGraph1();
cout << "result for bfs:" << endl;
bfs(0);
memset(visited, 0, sizeof(visited));
cout << "result for dfs(Recursion):" << endl;
dfs(0);
cout << endl;
memset(visited, 0, sizeof(visited));
cout << "result for nodfs(Recursion):" << endl;
dfs_noRecursion(0);
system("pause");
return 0;
}
|
#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++){
if(!visited[*it]){
cout << *it << " ";
q.push(*it);
visited[*it] = true;
}
}
cout << endl;
}
}
|
#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(BinTree BST);
void PostOrder(BinTree BST);
int main(){
BinTree BST;
ElementType X;
int N, i;
BST = NULL;
cin >> N;
for(i = 0; i < N; i++){
cin >> X;
BST = Insert(BST, X);
}
cout << "å…ˆåºé历" << endl;
PreOrder(BST);
cout << endl << "ä¸åºé历" << endl;
InOrder(BST);
cout << endl << "åŽåºé历" << endl;
PostOrder(BST);
return 0;
}
BinTree Insert(BinTree BST, ElementType X){
if(!BST){
BST = (BinTree)malloc(sizeof(struct TNode));
BST->Data = X;
BST->Left = BST->Right = NULL;
}
else if(X < BST->Data)
BST->Left = Insert(BST->Left, X);
else if(X > BST->Data)
BST->Right = Insert(BST->Right, X);
return BST;
}
void PreOrder(BinTree BST){
if(!BST) return ;
else{
cout << BST->Data << " ";
PreOrder(BST->Left);
PreOrder(BST->Right);
}
}
void InOrder(BinTree BST){
if(!BST) return ;
else{
InOrder(BST->Left);
cout << BST->Data << " ";
InOrder(BST->Right);
}
}
void PostOrder(BinTree BST){
if(!BST) return ;
else{
PostOrder(BST->Left);
PostOrder(BST->Right);
cout << BST->Data << " ";
}
}
|
#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);
Position FindMin(BinTree BST);
Position FindMax(BinTree BST);
int main()
{
BinTree BST, MinP, MaxP, Tmp;
ElementType X;
int N, i;
BST = NULL;
scanf("%d", &N);
for (i = 0; i<N; i++) {
scanf("%d", &X);
BST = Insert(BST, X);
}
MinP = FindMin(BST);
MaxP = FindMax(BST);
scanf("%d", &N);
for (i = 0; i<N; i++) {
scanf("%d", &X);
Tmp = Find(BST, X);
if (Tmp == NULL) printf("%d is not found\n", X);
else {
printf("%d is found\n", Tmp->Data);
if (Tmp == MinP) printf("%d is the smallest key\n", Tmp->Data);
if (Tmp == MaxP) printf("%d is the largest key\n", Tmp->Data);
}
}
scanf("%d", &N);
for (i = 0; i<N; i++) {
scanf("%d", &X);
BST = Delete(BST, X);
}
return 0;
}
BinTree Insert(BinTree BST, ElementType X)
{
if (!BST)
{
BST = (BinTree)malloc(sizeof(struct TNode));
BST->Data = X;
BST->Left = BST->Right = NULL;
}
else if (X < BST->Data)
BST->Left = Insert(BST->Left, X);
else if (X > BST->Data)
BST->Right = Insert(BST->Right, X);
return BST;
}
BinTree Delete(BinTree BST, ElementType X)
{
BinTree Temp;
if (!BST)
printf("Not Found\n");
else if (X < BST->Data)
BST->Left = Delete(BST->Left, X);
else if (X > BST->Data)
BST->Right = Delete(BST->Right, X);
else
{
if (BST->Left && BST->Right) //有两个å结点，用å³å节点最大代替。
{
Temp = FindMin(BST->Right);
BST->Data = Temp->Data;
BST->Right = Delete(BST->Right, Temp->Data);
}
else //有一个å结点或没有。
{
Temp = BST;
if (BST->Left) //åªæœ‰å·¦å结点；
BST = BST->Left;
else //åªæœ‰å³å结点；
BST = BST->Right;
free(Temp);
}
}
return BST;
}
Position Find(BinTree BST, ElementType X)
{
if (!BST)
return NULL;
if (X < BST->Data)
return(Find(BST->Left, X));
else if (X > BST->Data)
return(Find(BST->Right, X));
else
return BST;
}
Position FindMin(BinTree BST)
{
if (!BST)
return NULL;
if (!BST->Left)
return BST;
else
return FindMin(BST->Left);
}
Position FindMax(BinTree BST)
{
if (!BST)
return NULL;
if (!BST->Right)
return BST;
else
return FindMax(BST->Right);
}
|
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){
if(p->lchild->data == x){
DeleteXTree(p->lchild);
p->lchild = NULL;
}
else
EnQueue(Q, p->lchild);
}
if(p->rchild){
if(p->rchild->data == x){
DeleteXTree(p->rchild);
p->rchild = NULL;
}
else
EnQueue(Q, p->rchild);
}
}
}
}
|
#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->next = L->next;
L->next = s;
scanf("%d", &x);
}
return L;
}
LinkList List_TailInsert(LinkList &L){
ElemType x;
L = (LinkList*)malloc(sizeof(LNode));
LNode *s, *r = L;
scanf("%d", &x);
while(x != 99999){
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LNode *GetElem(LinkList L, int i){
int j = 1;
LNode *p = L->next;
if(i == 0) return L;
if(i < 1) return NULL;
while(p && j < i){
p = p->next;
j++;
}
return p;
}
LNode *LocateElem(LinkList L, ElemType e){
LNode *p = L->next;
while(p != NULL && p->data != e)
p = p->next;
return p;
}
LNode *PostInsert(LinkList &L, ElemType i){
LNode *p = GetElem(L, i - 1);
LNode *s;
s->next = p->next;
p->next = s;
return L;
}
LNode *PreInsert(LinkList &L, ElemType i){
LNode *p = GetElem(L, i -1);
LNode *s;
s->next = p->next;
p->next = s;
ElemType temp = p->data;
p->data = s->data;
s->data = temp;
return L;
}
LNode *Delete(LinkList &L, ElemType i){
LNode *p = GetElem(L, i - 1);
LNode *q = p->next;
p->next = q->next;
free(q);
/*
q=p->next;
p->data=p->next->data;
p->next=q->next;
free(q);
*/
}
|
#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 >> b;
cout << converse(a, b);
return 0;
}
|
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->data == x){
p = L;
L = L->next;
free(p);
Del_x_1(L, x);
}
else
Del_x_1(L->next, x);
}
// 2.3.2
void Del_x_2(LinkList &L, ElemType x){
LNode *p = L->next, *pre = L, *q;
while(p != NULL){
if(p->data == x){
q = p;
p = p->next;
pre->next = p;
free(q);
}
else{
pre = p;
p = p->next;
}
}
}
//2.3.2.2
void Del_x_3(LinkList &L, ElemType x){
LNode *p = L->next, *r = L, *q;
while(p != NULL){
if(p->data != x){
r->next = p;
r = p;
p = p->next;
}
else{
q = p;
p = p->next;
free(q);
}
}
}
//2.3.3
void R_Print(LinkList L){
if(L->next != NULL){
R_Print(L->next);
}
printf(L->data);
}
// 2.3.4
LinkList Delete_Min(LinkList &L){
LNode *pre = L, *p = L->next;
LNode *minpre = pre, *minp = p;
while(p != NULL){
if(p->data < minp->data){
minp = p;
minpre = pre;
}
pre = p;
p = p->next;
}
minpre->next = minp->next;
free(minp);
return L;
}
// 2.3.5
LinkList Reverse(LinkList L){
LNode *p = L->next, *q;
L->next = NULL;
while(p != NULL){
q = p->next;
p->next = L->next;
L->next = p;
p = q;
}
return L;
}
// 2.3.6
void Sort(LinkList &L){
LNode *p = L->next, *pre;
LNode *r = p->next;
p->next = NULL;
p = r;
while(p != NULL){
r = p->next;
pre = L;
while(pre->next != NULL && pre->next->data < p->data)
pre = pre->next;
p->next = pre->next;
pre->next = p;
p = r;
}
}
// 2.3.7
void RangeDelete(LinkList &L, int min, int max){
LNode *pr = L, *p = L->next;
while(p != NULL){
if(p->data > min && p->data < max){
pr->next = p->next;
free(p);
p = pr->next;
}
else{
pr = p;
p = p->next;
}
}
}
// 2.3.8
/*
两个链表有公共结点，å³ä¸¤ä¸ªé“¾è¡¨ä»ŽæŸä¸€ç»“点开始，他们的next都指å‘åŒä¸€ç»“点。
由于æ¯ä¸ªç»“点åªæœ‰ä¸€ä¸ªnextåŸŸï¼Œå› æ¤ä»Žç¬¬ä¸€ä¸ªå…¬å…±ç»“点开始，之åŽä»–们所有的节点都相åŒã€‚
*/
LinkList Search_Common(LinkList L1, LinkList L2){
int len1 = L1.length(), len2 = L2.Length();
LinkList longList, shortList;
if(len1 > len2){
longList = L1->next;
shortList = L2->next;
dist = len1 - len2;
}
else{
longList = L2->next;
shortList = L1->next;
dist = len2 - len1;
}
while(dist--) longList = longList->next;
while(longList != NULL){
if(longList == shortList)
return longList;
else{
longList = longList->next;
shortList = shortList->next;
}
}
return NULL;
}
// 2.3.9
void Min_Delete(LinkList &head){
while(head->next != NULL){
pre = head;
p = pre->next;
while(p->next != NULL){
if(p->next->data < pre->next->data){
pre = p;
p = p->next;
}
print(pre->next->data);
u = pre->next;
pre->next = u->next;
free(u);
}
free(head);
}
}
|
#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), PreOrder(n), Level(n);
for(int i = 0; i < n; i++)
cin >> PostOrder[i];
for(int i = 0; i < n; i++)
cin >> InOrder[i];
getLevel(n-1, 0, n-1, 0);
for(int i = 0; i < Level.size(); i++){
if(Level[i] != -1 && cnt != n - 1){
cout << Level[i] << " ";
cnt++;
}else if(Level[i] != -1){
cout << Level[i];
break;
}
}
return 0;
}
void getLevel(int root, int start, int end, int index){
if(start > end) return ;
int i = start;
while(i < end && InOrder[i] != PostOrder[root]) i++;
Level[index] = PostOrder[root];
getLevel(root - 1 - end + i, start, i - 1, 2 * index + 1);
getLevel(root - 1, i + 1, end, 2 * index + 2);
}
|
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 + llen, l2, l2 + llen - 1);
else
root->lchild = NULL;
if(rlen)
root->rchild = PreInCreat(A, B, h1 - rlen + 1, h1, h2 - rlen + 1, h2);
else
root->rchild = NULL;
return root;
}
|
#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);
for(int i = 0; i < n; i++)
cin >> InOrder[i];
for(int i = 0; i < n; i++)
cin >> PreOrder[i];
getLevel(0, 0, n-1, 0);
for(int i = 0; i < Level.size(); i++){
if(Level[i] != -1)
cout << Level[i] << " ";
}
return 0;
}
void getLevel(int root, int start, int end, int index){
if(start > end) return ;
int i = start;
while(i < end && InOrder[i] != PreOrder[root]) i++;
Level[index] = PreOrder[root];
getLevel(root + 1, start, i - 1, 2 * index + 1);
getLevel(root + 1 + i - start, i + 1, end, 2 * index + 2);
}
|
#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, d2;
while(scanf("%d%d", &time1, &time2) != EOF){
if(time1 > time2){
int temp = time1;
time1 = time2;
time2 = temp;
}
y1 = time1 / 10000, m1 = time1 % 10000 / 100, d1 = time1 % 100;
y2 = time2 / 10000, m2 = time2 % 10000 / 100, d2 = time2 % 100;
int ans = 1;
while(y1 < y2 || m1 < m2 || d1 < d2){
d1++;
if(d1 == month[m1][isLeap(y1)] + 1){
m1++;
d1 = 1;
}
if(m1 == 13){
y1++;
m1 = 1;
}
ans++;
}
printf("%d\n", ans);
}
return 0;
}
|
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;
}
}
return level;
}
|
#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] < a[m]) high = m - 1;
else low = m + 1;
}
for(int j = i - 1; j >= high + 1; j--)
a[j + 1] = a[j];
a[high + 1] = a[0];
}
for(int i = 1; i < len; i++)
cout << a[i];
return 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[i] = temp;
}
}
m--;
}
for(int i = 0; i < len; i++)
cout << a[i];
return 0;
}
|
#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 < len && arr[right] > arr[maxIdx]) maxIdx = right;
if(maxIdx != index)
{
int temp = arr[maxIdx];
arr[maxIdx] = arr[index];
arr[index] = temp;
adjust(arr, len, maxIdx);
}
}
void heapSort(int arr[], int size)
{
for(int i = size / 2 ; i >= 1; i--) //ä¸‹æ ‡ä»Ž0开始的è¯æ”¹ä¸º size / 2 - 1; i >= 0;
adjust(arr, size, i);
for(int i = size - 1; i >= 1; i--)
{
int tmp = arr[1]; // ä¸‹æ ‡ä»Ž0开始的è¯æ”¹ä¸º arr[0]
arr[1] = arr[i];
arr[i] = tmp;
adjust(arr, i, 1);
}
}
int main(){
int a[] = {-1, 6, 5, 2, 8, 4, 1, 3, 7};
int len = sizeof(a) / sizeof(a[0]);
heapSort(a, len);
for(int i = 0; i < len; i++)
cout << a[i];
return 0;
}
|
#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++] = arr[i++];
while(j < right) temp[t++] = arr[j++];
t = 0;
for(int i = left; i < right; i++)
arr[i] = temp[t++];
delete[] temp;
}
//归并排åº
void MSort(int arr[], int left, int right)
{
if(left + 1 < right){
int mid = (left + right) / 2;
MSort(arr, left, mid);
MSort(arr, mid, right);
Merge(arr, left, mid, right);
}
}
int main(){
int a[] = {6, 5, 2, 8, 4, 1, 3, 7};
int len = sizeof(a) / sizeof(a[0]);
MSort(a, 0 , len);
for(int i = 0; i < len; i++)
cout << a[i];
return 0;
}
|
#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] <= key) low++;
list[high] = list[low];
}
list[low] = list[0];
quickSort(list,left,low-1);
quickSort(list, low+1, right);
}
}
int main(){
int a[] = {-1, 6, 5, 2, 8, 4, 1, 3, 7};
int len = sizeof(a) / sizeof(a[0]);
quickSort(a, 1, len - 1);
for(int i = 1; i < len; i++)
cout << a[i];
return 0;
}
|
#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[i];
a[i] = a[k];
a[k] = temp;
}
}
for(int i = 1; i < len; i++)
cout << a[i];
return 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 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[i];
a[i] = temp;
i -= step;
}
}
step = step / 2;
}
for(int i = 0; i < len; i++)
cout << a[i];
return 0;
}
|
#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[j + 1] = a[j];
j--;
}
a[j + 1 ] = a[0];
}
}
for(int i = 1; i < len; i++)
cout << a[i];
return 0;
}
|
#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++;
j++;
}
else{
i=i-j+1;
j=0;
}
}
if(j>=t.length)
{
return (i-t.length);
}
else
{
return -1;
}
}
void StrAssign(SqString &s,char cstr[])
{
int i;
for(i=0;cstr[i]!='\0';i++)
{
s.data[i]=cstr[i];
}
s.length=i;
}
int main()
{
SqString S,T;
char str1[20];
char str2[20];
gets(str1);
gets(str2);
StrAssign(S,str1);
StrAssign(T,str2);
index(S,T);
return 0;
}
|
#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])
{
i++;
j++;
next[i] = j;
}
else
j = next[j];
}
}
/* 在 S ä¸æ‰¾åˆ° P 第一次出现的ä½ç½® */
int KMP(string S, string P, int next[])
{
GetNext(P, next);
int i = 0; // S çš„ä¸‹æ ‡
int j = 0; // P çš„ä¸‹æ ‡
int s_len = S.size();
int p_len = P.size();
while (i < s_len && j < p_len)
{
if (j == -1 || S[i] == P[j]) // P 的第一个å—符ä¸åŒ¹é…或 S[i] == P[j]
{
i++;
j++;
}
else
j = next[j]; // 当å‰å—符匹é…失败，进行跳转
}
if (j == p_len) // 匹é…æˆåŠŸ
return i - j;
return -1;
}
int main()
{
int next[100] = { 0 };
cout << KMP("bbc abcdab abcdabcdabde", "abcdabd", next) << endl; // 15
return 0;
}
|
#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(){
string s;
//å˜æ”¾æ¯ä¸ªå•è¯
vector<string> T;
int N;
cin>>N;
getchar();
string Q[N];
for(int i = 0;i<N;++i)
getline(cin,Q[i]);
for(int K = 0;K<N;++K){
T.clear(); //清空s
s = Q[K];
cout<<s<<endl<<"AI: ";
//注æ„è¦å…ˆè¾“出一és 在这里å‘äº†æ— æ•°é
for(int i =0;i<(int)s.size();++i)
//大å°å†™è½¬åŒ–，？å˜ä¸ºï¼
if(s[i]=='?')
s[i]='!';
else if(s[i]>='A'&&s[i]<='Z'&&s[i]!='I')
s[i] = 'a'+s[i]-'A';
//å•è¯åˆ†å‰²
for(int i = 0;i<(int)s.size();){
//i在循环内部增åŠ
string S=" ";
if(s[i]==' ') //ç©ºæ ¼è·³è¿‡
i++;
else if(judge(s[i])){ //如果是数å—或者å—æ¯
while(judge(s[i])&&i<(int)s.size())
S+=s[i++];
T.push_back(S);
}else{
S="";
while(s[i]!=' '&&i<(int)s.size())
//ä¸æ˜¯æ•°å—，å—æ¯å’Œç©ºæ ¼ï¼Œåˆ™æ˜¯æ ‡ç‚¹ç¬¦å·
S+=s[i++];
T.push_back(S);
}
}
//å°†iå’Œme替æ¢ä¸ºyou
for(int i =0;i<(int)T.size();++i){
if(T[i]==" I"||T[i]==" me")
T[i] = " you";
else if(T[i]==" you"){
//å°† can youå’Œ could you替æ¢ä¸ºI can
if(T[i-1]==" can"){
T[i-1]=" I";
T[i]=" can";
}else if(T[i-1]==" could"){
T[i]=" could";
T[i-1] = " I";
}
}
}
for(int i = 0;i<(int)T.size();++i){
if(i==0){
if(T[0][0]==' '){
for(int j = 1;j<T[0].size();++j)
cout<<T[0][j];
}else
cout<<T[i];
}else
cout<<T[i];
}
if(K!=N-1)
cout<<endl;
}
return 0;
}
|
#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 = 0; i < n; i++)
cin >> a[i].price;
for(int i = 0; i < n; i++)
a[i].unit = a[i].price / a[i].mount;
sort(a.begin(), a.end(), cmp);
float result = 0.0;
for(int i = 0; i < n; i++){
if(a[i].mount <= need){
result = result + a[i].price;
}else{
result = result + a[i].unit * need;
break;
}
need = need - a[i].mount;
}
printf("%.2f", result);
return 0;
}
|
#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 < BST->Data)
BST->Left = insert(BST->Left, Data);
else
BST->Right = insert(BST->Right, Data);
return BST;
}
void PreOrder(BinTree BST, vector<int>&a){
if(!BST) return ;
a.push_back(BST->Data);
PreOrder(BST->Left, a);
PreOrder(BST->Right, a);
}
void PreOrderMirror(BinTree BST, vector<int>&a){
if(!BST) return ;
a.push_back(BST->Data);
PreOrderMirror(BST->Right, a);
PreOrderMirror(BST->Left, a);
}
void PostOrder(BinTree BST, vector<int>&a){
if(!BST) return ;
PostOrder(BST->Left, a);
PostOrder(BST->Right, a);
a.push_back(BST->Data);
}
void PostOrderMirror(BinTree BST, vector<int>&a){
if(!BST) return ;
PostOrderMirror(BST->Right, a);
PostOrderMirror(BST->Left, a);
a.push_back(BST->Data);
}
vector<int> origin, Pre, PreM, PostM, Post;
int main(){
int N, Data;
BinTree BST = NULL;
cin >> N;
for(int i = 0; i < N; i++){
cin >> Data;
origin.push_back(Data);
BST = insert(BST, Data);
}
PreOrder(BST, Pre);
PreOrderMirror(BST, PreM);
PostOrder(BST, Post);
PostOrderMirror(BST, PostM);
if(origin == Pre){
cout << "YES" << endl;
for(int i = 0; i < Post.size(); i++){
cout << Post[i];
if(i < Post.size() - 1) cout << " ";
}
}else if(origin == PreM){
cout << "YES" << endl;
for(int i = 0; i < PostM.size(); i++){
cout << PostM[i];
if(i < PostM.size() - 1) cout << " ";
}
}else{
cout << "NO" << endl;
}
return 0;
}
|
#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), PreOrder(n), Level(n);
for(int i = 0; i < n; i++)
cin >> PostOrder[i];
for(int i = 0; i < n; i++)
cin >> InOrder[i];
getLevel(n-1, 0, n-1, 0);
for(int i = 0; i < Level.size(); i++){
if(Level[i] != -1 && cnt != n - 1){
cout << Level[i] << " ";
cnt++;
}else if(Level[i] != -1){
cout << Level[i];
break;
}
}
return 0;
}
void getLevel(int root, int start, int end, int index){
if(start > end) return ;
int i = start;
while(i < end && InOrder[i] != PostOrder[root]) i++;
Level[index] = PostOrder[root];
getLevel(root - 1 - end + i, start, i - 1, 2 * index + 1);
getLevel(root - 1, i + 1, end, 2 * index + 2);
}
|
#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])
break;
temp += 2;
}
maxvalue = temp > maxvalue ? temp : maxvalue;
temp = 0;
for(int j = 1; j < len; j++) {
if(i - j + 1 < 0 || i + j >= len || s[i - j + 1] != s[i + j])
break;
temp += 2;
}
maxvalue = temp > maxvalue ? temp : maxvalue;
}
cout << maxvalue;
return 0;
}
|
#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), PreOrder(n), Level(n);
for(int i = 0; i < n; i++)
cin >> InOrder[i];
for(int i = 0; i < n; i++)
cin >> PreOrder[i];
getLevel(0, 0, n-1, 0);
for(int i = 0; i < Level.size(); i++){
if(Level[i] != -1 && cnt != n - 1){
cout << Level[i] << " ";
cnt++;
}else if(Level[i] != -1){
cout << Level[i];
break;
}
}
return 0;
}
void getLevel(int root, int start, int end, int index){
if(start > end) return ;
int i = start;
while(i < end && InOrder[i] != PreOrder[root]) i++;
Level[index] = PreOrder[root];
getLevel(root + 1, start, i - 1, 2 * index + 2);
getLevel(root + 1 + i - start, i + 1, end, 2 * index + 1);
}
|
分æžï¼š1.æ¤é¢˜è€ƒæŸ¥çš„是对 0 -0 的特殊处ç†ã€‚当é‡åˆ° 0 时候把æ¤äººè½¬ä¸º1000å˜å‚¨, 所以读数æ®çš„时候è¦ä»¥å—符串形å¼è¯»å–
2.é历æ¯å¼ 照片，把与男主女主对应的异性亲密度用sumæ•°å—ç´¯åŠ èµ·æ¥ï¼Œ 并维护maxn[1] maxn[2]， 为男主女主的最亲密值 å’Œans[1], ans[2]容器，为最亲密异性id。
3.判æ–男主女主是å¦äº’为最亲密，如果是，输出并return 0， å¦åˆ™åˆ†åˆ«è¾“出他们的最亲密好å‹
4.注æ„è¾“å‡ºæ—¶å€™ï¼Œå› ä¸ºæŠŠ0当1000å˜å‚¨ï¼Œä¼šå¯¼è‡´0å·äººæŽ’在最åŽï¼Œè¿™æ˜¯ä¸ç¬¦é¢˜æ„的，输出之å‰æŽ’个åºï¼Œè®©1000排在最å‰é¢
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp (int a, int b) {
if(abs(a) == 1000) return true;
if(abs(b) == 1000) return false;
return abs(a) < abs(b);
}
int main(){
int n, m, num, k, sex[1010] = {0}, love[3];
double sum[1010] = {0}, maxn[3] = {0} ;
string s;
cin >> n >> m;
vector<vector<int>> v(m), ans(3);
for(int i = 0; i < m; i++) {
cin >> k;
for(int j = 0; j < k; j++){
cin >> s;
if(s == "0") s = "1000";
if(s == "-0") s = "-1000";
num = stoi(s);
sex[abs(num)] = num;
v[i].push_back(num);
}
}
for(int i = 1; i <= 2; i++) {
cin >> s;
if(s == "0") s = "1000";
if(s == "-0") s = "-1000";
love[i] = stoi(s);
}
for(int k = 1; k <= 2; k++) {
for(int i = 0; i < m; i++) {
int flag = 0;
for(int j = 0; j < v[i].size(); j++){
if(v[i][j] == love[k]) {
flag = 1;
break;
}
}
if(flag == 1) {
for(int j = 0; j < v[i].size(); j++){
if(love[k] * v[i][j] < 0) {
sum[(int)abs(v[i][j])] += 1.0 / v[i].size();
}
}
}
}
}
maxn[1] = maxn[2] = -1;
for(int k = 1; k <= 2; k++) {
for(int i = 1; i <= 1000; i++) {
if(love[k] * sex[i] < 0) {
if(sum[i] > maxn[k]) {
maxn[k] = sum[i];
ans[k].clear();
ans[k].push_back(sex[i]);
}else if(sum[i] == maxn[k]) {
ans[k].push_back(sex[i]);
}
}
}
}
if(maxn[1] == sum[(int)abs(love[2])] && maxn[2] == sum[(int)abs(love[1])]) {
string s1 = to_string(love[1]), s2 = to_string(love[2]);
if(love[1] == 1000) s1 = "0";
if(love[1] == -1000) s1 = "-0";
if(love[2] == 1000) s2 = "0";
if(love[2] == -1000) s2 = "-0";
cout << s1 << " " << s2 << endl;
return 0;
}
for(int k = 1; k <= 2; k++) {
sort(ans[k].begin(), ans[k].end(), cmp);
for(int i = 0; i < ans[k].size(); i++) {
string s1 = to_string(love[k]), s2 = to_string(ans[k][i]);
if(love[k] == 1000) s1 = "0";
if(love[k] == -1000) s1 = "-0";
if(ans[k][i] == 1000) s2 = "0";
if(ans[k][i] == -1000) s2 = "-0";
cout << s1 << " " << s2 << endl;
}
}
return 0;
}
|
#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[i] != 0)
num++;
}
printf("%d", num);
for(int i = 1000; i >= 0; i--){
if(a[i] != 0.0)
printf(" %d %.1f", i, a[i]);
}
return 0;
}
|
#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], depth + 1);
}
int main(){
int n, m, k, node, c;
cin >> n >> m;
for(int i = 0; i < m; i++){
cin >> node >> k;
for(int j = 0; j < k; j++){
cin >> c;
v[node].push_back(c);
}
}
dfs(1, 0);
printf("%d", book[0]);
for(int i = 1; i <= maxdepth; i++)
printf(" %d", book[i]);
return 0;
}
|
#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++){
if(i != 0) cout << " ";
cout << str[t[i] - '0'];
}
return 0;
}
|
#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 * 3600 + m1 * 60 +s1;
int tempOut = h2 * 3600 + m2 * 60 + s2;
if(tempIn < minn){
minn = tempIn;
unlocked = t;
}
if(tempOut > maxn){
maxn = tempOut;
locked = t;
}
}
cout << unlocked << " " << locked;
return 0;
}
|
#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){
sum = temp;
start = tempindex;
end = i;
}
}
if(sum < 0) sum = 0;
printf("%d %d %d", sum, v[start], v[end]);
return 0;
}
|
#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 = 0; i < m; i++){
int exp;
double coe;
cin >> exp >> coe;
for(int j = 0; j < n; j++){
result[exp + a[j].exp] += (coe * a[j].coe);
}
}
for(int i = 0; i <= 2000; i++){
if(result[i] != 0.0) number++;
}
cout << number;
for(int i = 2000; i >= 0; i--){
if(result[i] != 0.0)
printf(" %d %.1f", i, result[i]);
}
return 0;
}
|
#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, index++);
}
return sum;
}
long long find_radix(string n, long long num){
char it = *max_element(n.begin(), n.end());
long long low = (isdigit(it) ? it - '0' : it - 'a' + 10) + 1;
long long high = max(num, low);
while(low <= high){
long long mid = (low + high) / 2;
long long t = convert(n, mid);
if(t < 0 || t > num) high = mid - 1;
else if(t == num) return mid;
else low = mid + 1;
}
return -1;
}
int main(){
string n1, n2;
long long tag = 0, radix = 0, result_radix;
cin >> n1 >> n2 >> tag >> radix;
result_radix = tag == 1 ? find_radix(n2, convert(n1, radix)) : find_radix(n1, convert(n2, radix));
if(result_radix != -1){
printf("%lld", result_radix);
}else{
printf("Impossible");
}
return 0;
}
|
#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 *= maxvalue;
printf("%c ", c[maxchar]);
}
printf("%.2f", (ans * 0.65 - 1) * 2);
return 0;
}
|
#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 >> stu[i].score[1] >> stu[i].score[2] >> stu[i].score[3];
stu[i].score[0] = (stu[i].score[1] + stu[i].score[2] + stu[i].score[3]) / 3.0 + 0.5;
}
for(flag = 0; flag <= 3; flag++){
sort(stu, stu + n, cmp1);
stu[0].rank[flag] = 1;
for(int i = 1; i < n; i++){
stu[i].rank[flag] = i + 1;
if(stu[i].score[flag] == stu[i-1].score[flag])
stu[i].rank[flag] = stu[i-1].rank[flag];
}
}
for(int i = 0; i < n; i++){
exist[stu[i].id] = i + 1;
stu[i].best = 0;
int minn = stu[i].rank[0];
for(int j = 1; j <= 3; j++){
if(stu[i].rank[j] < minn){
minn = stu[i].rank[j];
stu[i].best = j;
}
}
}
char c[5] = {'A', 'C', 'M', 'E'};
for(int i = 0; i < m; i++){
cin >> id;
int temp = exist[id];
if(temp){
int best = stu[temp-1].best;
printf("%d %c\n", stu[temp-1].rank[best], c[best]);
}else
printf("N/A\n");
}
return 0;
}
|
#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(isPrime(n) == false) {
printf("No\n");
continue;
}
int len = 0, arr[100];
do{
arr[len++] = n % d;
n = n / d;
}while(n != 0);
for(int i = 0; i < len; i++)
n = n * d + arr[i];
printf("%s", isPrime(n) ? "Yes\n" : "No\n");
}
return 0;
}
|
#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) printf("Yes\n");
for(int i = index - 1; i >= 0; i--){
printf("%d", arr[i]);
if(i != 0) printf(" ");
}
if(index == 0)
printf("0");
return 0;
}
|
#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 < n; i++)
cin >> InOrder[i];
getLevel(n - 1, 0, n - 1, 0);
for(int i = 0; i < Level.size(); i++){
if(Level[i] != -1 && cnt != n - 1){
cout << Level[i] << " ";
cnt++;
}else if(Level[i] != -1){
cout << Level[i];
break;
}
}
return 0;
}
void getLevel(int root, int start, int end, int index){
if(start > end) return ;
int i = start;
while(i < end && InOrder[i] != PostOrder[root]) i++;
Level[index] = PostOrder[root];
getLevel(root - 1 - end + i, start, i -1, 2 * index + 1);
getLevel(root - 1, i + 1, end, 2 * index + 2);
}
|
#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] = temp + '0';
a[temp]--;
}
int flag1 = 0;
for(int i = 0; i < 10; i++){
if(a[i] != 0) flag1 = 1;
}
printf("%s", (flag == 1 || flag1 == 1) ? "No\n" : "Yes\n");
if(flag == 1) printf("1");
cout << s;
return 0;
}
|
#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);
vector<student> fin;
for(int i = 1; i <= n; i++) {
scanf("%d", &m);
vector<student> v(m);
for(int j = 0; j < m; j++) {
scanf("%lld %d", &v[j].no, &v[j].score);
v[j].local = i;
}
sort(v.begin(), v.end(), cmp1);
v[0].localrank = 1;
fin.push_back(v[0]);
for(int j = 1; j < m; j++) {
v[j].localrank = (v[j].score == v[j - 1].score) ? (v[j - 1].localrank) : (j + 1);
fin.push_back(v[j]);
}
}
sort(fin.begin(), fin.end(), cmp1);
fin[0].finrank = 1;
for(int j = 1; j < fin.size(); j++)
fin[j].finrank = (fin[j].score == fin[j - 1].score) ? (fin[j - 1].finrank) : (j + 1);
printf("%d\n", fin.size());
for(int i = 0; i < fin.size(); i++)
printf("%013lld %d %d %d\n", fin[i].no, fin[i].finrank, fin[i].local, fin[i].localrank);
return 0;
}
|
#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 << endl;
}
for(int i = n1 -1; i < n1 - 1 + n2; i++)
cout << s[i];
return 0;
}
|
#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 nowVisit, int &head, int &numMember, int &totalValue){
numMember++;
vis[nowVisit] = true;
if(weight[nowVisit] > weight[head])
head = nowVisit;
for(int i = 0; i < numPerson; i++){
if(G[nowVisit][i] > 0){
totalValue += G[nowVisit][i];
G[nowVisit][i] = G[i][nowVisit] = 0;
if(vis[i] == false)
DFS(i, head, numMember, totalValue);
}
}
}
void DFSTrave(){
for(int i = 0; i < numPerson; i++){
if(vis[i] == false){
int head = i, numMember = 0, totalValue = 0;
DFS(i, head, numMember, totalValue);
if(numMember > 2 && totalValue > k)
Gang[intToString[head]] = numMember;
}
}
}
int change(string str){
if(stringToInt.find(str) != stringToInt.end()){
return stringToInt[str];
}else{
stringToInt[str] = numPerson;
intToString[numPerson] = str;
return numPerson++;
}
}
int main(){
int w;
string str1, str2;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> str1 >> str2 >> w;
int id1 = change(str1);
int id2 = change(str2);
weight[id1] += w;
weight[id2] += w;
G[id1][id2] += w;
G[id2][id1] += w;
}
DFSTrave();
cout << Gang.size() << endl;
map<string, int>::iterator it;
for(it = Gang.begin(); it != Gang.end(); it++)
cout << it->first << " " << it->second << endl;
return 0;
}
|
#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' : s[j] = '%'; flag = 1; break;
case 'l' : s[j] = 'L'; flag = 1; break;
case 'O' : s[j] = 'o'; flag = 1; break;
}
}
if(flag){
string temp = id + " " + s;
v.push_back(temp);
}
}
int cnt = v.size();
if(cnt != 0){
printf("%d\n", cnt);
for(int i = 0; i < cnt; i++)
cout << v[i] << endl;
}else if(n == 1) {
printf("There is 1 account and no account is modified");
}else {
printf("There are %d accounts and no account is modified", n);
}
return 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 >> s.gender >> s.id >> s.grade;
if(s.gender == 'M') m.push_back(s);
else f.push_back(s);
}
sort(m.begin(), m.end(), cmp);
sort(f.begin(), f.end(), cmp);
if(!f.size()){
printf("Absent\n");
cout << m[0].name << " " << m[0].id << endl;
printf("NA\n");
return 0;
}
else
cout << f[f.size() - 1].name << " " << f[f.size() - 1].id << endl;
if(!m.size()){
printf("Absent\n");
printf("NA\n");
return 0;
}
else
cout << m[0].name << " " << m[0].id << endl;
cout << f[f.size() - 1].grade - m[0].grade;
return 0;
}
|
#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;
}
}
printf("None");
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]] = start[k];
}
char c[6] = {"SHCDJ"};
for(int i = 1; i < 55; i++){
end[i] = end[i] - 1;
printf("%c%d", c[end[i]/13], end[i]%13+1);
if(i != 54) printf(" ");
}
return 0;
}
|
#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", &left, &right);
if(left > right)
swap(left, right);
int temp = dis[right - 1] - dis[left - 1];
printf("%d\n", min(temp, sum - temp));
}
return 0;
}
|
#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 < lens1; i++){
if(!flag[s1[i]])
printf("%c", s1[i]);
}
return 0;
}
|
#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; j++){ // 大神的代ç 就是ä¸ä¸€æ ·ï¼Œè¿™æ¥å†™çš„太妙了
s.push(j);
if(s.size() > m) break;
while(!s.empty() && s.top() == v[current]){
s.pop();
current++;
}
}
if(current == n + 1) flag = true;
if(flag) printf("YES\n");
else printf("NO\n");
}
return 0;
}
|
#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;
}
}
}
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;
for(int i = 0; i < min1; i++){
if(a[i] == b[i] && (a[i] >= 'A' && a[i] <= 'G')){
t[0] = a[i];
j = i;
break;
}
}
for(int i = j + 1; i < min1; i++){
if(a[i] == b[i] && ((a[i] >= 'A' && a[i] <= 'N') || isdigit(a[i]))){
t[1] = a[i];
break;
}
}
for(int i = 0; i < min2; i++){
if(c[i] == d[i] && isalpha(c[i])){
pos = i;
break;
}
}
int m = t[1] - '0';
if(!isdigit(t[1])) m = t[1] - 'A' + 10;
cout << weekday[t[0] - 'A'];
printf("%02d:%02d", m, pos);
return 0;
}
|
#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++;
}
}
}
cout << cnt;
return 0;
}
|
#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);
s.insert(0, 4 - s.length(), '0');
cout << a << " - " << b << " = " << s << endl;
}while(s != "6174" && s != "0000");
return 0;
}
|
#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++)
if(t[j] != '.') cout << t[j];
}else{
cout << t[0];
int cnt, j;
for(j = 2, cnt = 0;j < t.length() && cnt < n; j++, cnt++) cout << t[j];
if (j == t.length()){
for(int k = 0; k < n - cnt; k++) cout << '0';
}else{
cout << '.';
for(int k = j; k < t.length(); k++) cout << t[k];
}
}
return 0;
}
|
#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 = next[first];
}
for(int i = 0; i < (sum - sum % k); i += k)
reverse(begin(list) + i, begin(list) + i + k);
for(int i = 0; i < sum - 1; i++)
printf("%05d %d %05d\n", list[i], data[list[i]], list[i + 1]);
printf("%05d %d -1", list[sum - 1], data[list[sum - 1]]);
return 0;
}
|
#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;
} else {
int lenans = ans.length();
int minlen = min(lens, lenans);
for(int j = 0; j < minlen; j++) {
if(ans[j] != s[j]) {
ans = ans.substr(0, j);
break;
}
}
}
}
reverse(ans.begin(), ans.end());
if (ans.length() == 0) ans = "nai";
cout << ans;
return 0;
}
|
#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 / gcdvalue;
b = b / gcdvalue;
suma = a * sumb + suma * b;
sumb = b * sumb;
gcdvalue = gcd(suma, sumb);
sumb = sumb / gcdvalue;
suma = suma / gcdvalue;
}
long long integer = suma / sumb;
suma = suma - (sumb * integer);
if(integer != 0){
printf("%lld", integer);
if(suma != 0) printf(" ");
}
if(suma != 0)
printf("%lld/%lld", suma, sumb);
if(integer == 0 && suma == 0)
printf("0");
return 0;
}
|
#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 pa_pos = find_pos(ino, pre[head]);
int left_size = pa_pos - left + 1;
if(head < (int)pre.size()){
if(pa_pos > left)
post_traverse(pre, ino, left, pa_pos - 1, head + 1);
if(pa_pos < right)
post_traverse(pre, ino, pa_pos + 1, right, head + left_size);
if(head == 0)
cout << pre[head] << endl;
else
cout << pre[head] << " ";
}
}
int main(){
int n, i, node;
string str;
stack<int> sta;
vector<int> pre, ino;
cin >> n;
for(i = 0; i < 2 * n; i++){
cin >> str;
if(str == "Push"){
cin >> node;
pre.push_back(node);
sta.push(node);
}
else{
ino.push_back(sta.top());
sta.pop();
}
}
post_traverse(pre, ino, 0, n - 1, 0);
return 0;
}
|
#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++);
for (j = i + 1; a[j] == b[j] && j < n; j++);
if (j == n) {
cout << "Insertion Sort" << endl;
sort(a, a + i + 2);
} else {
cout << "Merge Sort" << endl;
int k = 1, flag = 1;
while(flag) {
flag = 0;
for (i = 0; i < n; i++) {
if (a[i] != b[i])
flag = 1;
}
k = k * 2;
for (i = 0; i < n / k; i++)
sort(a + i * k, a + (i + 1) * k);
sort(a + n / k * k, a + n);
}
}
for (j = 0; j < n; j++) {
if (j != 0) printf(" ");
printf("%d", a[j]);
}
delete [] a;
delete [] b;
return 0;
}
|
#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] != '#') cnt1++;
for(int i = 0; i < a.length(); i++)
if(a[i] != '#') cnt2++;
if(cnt1 != 0) cout << "No " << cnt1;
else cout << "Yes " << cnt2;
return 0;
}
|
#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 > maxCount){
maxCount = start - i;
first = i;
}
}
if(maxCount == 0){
cout << 1 << endl;
cout << n;
return 0;
}
cout << maxCount << endl;
cout << first;
for(int i = 1; i < maxCount; i++)
cout << '*' << first + i;
return 0;
}
|
#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);
getchar();
for(int i = 0; i < N; i++){
getline(cin, temp);
if(temp[0] >= '0' && temp[0] <= '9'){
t = stoi(temp);
if(t == 0) cout << "tret" << endl;
else if(t / 13 == 0) cout << s1[t] << endl;
else if(t / 13 != 0 && t % 13 != 0)cout << s2[t / 13] << " " << s1[t % 13] << endl;
else cout << s2[t / 13] << endl;
}else {
if(temp.length() == 3){
for(int i = 1; i <= 12; i++){
if(s1[i] == temp) cout << i << endl;
}
for(int i = 1; i <= 12; i++){
if(s2[i] == temp) cout << i * 13 << endl;
}
}else{
string t1 = temp.substr(0, 3);
string t2 = temp.substr(4, 3);
int sum = 0;
for(int i = 1; i <= 12; i++){
if(s2[i] == t1) sum = sum + i * 13;
}
for(int i = 1; i <= 12; i++){
if(s1[i] == t2) sum = sum + i;
}
cout << sum << endl;
}
}
}
return 0;
}
|
#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 - k + 1; i++){
string temp = s.substr(i, k);
if(isPrime(temp)){
cout << temp;
return 0;
}
}
printf("404");
return 0;
}
|
#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.cnt ? a.siteId < b.siteId : a.cnt > b.cnt;
}
int main(){
int n, k;
cin >> n >> k;
vector<stu> v(n);
for(int i = 0; i < n; i++)
cin >> v[i].id >> v[i].sco;
for(int i = 1; i <= k; i++){
int num;
cin >> num;
if(num == 1){
string level;
cin >> level;
printf("Case %d: %d %s\n", i, num, level.c_str());
vector<stu> ans;
for(int j = 0; j < n; j++){
if(v[j].id[0] == level[0])
ans.push_back(v[j]);
}
sort(ans.begin(), ans.end(), cmp1);
for(int j = 0; j < ans.size(); j++)
printf("%s %d\n", ans[j].id.c_str(), ans[j].sco);
if(ans.size() == 0) printf("NA\n");
}else if(num == 2){
int cnt = 0, sum = 0;
int siteId;
cin >> siteId;
printf("Case %d: %d %d\n", i, num, siteId);
vector<stu> ans;
for(int j = 0; j < n; j++){
if(v[j].id.substr(1, 3) == to_string(siteId)){
cnt++;
sum += v[j].sco;
}
}
if(cnt != 0) printf("%d %d\n", cnt, sum);
else printf("NA\n");
}else if(num == 3){
string data;
cin >> data;
printf("Case %d: %d %s\n", i, num, data.c_str());
vector<site> ans;
unordered_map<string, int> m;
for(int j = 0; j < n; j++){
if(v[j].id.substr(4, 6) == data){
string tt = v[j].id.substr(1, 3);
m[tt]++;
}
}
for(auto it : m)
ans.push_back({it.first, it.second});
sort(ans.begin(), ans.end(), cmp2);
for(int j = 0; j < ans.size(); j++)
printf("%s %d\n", ans[j].siteId.c_str(), ans[j].cnt);
if(ans.size() == 0) printf("NA\n");
}
}
return 0;
}
|
#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.length(); i++){
if(i != 0) cout << " ";
cout << str[sum_num[i] - '0'];
}
return 0;
}
|
#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 && t-p!=1 && p*(t-p-1)==s.length()-t-1)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#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;
minname = name;
minnum = num;
}
}
cout << maxname << " " << maxnum << endl << minname << " " << minnum;
return 0;
}
|
#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 ( arr[n] == 1) break; //å°†è¢«è¦†ç›–çš„æ•°æ ‡è®°ä¸º1
arr[n] = 1;
}
}
sort(v.begin(), v.end(), cmp);
for(int i = 0; i< v.size(); i++){
if(arr[v[i]] == 0){
if(flag == 1) cout << " ";
cout << v[i];
flag = 1;
}
}
}
|
#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;
return 0;
}
|
#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(int i = 0; i < n - 1; i++)
cout << a[i] << " ";
cout << a[n - 1];
return 0;
}
|
#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 += v[i][j];
if(i == 1 && j % 2 == 0) A2 += v[i][j];
if(i == 1 && j % 2 == 1) A2 -= v[i][j];
if(i == 3) A4 += v[i][j];
if(i == 4 && v[i][j] > A5) A5 = v[i][j];
}
}
for(int i = 0; i < 5; i++){
if(i != 0) printf(" ");
if (i == 0 && A1 == 0 || i != 0 && v[i].size() == 0){
printf("N");
continue;
}
if(i == 0) printf("%d", A1);
if(i == 1) printf("%d", A2);
if(i == 2) printf("%d", v[2].size());
if(i == 3) printf("%.1f", A4 / v[3].size());
if(i == 4) printf("%d", A5);
}
return 0;
}
|
#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)) {
cnt++;
if (cnt >= M) v.push_back(num);
}
num++;
}
cnt = 0;
for (int i = 0; i < v.size(); i++) {
cnt++;
if (cnt % 10 != 1) printf(" ");
printf("%d", v[i]);
if (cnt % 10 == 0) printf("\n");
}
return 0;
}
|
#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() && i < b.length()){
if (a[i] == b[i] && ((a[i] >= 'A' && a[i] <= 'N') || isdigit(a[i]))){
t[1] = a[i];
break;
}
i++;
}
while(j < c.length() && j < d.length()){
if(c[j] == d[j] && isalpha(c[j])){
pos = j;
break;
}
j++;
}
string week[7] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};
int m = isdigit(t[1]) ? t[1] -'0' : t[1] - 'A' + 10;
cout << week[t[0]-'A'] << " ";
printf("%02d:%02d", m, pos);
return 0;
}
|
#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
return a.num < b.num;
}
int main() {
int n, low, high;
scanf("%d %d %d", &n, &low, &high);
vector<node> v[4];
node temp;
int total = n;
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &temp.num, &temp.de, &temp.cai);
if (temp.de < low || temp.cai < low)
total--;
else if (temp.de >= high && temp.cai >= high)
v[0].push_back(temp);
else if (temp.de >= high && temp.cai < high)
v[1].push_back(temp);
else if (temp.de < high && temp.cai < high && temp.de >= temp.cai)
v[2].push_back(temp);
else
v[3].push_back(temp);
}
printf("%d\n", total);
for (int i = 0; i < 4; i++) {
sort(v[i].begin(), v[i].end(), cmp);
for (int j = 0; j < v[i].size(); j++)
printf("%d %d %d\n", v[i][j].num, v[i][j].de, v[i][j].cai);
// cout 比 printf 慢， cout会超时
}
return 0;
}
|
#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++;
if (counta != 0) ta = m;
if (countb != 0) tb = n;
for (int i = 1; i < counta; i++)
ta = 10 * ta + m;
for (int i = 1; i < countb; i++)
tb = 10 * tb + n;
cout << ta + tb;
return 0;
}
|
#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] - '0') / a;
cout << t;
temp = (temp * 10 + s[i] - '0') % a;
}
cout << " " << temp;
return 0;
}
|
#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 == 'C' && t == 'B'){
yiwin++;
yi[0]++;
}else if(s == 'C' && t == 'J'){
jiawin++;
jia[1]++;
}else if(s == 'J' && t == 'B'){
jiawin++;
jia[2]++;
}else if(s == 'J' && t == 'C'){
yiwin++;
yi[1]++;
}
}
cout << jiawin << " " << n - jiawin - yiwin << " " << yiwin << endl << yiwin << " " << n - yiwin - jiawin << " "<< jiawin << endl;
int maxjia = jia[0] >= jia[1] ? 0: 1;
maxjia = jia[maxjia] >= jia[2] ? maxjia : 2;
int maxyi = yi[0] >= yi[1] ? 0: 1;
maxyi = yi[maxyi] >= yi[2] ? maxyi : 2;
char str[4] = {"BCJ"};
cout << str[maxjia] << " " << str[maxyi];
return 0;
}
|
#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);
s.insert(0, 4 - s.length(), '0');
cout << a << " - " << b << " = " << s << endl;
}while(s != "6174" && s != "0000");
return 0;
}
|
#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 = 0; i < n; i++) scanf("%f", &a[i].price);
for(int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
sort(a.begin(), a.end(), cmp);
float result = 0.0;
for(int i = 0; i < n; i++){
if(a[i].mount <= need){
result = result + a[i].price;
}else{
result = result + a[i].unit * need;
break;
}
need = need - a[i].mount;
}
printf("%.2f", result);
return 0;
}
|
#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];
}
return 0;
}
|
#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++)
for(int k = 0; k < a[i]; k++)
cout << i;
return 0;
}
|
#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++)
if(t[j] != '.') cout << t[j];
}else{
cout << t[0];
int cnt, j;
for(j = 2, cnt = 0;j < t.length() && cnt < n; j++, cnt++) cout << t[j];
if (j == t.length()){
for(int k = 0; k < n - cnt; k++) cout << '0';
}else{
cout << '.';
for(int k = j; k < t.length(); k++) cout << t[k];
}
}
return 0;
}
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 1