patA
小耗子001
得到的和得不到的都是收获
展开
-
patA1023 have fun with numbers (20)
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=100001;int hashT[maxn]={0};int hashb[maxn]={0};struct bign{ int d[1...原创 2018-05-30 20:32:47 · 184 阅读 · 0 评论 -
patA1085 完美数列 upper_bound()
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=100001;int num[maxn];int main(int argc, char** argv) { int n,p; scanf("%d%d",&n,&p)...原创 2018-05-11 21:20:26 · 167 阅读 · 0 评论 -
patA1085 完美数列(25)
注意点:int*int 最大值可能达到10^18暴力解决的时间复杂度肯定超时。#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=100001;int num[maxn];int binarySearch(int i,int n,lo...原创 2018-05-11 20:45:43 · 200 阅读 · 0 评论 -
patA1048 Find Coins
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=100001;int main(int argc, char** argv) { int n,k; scanf("%d %d",&n,&k); int num[max...原创 2018-05-03 15:04:36 · 130 阅读 · 0 评论 -
patA1048 Find coins 用散列进行优化
#include <iostream>#include <cstdio> using namespace std;const int maxn=10001;int hashT[maxn]={0};int main(int argc, char** argv) { int n,m; scanf("%d %d",&n,&m); for(int i=0;i<...原创 2018-05-03 15:37:59 · 175 阅读 · 0 评论 -
patB1030/patA1085 完美数列
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=100001;int num[maxn];int main(int argc, char** argv) { int n,p; scanf("%d%d",&n,&p)...原创 2018-05-09 22:07:29 · 210 阅读 · 0 评论 -
patA1038 Recover the Smallest Number
using namespace std;const int maxn=10001;string str[maxn];//bool cmp(string a,string b){// return a<b;//}int main(int argc, char** argv) { int n; cin>>n; for(int i=0;i<n;i++) cin>>st...原创 2018-05-09 21:50:01 · 158 阅读 · 0 评论 -
patA1050 String Subtration
#include <iostream>#include <cstdio>#include <cstring>using namespace std;char str1[10001];char str2[10001];int hashT[128]={0}; //record the number;int main(int argc, cha...原创 2018-05-02 15:06:15 · 135 阅读 · 0 评论 -
patA1041 Be Unique
要按照输入的次序来,我们要对有序数字进行记录。#include <iostream>#include <cstdio>using namespace std;int hashT[10001]={0};int record[100001];int main(int argc, char** argv) { int n; scanf("%d",&n); for(int ...原创 2018-05-02 14:50:43 · 122 阅读 · 0 评论 -
patA1067 Sort with Swap(0,*)
#include <iostream>#include <cstdio> #include <algorithm>using namespace std;const int maxn=100001;int num[maxn]; //目标数组;int op[maxn]; //操作的数组; bool place[maxn]; //对应的...原创 2018-05-08 21:32:36 · 171 阅读 · 0 评论 -
patA1033 to fill or not fill
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;//在汽车的行驶过程中,如果有更便宜的,选择便宜的,加一定量。去下一个更便宜的。 //有没有必要计算俩个加油点的距离?//又没有必要对距离原点的距离进行排序? struct postion{ double per...原创 2018-05-06 13:31:05 · 187 阅读 · 0 评论 -
patA1044 Shopping in Mars(25) 暴力
#include <iostream>#include <cstdio>using namespace std;const int maxn=100001;int num[maxn];int main(int argc, char** argv) { int n,pay; scanf("%d%d",&n,&pay); for(int i=0;i<n;i...原创 2018-05-13 22:25:22 · 185 阅读 · 0 评论 -
patA 1096 Consecutive Factors(20)
#include <iostream>#include <cstdio>#include <cmath>using namespace std;int main(int argc, char** argv) { int n; scanf("%d",&n); int len=sqrt(n); int start,max=0; for(int i=2;i&l...原创 2018-05-30 19:54:09 · 185 阅读 · 0 评论 -
patA1015 Reversible Prime(20)
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=1000001;//int prime[];bool isprime[maxn]={false};bool S[maxn]={false};int buf[11]={0};void ...原创 2018-05-24 21:54:31 · 166 阅读 · 0 评论 -
patA1088 Rational Arithmetic
#include <iostream>#include <cstdio>#include <cmath>using namespace std;typedef long long ll;struct fraction{ ll up,down; };ll gcd(ll a,ll b){ return b==0 ? a : gcd(b,a%b);}fraction ...原创 2018-05-23 22:10:08 · 153 阅读 · 0 评论 -
patA1081 Ration Sum
#include <iostream>#include <cstdio>#include <cmath>using namespace std;const int maxn=100;typedef long long ll;struct Faction{ long long up,down;};Faction f[maxn];long long gcd(long...原创 2018-05-16 21:42:41 · 133 阅读 · 0 评论 -
patA1081 Rational Sum(20)
#include <iostream>#include <cstdio>using namespace std;typedef long long ll;struct fraction{ ll up,down;};int gcd(int a,int b){ return b==0 ? a : gcd(b ,a % b);}fraction reduction(fractio...原创 2018-05-22 22:21:20 · 147 阅读 · 0 评论 -
patB1049/patA1104 数列的片段和
#include <iostream>#include <cstdio>using namespace std;const int maxn=100010;double S[maxn];int main(int argc, char** argv) { int N; scanf("%d",&N); for(int i=1;i<=N;i++) scanf("%l...原创 2018-05-15 20:33:27 · 302 阅读 · 0 评论 -
patA1078 hashing
#include <iostream>#include <cstdio>#include <cmath>using namespace std;bool hashT[10001]={false};bool isprime(int n){ if(n<=1) return false; int len=(int )sqrt(1.0*n); for(int i ...原创 2018-05-25 22:35:28 · 190 阅读 · 0 评论 -
patA1101/B1045 快速排序(25)
#include <iostream>#include <cstdio>using namespace std;const int maxn=100010;const int INF=0x7fffffff;int S[maxn];int leftmax[maxn];int rightmin[maxn];void init(int n){ int max=0; for(int...原创 2018-05-14 20:31:27 · 168 阅读 · 0 评论 -
patA1029 Median(25)
#include <iostream>#include <cstdio>using namespace std;const int maxn=1000002;int num1[maxn],num2[maxn];int main(int argc, char** argv) { int n; scanf("%d",&n); for(int i=1;i<=n;i...原创 2018-05-14 19:45:24 · 209 阅读 · 0 评论 -
PatA1044 Shopping in Mars(25) 二分优化
1.数据本身没有规律,通过求和后发现递增,这样就可以考虑要用二分法来优化了。#include <iostream>#include <cstdio>using namespace std;const int maxn=100002;int num[maxn],nears=100002;int up_bound(int *a,int sum,int x,int len,int...原创 2018-05-14 19:14:19 · 201 阅读 · 0 评论 -
patA1037 Magic Coupon
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=100001;int c[maxn],p[maxn];bool cmp(int a,int b){ return a>b;}int main(int argc, char** ...原创 2018-05-08 20:21:13 · 131 阅读 · 0 评论 -
patA 1077 Kuchiguse
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;char ss[101][300]={'0'};int main(int argc, char** argv) { int N; scanf("%d",&N...原创 2018-04-19 20:01:44 · 213 阅读 · 0 评论 -
patA1031 hello world for u
#include <iostream>#include <cstdio> #include <cstring>using namespace std;int main(int argc, char** argv) { char str[81]; gets(str); int len=strlen(str); int numV=(len+2)/3; //sta...原创 2018-04-13 21:21:54 · 125 阅读 · 0 评论 -
patA1103 dfs
#include <iostream>#include <stdio.h>#include <vector>using namespace std;vector<int> fac,ans,temp;int N,K,P;int power(int x){ int ans=1; for(int i=0;i<P;i++){ ans*=x; } re...原创 2018-03-27 15:04:15 · 163 阅读 · 0 评论 -
pata1002多项式的相加
#include <iostream>#include <cstdio> using namespace std;int main(int argc, char** argv) { int k1,k2; scanf("%d",&k1); double p1[1001]={0},p2[1001]={0}; for(int i=0;i<k1;i++){ int ...原创 2018-04-09 22:00:37 · 251 阅读 · 0 评论 -
patA A+B in Hogwarts
#include <iostream>#include <cstdio>using namespace std;const int G=17*29;const int S=29;int main(int argc, char** argv) { int g1,s1,k1,g2,s2,k2; scanf("%d.%d.%d %d.%d.%d",&g1,&s1...原创 2018-04-14 21:03:26 · 101 阅读 · 0 评论 -
patA1027 Colors in Mars
#include <iostream>#include <cstdio>#include <algorithm> using namespace std;const int maxn=10001;char d[maxn];int dsize=0;void change(int x){ int count=0; do{ if(x%13<=9){ d[d...原创 2018-04-14 20:49:45 · 126 阅读 · 0 评论 -
patA1019General Palindromic Number
#include <iostream>#include <cstdio>using namespace std;const int maxn=10001;int d[maxn];int dsize=0;bool judge(int *a){ int i=0,j=dsize-1; for(int it=0;it<=dsize/2;it++){ if(d[i]!=d[j...原创 2018-04-14 19:42:53 · 113 阅读 · 0 评论 -
patA1020 根据postorder and inorder 输出level order
#include <iostream>#include <stdio.h>#include <queue>using namespace std;struct node{ int data; node* lchild; node* rchild;}; const int maxn=100;int n;int post[maxn],in[maxn];node* c...原创 2018-03-26 16:43:15 · 425 阅读 · 1 评论 -
pata1065
#include <iostream>#include <cstdio>using namespace std;int main(){ int T,Testid=1; scanf("%d",&T); while(T--){ long long a,b,c; scanf("%lld%lld%lld",&a,&...原创 2018-04-08 22:10:15 · 148 阅读 · 0 评论 -
pata1046 最短路
#include <iostream>#include <algorithm>using namespace std;const int maxn=1000001;int main(){ int N; int num[maxn]; cin>>N; for(int i=1;i<=N;i++){ cin>>nu...原创 2018-04-08 21:54:52 · 151 阅读 · 0 评论 -
patA1107
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn=1024;int course[maxn]={0};int person[maxn];int isroot[maxn]={0};int findroot(int x){ if(...原创 2018-03-31 10:50:15 · 127 阅读 · 0 评论 -
patA1059的修改,需要考虑特殊值
#include <iostream>#include <stdio.h>#include <math.h>using namespace std;struct factor{ int x; int cnt;}fac[10];const int maxn=100010;int prime[maxn],primenum=0;bool isprime[maxn];v...原创 2018-03-25 16:31:14 · 114 阅读 · 0 评论 -
patA1091 bfs
#include <iostream>#include <stdio.h>#include <queue>using namespace std;struct node{ int x,y,z;};int m,n,l,T;int map[1300][130][61];bool book[1300][130][61]={false};int next1[6][3]=...原创 2018-03-27 16:27:42 · 128 阅读 · 0 评论 -
patA1058 第二种方法
#include <iostream>#include <cstdio> using namespace std;int main(int argc, char** argv) { int g1,s1,k1,g2,s2,k2; scanf("%d.%d.%d %d.%d.%d",&g1,&s1,&k1,&g2,&s2,&k2)...原创 2018-04-15 19:34:44 · 293 阅读 · 0 评论 -
patA1005 Spell It Right
#include <iostream>#include <cstring>#include <algorithm>using namespace std;string s[10]={"zero","one","two","three","four","five","six","原创 2018-04-18 22:07:40 · 111 阅读 · 0 评论 -
patA1035 Password
#include <iostream>#include <cstring> #include <cstdio>using namespace std;const int maxn=1005;struct person{ char name[20]; char pw[20]; bool flag; person(){ flag=false; }}p[maxn];...原创 2018-04-18 21:33:17 · 141 阅读 · 0 评论 -
patA1001 Format
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int num[10];int numsize=0;int main(int argc, char** argv) { int a,b; scanf("%d%d",...原创 2018-04-18 20:08:01 · 191 阅读 · 0 评论