|
|
|
|
讨论 Discussion |
|
| |
 fenqiqiuiquqiuqiuiquiquiquiquiuiuqqiquiu |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct gx{
int len;
short y[201];
}g[101];
gx cheng(gx t,int s){
int i,k;
for( i=1;i<=t.len;i++)t.y[i]*=s;
for(i=1;i<=t.len;i++){
t.y[i+1]+= t.y[i]/10;
t.y[i]%=10;
}
k=t.len+1;
while(t.y[k]>10){
t.y[k+1]+=t.y[k]/10;
t.y[k]%=10;
k++;
};
while(t.y[k]==0)k--;
t.len=k;
return t;
}
gx jia(gx a,gx b){//高精度数a+b
int i,j,k; gx c;
c.len=0;
memset(&c,0,sizeof(struct gx));
k=(a.len>b.len)?a.len:b.len;
for(i=1;i<=k;i++){
c.y[i]+=a.y[i]+b.y[i];
if (c.y[i]>=10){
c.y[i+1]+=(c.y[i]/10);
c.y[i]%=10;
}
}
k++;
while( c.y[k]==0)k--;
c.len=k;
return c;
}
int main()
{
freopen("p1088.in","r",stdin);
freopen("p1088.out","w",stdout);
int n,m;
int i,j;
while(!feof(stdin)){
n=0;m=0;
cin >> n >> m;
if(m==0&&n==0)break;
if(n<m){
cout<<0<<endl;
continue;
}
memset(&g,0,sizeof(struct gx)*101);
g[1].len=1;g[1].y[1]=1;//
for(i=1;i<=n;i++)
{
for(j=m;j>=1;j--)
{
if (i<j)
{
memset(&g[j],0,sizeof(struct gx));
continue;
}
g[j]=jia(cheng(g[j],j),g[j-1]);
}
}
for(i=g[m].len;i>=1;i--)cout<<g[m].y[i];
cout<<endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( ) |
 gfhhtrutyjthtyhgyi8uydy6trtrgfertr |
#include<bits/stdc++.h>
using namespace std;
int main() {
freopen("p1677.in","r",stdin);
freopen("p1677.out","w",stdout);
int n, original;
cin >> n;
original = n;
vector<int> factors;
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
factors.push_back(i);
n /= i;
}
}
cout << original << "=";
if (factors.size() == 1) {
cout << factors[0] << endl;
} else {
for (int i = 0; i < factors.size(); i++) {
if (i > 0) cout << "*";
cout << factors[i];
}
cout << endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| zxfrfrgedgre |
#include<bits/stdc++.h>
using namespace std;
int main() {
freopen("p1677.in","r",stdin);
freope("p1677.out","w",stdout);
int n, orgnal;
cin >> n;
oriinal = n;
vecor<int> factors;
for(int i = 2; i <= n; i++) {
while (n % i == 0) {
factors.push_k(i);
n /= i;
}
}
cout << original << "=";
if (factors.size() == 1) {
cout << factors[0] << endl;
} else {
for (int i = 0; i < factors.size(); i++) {
if (i > 0) cout << "*";
cout << factors[i];
}
cout << endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| p1000a+b; |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b,c;
cin>>n;
a=n/100;
b=n%100/10;
c=n%100%10/1;
cout<<c<<a<<b;
return 0;
}
( )
|
| p1000 |
#include <iostream>
using namespace std;
int main() {
freopen("p1704.in","r",stdin);
freopen("p1704.out","w",stdout);
int N;
cin >> N;
for (int row = 1; row <= N; ++row) {
for (int space = 1; space <= N - row; ++space) {
cout << " ";
}
for (int num = 1; num <= row; ++num) {
cout << num;
}
for (int num = row - 1; num >= 1; --num) {
cout << num;
}
cout << endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
| 54254637 |
int a[100]={0};
int i=0,j=0,s=0,k=0,m,n;
cin>>m>>n;
for(i=1;i<=m;i++)a[i]=1;
for(i=1;i<=m-1;i++)
{
do
{
j++;
if(j==m+1)j=1;
s=s+a[j];
}
while(s!=n);
a[j]=0;
s=0;
}
for(i=1;i<=m;i++)
if(a[i]==1)cout<<i;
( )
|
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1000 |
|
其它 |
通过 |
398人 |
提交 |
3301次 |
通过率 |
12% |
难度 |
0 |
|
|
|
|
|
|
