NYOJ 74、77、94、100

NYOJ 74

#include<stdio.h>
 int main()
 {
 int m,n,i,t,g,h,w;
 while(scanf("%d%d",&m,&n)&&m!=0&&n!=0)
 {
    for(i=0,g=0,t=0;i<3;i++)
     {
         h=m%10;
         w=n%10;
         m=m/10;
         n=n/10;
         if(h+w+g>=10)
         {
         t++;//¼ÆÊý
         g=1;//½øλ
         }
    }
     printf("%d\n",t);
 }
 return 0;
 }

NYOJ 77

#include<stdio.h>
 int main()
 {
     int a[1002],i,j,n,k;
     scanf("%d%d",&n,&k);
     for(i=1;i<=n;i++){
            a[i]=0;
        for(j=2;j<=k;j++)
           if(i%j==0)a[i]=1-a[i];}
     for(i=1;i<=n;i++)
     if(!a[i]) printf("%d ",i);
     printf("\n");
     return 0;
 }

NYOJ 94

#include<cstdio>
int main()
 {
 int t,n,k,i;
 scanf("%d",&t);
 while(t--)
 {
  scanf("%d %d",&n,&k);
     for(i=1;i<=n;i++)
       if(i%k==0) n++;
 printf("%d\n",n);
 }
 return 0;
 }

NYOJ100

// bitset::count
#include <iostream>
#include <string>
#include <bitset>
using namespace std;

int main ()
{
  bitset<10> myset;
  cin>>myset;
  cout << "myset has " << int(myset.count()) << " ones ";
  cout << "and " << int(myset.size()-myset.count()) << " zeros.\n";

  return 0;
}