- 博客(9)
- 收藏
- 关注
原创 1009
# include<stdio.h># include<stdlib.h># include<algorithm># include<iostream>using namespace std; struct house{ double value,cost;}s[1005];bool cmp(struct house x,struct house y){ double valuecosta = (double)x.value / (dou
2021-04-15 19:22:36
104
原创 2021-04-14
#include<iostream>#include<math.h>using namespace std;int main(){ int T,n; cin>>T; while(T--) { cin>>n; printf("%d\n", (int)( pow (10,((n*log10( (double) n)-( __int64)(n*log10(n)) ) ) ) ) ); } return 0;
2021-04-14 19:37:49
49
原创 2199
#include<stdio.h>#include<math.h>int main(){ int n,count; scanf("%d",&n); while(n--) { double Y; scanf("%lf",&Y); if(Y<6||Y>8*pow(100,4)+7*pow(100,3)+2*pow(100,2)+3*100+6) {printf("No solution!\n");break;} double le
2021-04-11 11:12:06
85
原创 2899
#include<stdio.h>int main(){ double left,right,ans,y,num,jian; int count; scanf("%d",&count); while(count--) { scanf("%lf",&y); left=0;right=100; int N=100; while(N--) { jian=(left+right)/2; num=42*jian*jian*jian*jian*j
2021-04-09 19:41:25
218
原创 2035
#include<stdio.h>int main(){ int a,b,result=1; while(scanf("%d%d",&a,&b)!=EOF) { if(a==0&&b==0)return 0; result=1; for(int i=1;i<=b;i++) { result*=a; result%=1000; } printf("%d\n",result); } return 0; }
2021-04-07 22:31:03
53
原创 1097(二分求高幂)
*二分求幂 int result = 1; while (b) { if (b % 2 == 1) result *= a; a *= a; b /= 2; } return result;```cpp#include<cstdio>#include<iostream>using namespace std; int main() { int a,b;
2021-04-07 20:23:15
42
原创 1021
#include<stdio.h>//从2开始每4个一循环能被3整除//int main(){ int m,n; while(scanf("%d",&n)!=EOF) { if(n%4==2)printf("yes\n"); else printf("no\n"); } return 0;}#include<stdio.h>//使用递归会超时//int f(int n);int main(){ int m,n; while(scanf("
2021-04-05 20:18:44
46
原创 杭电oj 1019
求最小公倍数题目入口第一个c++代码可以通过第二个和第三个c代码结果是对的,但是通不过。。。。#include <iostream>using namespace std;int main(){ int N,m,a,t; cin>>N; while(N--){ cin>>m; long long b=1; while(m--){ cin>>a; long long c=a*b;
2021-03-31 19:59:00
84
原创 杭电oj 1108
题目入口#include<stdio.h>int main(){int a,b,i,t;while(scanf("%d%d",&a,&b)!=EOF){i=a*b;while(b>0){t=a%b;a=b;b=t;}printf("%d\n",i/a);}return 0;}
2021-03-29 19:59:34
87
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人