不停

#include<iostream>#include<math.h>#include<string>using namespace std;bool isPrime(int a){ if(a==1) return false; int n=sqrt(a); for(int i=2;i<=n;i++) { if(a%i==0) return false; }

1.存在错误，可能是输入中存在多余链表，未作筛选，懒的改了。#include<vector>#include<iostream>#include<unordered_map>#include<unordered_set>using namespace std;int main(){ char data[1000000];//结点地址有5位数字，故这个哈希表数组至少要开到10的6次方 int Next[1000000];//结点地

#include<iostream>using namespace std;int main(){ int n; scanf("%d",&n); int num[n]; int count[10000]={0}; for(int i=0;i<n;i++) { scanf("%d",&num[i]...

#include<iostream>#include<string.h>#include<algorithm>using namespace std;bool cmp(string& a,string& b){ return a+b<b+a;}int main(){ int N; scanf("%d"...

#include<iostream>#include<algorithm>using namespace std;struct node{ char name[20]; char ID[20]; int grade;};bool cmp(node a,node b){ return a.grade>b.grade;}i...

#include<iostream>#include<vector>using namespace std;int main(){ string n[10]={"zero","one","two","three","four","five","six","seven","eight","nine"}; string num; cin>&...

#include<iostream>using namespace std;int main(){ int N; scanf("%d",&N); int num[N]; for(int i=0;i<N;i++) scanf("%d",&num[i]); int left=0,right=0,maxval...

#include<iostream>#include<stack>using namespace std;int main(){ int M,N,K; scanf("%d %d %d",&M,&N,&K); while (K--) { int A[N],t=0; for(int ...

#include<iostream>#include<queue>#include<string>#include<algorithm>using namespace std;struct students{ char name[5]; int c;};struct courses{ queue<st...

#include<iostream>#include<algorithm>using namespace std;struct student{ /* data */ char ID[10]; char name[10]; int grade;};bool cmp1(student a,student b){ for(...

#include<iostream>using namespace std;struct user{ char username[11];// username char password[11];//password};int main(){ int N; scanf("%d",&N); user storage[N]; ...

#include<iostream>using namespace std;int main(){ int N; cin>>N; int sumdis=0; int distance[N]; for(int i=0;i<N;i++) { cin>>distance[i]; ...

#include<iostream>using namespace std;int maxx(double Panel[3][3],int line){ int max=0; int res=0; for(int i=0;i<3;i++) { if(Panel[line][i]>max) { ...

#include<iostream>#include<algorithm>using namespace std;int main(){ int M,N; cin>>M>>N; int Pix[M*N]; for(int i=0;i<M*N;i++) scanf("%d",&Pix...

#include<iostream>using namespace std;struct student{ char name[11]; char ID[11]; int grade; char gender;};int main(){ int n; cin>>n; student test[n]; ...

本题主要有两个要点1.数据的输入2.cmp函数的编写#include<iostream>#include<algorithm>using namespace std;struct user{ char ID[16]; int h; int m; int s; int h1; int m1; int s1;...

进制转换问题 难度不大#include<iostream>#include<vector>using namespace std;vector<char> res;void check(int color){ char c; if(color<13) { res.push_back('0'); ...

#include<iostream>#include<vector>using namespace std;int totaltime=0;void gotoo(int now,int next){ //up if(now<=next) { totaltime+=(next-now)*6+5; } el...

251234567890001 951234567890005 1001234567890003 951234567890002 771234567890004 8541234567890013 651234567890011 251234567890014 1001234567890012 85//只有22分 存在一个测试点过不去（）#include<iost...

question:https://pintia.cn/problem-sets/994805342720868352/problems/994805528788582400//第一次写的笨办法 没有拿到全分，主要考虑到数据不大，就这样写了#include<iostream>#include<math.h>using namespace std;int main(...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/* 将试机号作为数组下标 */#include &lt;stdio.h&gt;#include &lt;string.h&gt;typedef struct {char examNum[15];//准考证号int seatNum;//座位号} examiee...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/1071785779399028736#include<iostream>using namespace std;int main(){ int n, m;//n 为月饼种类 m为参评城市数 cin >> n >> m; in...

TIMU:https://pintia.cn/problem-sets/994805260223102976/problems/994805267416334336#include<iostream>#include<algorithm>//如果两个整数各位数字的和是一样的，则被称为是“朋友数”，而那个公共的和就是它们的“朋友证号”。//例如 123 和 51 就是...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805282389999616//f复杂度太大#include<stdio.h>#include<string.h>int main(){ char s[10000]; scanf("%s",&s); int len; ...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805295203598336#include<iostream>using namespace std;#include<time.h>int main(){ double c1,c2; cin>>c1>&gt...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/99480529425149132818分 希望大佬看看哪出错了#include<iostream>using namespace std;int main(){ int n; char c; scanf("%d %c",&n,&c...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805289432236032#include<iostream>using namespace std;class student{ public: int school; int grade;};int main(){ int ...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805291311284224#include<stdio.h>int main(){ int n,p; scanf("%d%d",&n,&p); int s[n+1]; for(int i=1;i<n+1;i++) {...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/1071785664454127616#include<stdio.h>#include<math.h>int main(){ int m; scanf("%d",&m); int k; for(...

TIMU:https://pintia.cn/problem-sets/994805260223102976/problems/994805260583813120#include<iostream>using namespace std;int main(){ string a; int n; cin >> a >> n; while(--n)...

timu:https://pintia.cn/problem-sets/994805260223102976/problems/994805260780945408#include<iostream>#include<iomanip>#include<math.h>using namespace std;int main(){ int n; c...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/1038429286185074688#include<iostream>#include<math.h>using namespace std;int reverse(int n){ int i = n % 10; int j = (n...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805301562163200#include<iostream>#include<iomanip>#include<algorithm>using namespace std;struct MoonCake{ doubl...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805270356541440

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805280817135616#include<iostream>#include<vector>#include<string>#include<cctype>using namespace std;int ...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805266514558976#include<iostream>int main(){ int m, n, a, b, point; scanf("%d %d %d %d %d\n", &m, &n, &a, &b...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805279328157696/* * （读取字符要注意回车的处理 可回顾一下 1018. 锤子剪刀布） * 1. 创建二维字符数组的 长度 * 2. 含高位的火星文，如果低位是0，不输出 */#include <stdio.h>#includ...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805307551629312

题目：https://pintia.cn/problem-sets/994805260223102976/problems/1038429191091781632#include<stdio.h>int main(){ int n; scanf("%d",&n); int result[n]; int count=0; for...

题目：https://pintia.cn/problem-sets/994805260223102976/problems/1038429065476579328#include<stdio.h>int main(){ int x,y; scanf("%d%d",&x,&y); int s; s=x*y; if(s==0) ...