//Openjudge[小学奥数-李白的酒]:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;

double ans;
ans=0;
cin>>n;
for(i=1;i<=n;i++)
ans=(ans+1)/2;

printf("%.5lf",ans);
return 0;
}

.

·······

上午是讲新课

Hello---

有谁做完了题目

大整数加法OK；
大整数减法……

#include <bits/stdc++.h>
using namespace std;
char a1[202];//设置数组 （符号--加数1）
char b1[202];//设置数组 （符号--加数2）
int a[202],b[202],c[202];//设置数组（数字）
int main()
{
int lena,lenb,lenc,x,i;//定义变量
gets(a1);//读取a1
lena=strlen(a1);//获取a1的长度
gets(b1);//读取b1
lenb=strlen(b1);//获取b1的长度
memset(a,0,sizeof(a));//清零a
memset(b,0,sizeof(b));//清零b
memset(c,0,sizeof(c));//清零c
for(i=0;i<=lena-1;i++)//循环 --ASCII值变数字型
a[lena-i]=a1[i]-48;
for(i=0;i<=lenb-1;i++)//循环 --同上
b[lenb-i]=b1[i]-48;
lenc=1;
x=0;
while(lenc<=lena||lenc<=lenb)//循环 --做加法运算
{
c[lenc]=a[lenc]+b[lenc]+x;//做加法运算
x=c[lenc]/10;
c[lenc]=c[lenc]%10;
lenc++;//进位运算
}
c[lenc]=x;
while(c[lenc]==0&&lenc>1)//循环 --特殊情况处理
lenc--;
for(i=lenc;i>=1;i--)//循环 --输出
cout<<c[i]; //用 printf("%d",c[i]); 更好。
return 0;
}

#include <bits/stdc++.h>
using namespace std;
char a1[202];//设置数组 （符号）
char b1[202];//设置数组 （符号）
int a[202],b[202],c[202];//设置数组（数字）
int main()
{
int lena,lenb,lenc,x,i;//定义变量

gets(a1);//读取a1
lena=strlen(a1);//获取a1的长度
gets(b1);//读取b1
lenb=strlen(b1);//获取b1的长度

memset(a,0,sizeof(a));//清零a
memset(b,0,sizeof(b));//清零b
memset(c,0,sizeof(c));//清零c

for(i=0;i<=lena-1;i++)//循环
a[lena-i]=a1[i]-48;
for(i=0;i<=lenb-1;i++)//循环
b[lenb-i]=b1[i]-48;
lenc=1;
x=0;
while(lenc<=lena||lenc<=lenb)//循环
{
c[lenc]=a[lenc]+b[lenc]+x;
x=c[lenc]/10;
c[lenc]=c[lenc]%10;
lenc++;
}
c[lenc]=x;
while(c[lenc]==0&&lenc>1)//循环
lenc--;
for(i=lenc;i>=1;i--)//循环
cout<<c[i];
return 0;
}

你等等

NOI NOI oier LV 6 @ 10分钟前

1.6.10：脑力彻底耗尽，1.6.11都是懵逼的
改一下的程序都能改错
1.6.10 Accepted（AC）：
#include <bits/stdc++.h>
using namespace std;
char a1[202],b1[202];
int a[202],b[202],c[202];
int main(){
int lena,lenb,lenc,x,i;
gets(a1);
lena=strlen(a1);
gets(b1);
lenb=strlen(b1);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for(i=0;i<=lena-1;i++)
a[lena-i]=a1[i]-48;
for(i=0;i<=lenb-1;i++)
b[lenb-i]=b1[i]-48;
lenc=1;
x=0;
while(lenc<=lena||lenc<=lenb){
c[lenc]=a[lenc]+b[lenc]+x;
x=c[lenc]/10;
c[lenc]=c[lenc]%10;
lenc++;
}
c[lenc]=x;
while(c[lenc]==0&&lenc>1)
lenc--;
for(i=lenc;i>=1;i--)
cout<<c[i];
return 0;
}

NOI NOI oier LV 6 @ 3分钟前

现在连我自己都看着发昏

我帮你看看

再发一遍

0.0

下面那个程序我自己看着都发昏，哪怕是我自己写的

嗨起来

不要怂

聊天呀

有

聊天吧

0.0

有人吗

哎——————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————

习惯就好

1.6.10：脑力彻底耗尽，1.6.11都是懵逼的
改一下的程序都能改错
1.6.10 Accepted（AC）：
#include <bits/stdc++.h>
using namespace std;
char a1[202],b1[202];
int a[202],b[202],c[202];
int main(){
int lena,lenb,lenc,x,i;
gets(a1);
lena=strlen(a1);
gets(b1);
lenb=strlen(b1);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for(i=0;i<=lena-1;i++)
a[lena-i]=a1[i]-48;
for(i=0;i<=lenb-1;i++)
b[lenb-i]=b1[i]-48;
lenc=1;
x=0;
while(lenc<=lena||lenc<=lenb){
c[lenc]=a[lenc]+b[lenc]+x;
x=c[lenc]/10;
c[lenc]=c[lenc]%10;
lenc++;
}
c[lenc]=x;
while(c[lenc]==0&&lenc>1)
lenc--;
for(i=lenc;i>=1;i--)
cout<<c[i];
return 0;
}

1.6.14//
#include<bits/stdc++.h>
using namespace std;
int a[100000],n,w=1;
void fac(int k){
int x=0,i;
for(i=1;i<=w;++i){
a[i]=a[i]*k+x;
x=a[i]/10;
a[i]%=10;
}
while (x>0){
w++;
a[w]=x%10;
x/=10;
}
}
int main(){
int j,i;
a[1]=1;
scanf("%d",&n);
for(i=1;i<=n;++i)
fac(i);
for(j=w;j>=1;--j)
printf("%d",a[j]);
return 0;
}

//Openjudge[1.12-10]:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
int a[10001]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973};
cin>>n;
for(i=1;i<=n;i++)
if(a[i+1]-a[i]==2 && a[i+1]<=n)
cout<<a[i]<<" "<<a[i+1]<<endl;
if(n<=4)
cout<<"empty";
return 0;
}

Pascal第四题：
var a:array[1..100] of integer;
i,j,x,b,c:longint;
begin
readln(x);
b:=x; c:=x;
i:=0;
repeat
i:=i+1;
a[i]:=x mod 16;
x:=x div 16;
until x=0;
for j:=i downto 1 do
if a[j]<10 then write(a[j])
else write(chr(ord(a[j])-10+ord('A')));
writeln;
i:=0;
repeat
i:=i+1;
a[i]:=b mod 2;
b:=b div 2;
until b=0;
for j:=i downto 1 do
write(a[j]);
writeln;
i:=0;
repeat
i:=i+1;
a[i]:=c mod 8;
c:=c div 8;
until c=0;
for j:=i downto 1 do
write(a[j]);
writeln;
end.

第七题：
#include<bits/stdc++.h>
int a[100+10];
using namespace std;
int main(){
int b,c;
int i,j;
for(i=2;i<=100;i++){
b=0;
c=0;
for(j=1;j<=i-1;j++)
if(i%j==0){
a[b++]=j;
c+=j;
}
if(c==i)
cout<<i<<" ";
}
return 0;
}

哥德巴赫猜想
输入n（n<=1012），出结果；
#include<bits/stdc++.h>
using namespace std;
int a[102];
int main(){
int n,i,j,mark;
cin>>n;
if(n%2==0&&n>=4){
for(i=1;i<=n;i+=2){
for(j=2;j<=i;j++)
if(i%j==0){
mark=1;
break;
}
if(i==j)
a[i]=i;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)

if(a[i]+a[j]==n){
cout<<a[i]<<"+"<<a[j]<<"="<<n<<endl;

break;
}

}

return 0;
}

第八题：
#include <bits/stdc++.h>
using namespace std;
int prime(int n){
int i;
for(i=2;i<=sqrt(n);i++)
if(n%i==0) return 0;
return 1;
}
int main(){
int i,j,n;
cout<<" Welcome to Goldbach conjecture validator 6.0"<<endl;
cout<<" Let's verify goldbach conjecture,PROVE:"<<endl;
cout<<" Please enter the one you want to used to verify an even number:"<<endl;
cin>>n;
if(n<4){ cout<<"NO,this number is less than four.";return 0;}
for(i=2;i<=n;i++)
for(j=1;j<=n;j++)
if(i+j==n){
if(prime(i)==1&&prime(j)==1&&n%2==0) {
cout<<"YES such as:"<<i<<"+"<<j<<"="<<n;return 0;}
if(prime(i)==1&&prime(j)==1&&n%2!=0){
cout<<"Although the number is odd, but can be used of two prime Numbers, and said.";return 0;}
}
cout<<"NO,this number is an odd number or decimals.";
return 0;
}

第六题：
#include <bits/stdc++.h>
using namespace std;
int a[100000000];
void bubsort(int n){
int i,j;
for(i=1;i<=n;i++) cin>>a[i];
for(i=1;i<=n-1;i++)
for(j=i;j<=n-1;j++)
if(a[j]>a[j+1]) swap(a[j],a[j+1]);
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
}
int main(){
int n;
cin>>n;
bubsort(n);
return 0;
}

第五题：
#include <bits/stdc++.h>
using namespace std;
int min(int a,int b){
if(a<b) return a;
if(a>=b) return b;
}
int gcd(int a,int b){
int i;
for(i=min(a,b);i>=1;i--){
if(a%i==0&&b%i==0) return i;
}
}
int lcm(int a,int b){
int i;
for(i=min(a,b);i>=min(a,b);i++)
if(i%a==0&&i%b==0) return i;
}
int main(){
int a,b;
cin>>a>>b;
cout<<gcd(a,b)<<" "<<lcm(a,b);
return 0;
}

第三题：
#include <bits/stdc++.h>
using namespace std;
int fac(long long n){
if(n==0||n==1) return 1;
else return n*fac(n-1);
}
int main(){
cout<<fac(1)+fac(2)+fac(3)+fac(4)+fac(5)+fac(6)+fac(7)+fac(8)+fac(9)+fac(10);
return 0;
}

第二题：
#include <bits/stdc++.h>
using namespace std;
int max(int p,int q){
if(p>q) return p;
if(q>=p) return q;
}
int max3(int a,int b,int c){
int m;
m=max(a,b);
m=max(m,c);
}
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<max3(a,b,c);
return 0;
}

第一题：
#include <bits/stdc++.h>
using namespace std;
int prime(int x){
int i;
for(i=2;i<=sqrt(x);i++)
if(x%i==0) return 0;
return 1;
}
int main(){
int n,o;
cin>>n;
o=prime(n);
if(o==1) cout<<"YES";
else cout<<"NO";
return 0;
}

/*完全数*/
#include <bits/stdc++.h>
using namespace std;
int main(){
int i,j,k,t;
int x[100];
for(i=2;i<=100;i++){
t=0,k=0;
for(j=1;j<i;j++)
if(i%j==0) {
x[k++]=j;
t+=j;
}

if(t==i)
cout<<i<<" ";
}
return 0;

}

#include<bits/stdc++.h>
int a[100+10];
using namespace std;
int main()
{
int n,b,c;
int i,j;
cin>>n;
for(i=2;i<=n;i++)
{

b=0;

c=0;
for(j=1;j<=i-1;j++)
if(i%j==0)
{
a[b++]=j;
c+=j;

}
if(c==i)
cout<<i<<" ";
}
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,a,b,i,j;
int x,y;
x=0;
y=0;
cin>>n;

for(m=4;m<=n;m=m+2)

for(a=2,b=m-a;a<=b;a++)

{

for(i=2;i<=(a/2);i++)

if(a%i==0)

break;

if(i>(a/2))

{

x=1;

b=m-a;

}

for(j=2;j<=(b/2);j++)

if(b%j==0)

break;

if(j>(b/2))

y=1;

if(x*y==1)

{

cout<<m<<"="<<a<<"+"<<b<<endl;

x=0;

y=0;

break;

}

}
return 0;
}

粗来

#include<bits/stdc++.h>
using namespace std;
int a[502],k[502];
int main(){
long long i,j;
for(i=1;i<=10000000000;i++){
if(......)
cout<<i;return 0;
}
for(j=0;j<=-10000000000;j--){
if(......)
cout<<j;return 0;
}
long double k,l;
for(l=0.0000000000000001;l<=10000000000;l+=0.0000000000000001){
if(......)
cout<<l;return 0;
}
for(k=0;k>=-10000000000;l-=0.0000000000000001){
cout<<k;return 0;
}
}//"......"用来填方程

#include<bits/stdc++.h>
using namespace std;
int a[502],k[502];
int main(){
long long i,j;
for(i=1;i<=10000000000;i++){
if(......)
cout<<i;
}
for(j=0;j<=-10000000000;j--){
if(......)
cout<<j;
}
}//"......"用来填方程

#include<bits/stdc++.h>
using namespace std;
int a[502],k[502];
int main(){
int i,j;
for(i=1;i<=2000000000;i++){
if(......)
cout<<i;
}
for(j=0;j<=-2000000000;j--){
if(......)
cout<<j;
}
}//"......"用来填方程

我在风中凌乱.......................................................................................................................................................................................................................................................................................................................................

憋说话，让他一个人尴尬

main(a\to do){
means date inorout to{std}
Does here have some people?
case it {do up}
answer please{\9}
}
main{b\must/can do it {do c}{
troll means c call me
or{up/down}
said something do{/b that introduction}
}
main{/c todo b that introduction}{
if(that priming b){
do call me at a
}

下面的奇怪程序解答：
1）问：有人吗？
2）请答复我。

main(a\to do){
means date inorout to{std}
Does here have some people?
case it {do up}
answer please{\9}
}

第一题：
#include <bits/stdc++.h>
using namespace std;
struct student{//st[101]
unsigned int num;
char name[25];
float chi,mat,eng;
float tot;
}st[101];
int main(){
int i,j,n;
cin>>n;
for(i=1;i<=n;i++){
cin>>st[i].num;scanf("%s",st[i].name);cin>>st[i].chi>>st[i].mat>>st[i].eng;
st[i].tot=st[i].chi+st[i].mat+st[i].eng;
}
for(i=1;i<=n-1;i++)
for(j=i;j<=n-1;j++)
if(st[j].tot>st[j+1].tot) swap(st[j],st[j+1]);
for(i=n;i>=1;i--){
cout<<st[i].num<<" "<<st[i].tot<<endl;
}
return 0;
}