#include #include #include #include using namespace std;int main(void){    int n,m,i,j,a[4];    while(scanf("%d%d",&n,&m)==2)    {        memset(a,0,sizeof(a));        double ans

#include#includeusing namespace std;const int maxn=100000+10;int n,r[maxn],left[maxn],right[maxn];bool test(int p){   int x=r[1],y=p-r[1],i;   left[1]=x;right[1]=0;   for(i=2;i

#include#includeusing namespace std;int n,num,T;int main(){   scanf("%d",&T);   while(T--){      scanf("%d",&n);      scanf("%d",&num);    int maxai=num;      scanf("%d",&num);  

#include#include#includeusing namespace std;int buf[10];int next(int n,int k){    if(!k) return 0;    long long k2=(long long)k*k;    int L=0;    while(k2>0){buf[L++]=k2%10;k2/=10;}

#include#includeusing namespace std;void update(int x,int a,int w,double &L,double &R){    if(a==0){       if(x=w) R=L-1;    }else if(a>0){       L=max(L,-(double)x/a);       R=min(R,(

#include#include#includeint readint(){    char c=getchar();    while(!isdigit(c)) c=getchar();    int x=0;    while(isdigit(c)){       x=x*10+c-'0';       c=getchar();    }    re

#includeconst int maxn=10000+2;int f[maxn];int main(){   int n,k,m;   while(scanf("%d%d%d",&n,&k,&m)==3&&n){       f[1]=0;       for(int i=2;i       int ans=(m-k+1+f[n])%n;       if(

#include#include#includeusing namespace std;const int maxn=250*250;const int INF=1000000000;int s[maxn],g[maxn],d[maxn];int num[maxn];int main(){   int T;   scanf("%d",&T);   for

#include#include#includeusing namespace std;struct Point{  int x,y;  bool operator       return x  }};const int maxn=100+10;Point P[maxn];int n,m,y[maxn],on[maxn],on2[maxn],lef

#include#includeusing namespace std;int A[100010],B[100010];int main(){    int n,S;    while(scanf("%d%d",&n,&S)==2){       for(int i=1;i         scanf("%d",&A[i]);       B[0]=0;  

#include#includeusing namespace std;const int maxn=24;maptable;int bitcount(int x){return x==0?0:bitcount(x/2)+(x&1);}int main(){   int n,A[maxn];   char s[1000];   while(scanf("%d",

#include#include#include#include#includeusing namespace std;int cnt;map id;int ID(string s){    if(!id.count(s)) id[s]=cnt++;    return id[s];}const int maxn=1000+5;struct Co

#include#includeconst int maxn=10+5;char grid[maxn][maxn];int n;int main(){   int T;   scanf("%d",&T);   for(int kase=1;kase       scanf("%d",&n);       for(int i=0;i         for

#include int qsort(int a[],int b[],int s,int t){    int x,i,j,temp;    if(s>=t) return 0;    x=b[s];i=s;j=t;    while(i    {          while(b[j]          if(i          {         

#include #include using namespace std;const int maxn=10000+5;struct Ant{    int id;    int p;    int d;    bool operator}before[maxn],after[maxn];const char dirName[3][10]={"L","

#includeqsort(int a[],int i,int j);int main(void){ int n,m,a[20000]={0},b[20000]={0},i,j,sum=0; while(scanf("%d%d",&n,&m)==2&&n&&m) {  for(i=1;i   scanf("%d",&a[i]);        for(i=1;i

#include #include #include #include using namespace std;int quickSelect(long long *c,long long beg,long long end,int k){    long long pivot,temp;    int i,j;    pivot=c[beg];    i=

#include#include#include#includeusing namespace std;#define REP(i,n) for(int i=0;iconst int maxn=10;int n;char pos[maxn][maxn][maxn];char view[6][maxn][maxn];char read_char(){ 

#include#include#include#includeusing namespace std;const int maxn=20;const int INF=100000000;int n,A[maxn][maxn],B[maxn][maxn];int check(int s){    memset(B,0,sizeof(B));    for

#include#include#include#include#include#includeusing namespace std;const int maxn=4;int n,dice[maxn][6],ans;vector names;int dice24[24][6]={{2,1,5,0,4,3},{2,0,1,4,5,3},{2,4,

#includeint f(int n){  return n==1?1:f(n/2)+1;}int main(){   int n;   while(scanf("%d",&n)==1)      printf("%d\n",f(n));   return 0;}

#includelong long f(int*P,int i,int final){    if(i==0)return 0;    if(P[i]==final) return f(P,i-1,final);    else return f(P,i-1,6-P[i]-final)+(1LL}const int maxn=60+10;int start[maxn],

#include#includeconst char*mahjong[]={"1T","2T","3T","4T","5T","6T","7T","8T","9T",                      "1S","2S","3S","4S","5S","6S","7S","8S","9S",                      "1W","2W","3W","4W",

#include#include#includeusing namespace std;const double PI=acos(-1.0);const int maxn=10000+5;int n,f;double A[maxn];bool ok(double area){    int sum=0;    for(int i=0;i=f+1) break

1、唉，好水的题~#include int main(void){    int m,n;    while(scanf("%d%d",&m,&n)==2)    {        printf("%d\n",n*m-1);    }    return 0;}