|
|
|
|
讨论 Discussion |
|
| |
 p1642答案 |
#include<bits/stdc++.h>
int sushu(int x){
int i,j,f=1;
for(i=2;i<=int(sqrt(x));i++){
if(x%i==0){f=0;break;}
}
return f;
}
int huiwen(int x){
int i=0,j,f=1,s,t,c[20]={0};
s=x;
while(s>0){i++;c[i]=s%10;s=s/10;}
for(j=1;j<=i/2;j++)if(c[j]!=c[1+i-j]){f=0;break;}
return f;
}
using namespace std;
int main(){
//freopen("p1642.in","r",stdin);
//freopen("p1642.out","w",stdout);
int i,j,k,n,s,x=0,y=0,p,t,f=0,d=0;
cin>>s; n=s;
y=n;
if (y%2==0)y++;
do{
y+=2;
if(sushu(y)&&huiwen(y)){cout<<y;break;}
}while(1==1);
//fclose(stdin);
//fclose(stdout);
return 0;
}
( ) |
| |
#include<iostream>
using namespace std;
int main(){
freopen("p1692.in","r",stdin);
freopen("p1692.out","w",stdout);
int x,y,n,k;
cin>>x>>y;
n=2*x;
k=y-n;
k=k/2;
cout<<k<<" "<<x-k;
return 0;
fclose(stdin);
fclose(stdout);
}
( )
|
| 1 |
#include<iostream>
using namespace std;
int main() {
int i,n,a[101]= {0};
cin>>n;
a[1]=1;
a[2]=2;
a[3]=3;
for(i=3; i<=n; i++) {
a[i]=a[i-1]+a[i-2]+a[i-3];
}
cout << a[n];
return 0;
}
( )
|
| 1 |
#include<iostream>
using namespace std;
int main() {
int i,n,a[101]= {0};
cin>>n;
a[1]=1;
a[2]=2;
a[3]=3;
for(i=3; i<=n; i++) {
a[i]=a[i-1]+a[i-2]+a[i-3];
}
cout << a[n];
return 0;
}
( )
|
| 1 |
#include<iostream>
using namespace std;
int main() {
int i,n,a[101]= {0};
cin>>n;
a[1]=1;
a[2]=2;
a[3]=3;
for(i=3; i<=n; i++) {
a[i]=a[i-1]+a[i-2]+a[i-3];
}
cout << a[n];
return 0;
}
( )
|
| |
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
freopen("p1725.in","r",stdin);
freopen("p1725.out","w",stdout);
int a[101][101]={0},i,j,n;
cin>>n;
for(i=n;i>=1;i--){
a[i][i]=n-i+1;
for(j=i-1;j>=1;j--)a[i][j]=n-i+1;
for(j=i-1;j>=1;j--)a[j][i]=n-i+1;
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)cout<<setw(3)<<a[i][j];
cout<<endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| |
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p1091.in","r",stdin);
freopen("p1091.out","w",stdout);
int n,a[10000]={0},i=2,t=2,k,j,q=0;
cin>>n;
a[1]=2;
a[2]=3;
if(n==1||n==2)cout<<a[n];
for(j=2;j<=10000;j++){
k=0;
for(j=1;j<=2;j++){
k++;
a[i+1]=a[i]+t;
i++;
if(i==n){q=1;
cout<<a[i];break;
}
if(k==2)t++;
}
if(q==1)break;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
 666 |
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p1091.in","r",stdin);
freopen("p1091.out","w",stdout);
int n,a[10000]={0},i=2,t=2,k,j,q=0;
cin>>n;
a[1]=2;
a[2]=3;
if(n==1||n==2)cout<<a[n];
for(j=2;j<=10000;j++){
k=0;
for(j=1;j<=2;j++){
k++;
a[i+1]=a[i]+t;
i++;
if(i==n){q=1;
cout<<a[i];break;
}
if(k==2)t++;
}
if(q==1)break;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| 666 |
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p1091.in","r",stdin);
freopen("p1091.out","w",stdout);
int n,a[10000]={0},i=2,t=2,k,j,q=0;
cin>>n;
a[1]=2;
a[2]=3;
if(n==1||n==2)cout<<a[n];
for(j=2;j<=10000;j++){
k=0;
for(j=1;j<=2;j++){
k++;
a[i+1]=a[i]+t;
i++;
if(i==n){q=1;
cout<<a[i];break;
}
if(k==2)t++;
}
if(q==1)break;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
 m |
#include<bits/stdc++.h>
using namespace std;
int main() {
freopen("p1728.in","r",stdin);
freopen("p1728.out","w",stdout);
int a[100][100],n=0,i,j;
cin>>n;
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
a[i][j]=min(i,(n-j+1));
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
cout<<setw(3)<<a[i][j];
}
cout<<endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| m |
#include<bits/stdc++.h>
using namespace std;
int main() {
freopen("p1728.in","r",stdin);
freopen("p1728.out","w",stdout);
int a[100][100],n=0,i,j;
cin>>n;
for(i=1;i<=n;i++) {
for(j;j<=n;j++) {
a[i][j]=min(i,(n-j+1));
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
cout<setw(3)<<a[i][j];
}
cout<endl;
}
fclose(stdin);
fcloe(stdout);
return 0;
}
( )
|
| m |
#include<bits/stdc++.h>
using namespace std;
int main() {
freopen("p1728.in","r",stdin);
freopen("p1728.out","w",stdout);
int a[100][100],n=0,i,j;
cin>>n;
for(i=1;i<=n;i++) {
for(j;j<=n;j++) {
a[i][j]=min(i,(n-j+1));
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
cout<setw(3)<<a[i][j];
}
cout<endl;
}
fclose(stdin);
fcloe(stdout);
return 0;
}
( )
|
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1642 |
|
模拟 |
通过 |
59人 |
提交 |
288次 |
通过率 |
20% |
难度 |
1 |
|
|
|
|
|
|
