QQ599409683的博客

#include<stdio.h>#include<string.h>int main(){ int k; char a[20]; scanf("%d",&k); getchar(); while(k--) { scanf("%s",a); int flg=0; int i,j; i

#include<iostream>#include<algorithm>#include<cstdio>#include<stack>#include<cstring>using namespace std;stack <int> s;int main(){ int k; while(scanf("%d",&k)!=EOF) { int i,

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#define MAX 100000using namespace std;int n,m ,i,j; //n代表要从1到n，m代表路径的数量 int map[1001][1001]; //map[i][j]

#include<stdio.h>int main(){ int n,i; while(scanf("%d",&n)!=EOF){ int flag=1; for(i=2;i*i<=n;i++){ while(n%i==0){ if(flag){ print

#include<stdio.h>int main(){ int n; int s=1; while(scanf("%d",&n),n>=0){ int i; int cnt; if(s!=1) printf("\n"); printf("Case %d.\n",s++); for(i=2