Fake_God的博客

Codeforces 个人题解目录CLine EmpireCodeforces Round #783 (Div. 2)ADirection ChangeBSocial Distance

题目Codeforces Round #782 (Div. 2)题解#include<iostream>#include<cstdio>#include<vector>using namespace std;int main(void){ #define int long long int int t; scanf("%lld",&t); while(t--){ int n,a,b; scanf("%lld %lld %lld"

题目Codeforces Round #783 (Div. 2)题解#include<iostream>#include<vector>#include<algorithm>using namespace std;int cmp(int a,int b){ return a>b;}bool solve(int n,int m){ int a[100005]; for(int i=0;i<n;i++) cin >>

题目Codeforces Round #783 (Div. 2)题解#include<iostream>#include<algorithm>using namespace std;long long solve(long long n,long long m){ long long ans = min(m,n),dx = abs(m-n); ans = 2*(ans-1); if(dx%2) ans += (dx/2)*4+1;

题目团体程序设计天梯赛题解#include<iostream>#include<string>using namespace std;int N,M;int main(){ cin >> N >> M;getchar(); while(N--){ string s; getline(cin,s); if(s.find("qiandao")!=-1||s.find("easy"

题目【问题描述】利用单链表存储一元多项式。【基本要求】实现以下基本操作：（1）从键盘输入一元多项式的信息，建立一元多项式。（2）实现两个一元多项式相加，并输出和多项式。分析实现一个多项式类分类讨论多项式相加的情况实现多项式相加函数题解#include<stdio.h>#include<stdlib.h>const int N = 10e4;typedef struct node{ double coefficient; int index; s

#include<stdio.h>#include<stdlib.h>typedef struct node{ int data; struct node *pre; struct node *next;}node;typedef struct stack{ int size; node* l_top; node* l_end; node* r_top; node* r_end; void (*stack_add_size)(struct stack *

题源PTA 乙级题解#include<stdio.h>int T,K;int n1,b,t,n2;int main(){ scanf("%d %d",&T,&K); int i = 0; for(i = 0;i < K;i++){ scanf("%d %d %d %d",&n1,&b,&t,&n2); if(t>T){printf("Not enough tokens.

顺序表的插入题目合肥师范学院 陈皓题解bool ListInsert(SqList &L,int i,ElemType e){ int j; if(i<1||L.length+1<i) { cout<<"Insert position error!" ; return false; } if( L.length==MAXSIZE ) { cout<<

题目团体程序设计天梯赛题解#include<iostream>#include<cstdio>#include<string>using namespace std;int is_num(string x){ if(x[0]=='0')return 0; int sum = 0; for(auto c:x){ if('0'<=c&&c<='9'){ sum = s

题目GPLT题解#include<iostream>#include<vector>using namespace std;vector<vector<int>>chapter;int save[100];int main(){ int N,M; cin >> N >> M; while(N--){ int K; cin >> K;

题目题目 1148: C语言训练-计算1977！*题解#include<stdio.h>int main(){ printf("44885501861451087214610857079909248837424492260428166724654147729643971700105425720084828218702600864349140553199425461195269756193449196420567670679997930497776962868627670814

题目题目 1147: C语言训练-角谷猜想题解#include <stdio.h>int main(void){ int num; scanf("%d",&num); while(num!=1){ if(num%2){ printf("%d*3+1=",num); num = num*3+1; printf("%d
",num); }else{ printf("%d/2=",num); num = num/2; printf(

C语言训练1125 C语言训练-委派任务* 1126 C语言训练-字符串正反连接 1127 C语言训练-尼科彻斯定理 1128 C语言训练-排序问题<1> 1129 C语言训练-排序问题<2> 1130 C语言训练-数字母 1131 C语言训练-斐波纳契数列 1132 C语言训练-最大数问题 1133 C语言训练-求1+2!+3!+…+N!的和 1134 C语言训练-求PI* 1135 C语言训练-求s=a+aa+aaa+aaaa+aa…

题源团体程序设计天梯赛题解#include<stdio.h>float A,B;int main(){ scanf("%f %f",&A,&B); printf("%.0f",A); printf("/"); if(B<0)printf("(%.0f)",B); else printf("%.0f",B); printf("="); if(B==0)printf("Error"); else prin

题源团体程序设计天梯赛题解#include<iostream>#include<cmath>using namespace std;int N;double H,rW,sW;int main(){ cin >> N; while(N--){ cin >> H >> rW; sw = (H-100)*0.9; rW /= 2; if( fabs(rW-sw

题源团体程序设计天梯赛题解#include<iostream>using namespace std;int D;int main(){ cin >> D; cout << (D+8)%7+1; return 0;}

题源团体程序设计天梯赛题解因为负号的ASCII码是45,数字0的ASCII码是48所以"fu"和"ling"直接间隔两个空字符串#include<iostream>#include<string>using namespace std;string number[13]={"fu","","","ling","yi","er","san","si","wu","liu","qi","ba","jiu"};string str;int main(){ cin

题源团体程序设计天梯赛题解#include<iostream>#include<iomanip>using namespace std;int A,B;int main(){ cin >> A >> B; for(int i=A;i<=B;i++){ cout << setw(5) << i; if((i-A+1)%5==0)cout << endl;

题源团体程序设计天梯赛题解#include<iostream>using namespace std;int N,num,zero=0,one=0;int main(){ cin >> N; for(int i=0;i<N;i++){ cin >> num; if(num%2)one++; else zero++; } cout << one << "