X-man

摘要： #include<stdio.h>int main(){ int _case,a; int n,b; scanf("%d",&_case); while(_case--) { scanf("%d%d",&n,&b); a=n; b%=9973; for(int i=0;;i++) { a+=9973; if(a%b==0)break; } printf("%d\n",(a/b)%9973); } return 0... 阅读全文

摘要： #include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;const int N=1010;bool visit[N];vector<int>prime;int init_prim(){ memset(visit,true,sizeof(visit)); int num=0; prime.push_back(1); for(int i=2; i<=N; i++) { if(visit[i]==true) { 阅读全文

摘要： #include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;vector<int>prime;vector<int>::iterator it1,it;const int N=10100;bool visit[N];//int prime[N];int num=0;int init_prim(){ memset(visit,true,sizeof(visit)); prime.push_back(0); 阅读全文

摘要： #include<stdio.h>int cal(int m){ while(m>9) { //int yu=m; int sum=0; for(int i=0;m;i++) { sum+=m%10; m/=10; } m=sum; } return m;}int main(){ int n; while(scanf("%d",&n)!=EOF&&n!=0) { int mul=1; for(int... 阅读全文