AcWing 715. 余数
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
for(int i = 2; i < 10000; i++){
if(i % n == 2) printf("%d\n",i);
}
return 0;
}
AcWing 710. 六个奇数
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 6;
int main()
{
int n;
cin >> n;
if(n % 2 == 1){
for(int i = 0; i < N; i++){
printf("%d\n",n);
n += 2;
}
}
else{
n += 1;
for(int i = 0; i < N; i++){
printf("%d\n",n);
n += 2;
}
}
return 0;
}
AcWing 711. 乘法表
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
for(int i = 1; i <= 10; i++){
printf("%d x %d = %d\n",i,N,i*N);
}
return 0;
}
AcWing 718. 实验
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int N,A;
int c = 0,r = 0,f = 0;
float c1 = 0,c2 = 0,c3 = 0;
cin >> N;
while(N--){
char T;
cin >> A >> T;
if(T == 'C') c += A;
if(T == 'R') r += A;
if(T == 'F') f += A;
}
int num = c+r+f;
c1 = c*100.0/num;
c2 = r*100.0/num;
c3 = f*100.0/num;
printf("Total: %d animals\nTotal coneys: %d\nTotal rats: %d\nTotal frogs: %d\nPercentage of coneys: %.2lf %%\nPercentage of rats: %.2lf %%\nPercentage of frogs: %.2lf %%\n",num,c,r,f,c1,c2,c3);
return 0;
}
AcWing 713. 区间 2
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int N,i=0,o=0;
cin >> N;
for(int j = 0; j < N; j++){
int a = 0;
cin >> a;
if(a >= 10 && a <= 20){ i++;}
else {
o++;}
}
printf("%d in\n%d out\n",i,o);
return 0;
}
AcWing 719. 连续奇数
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,t;
cin>>n;
for(int i=1;i<=n;i++)
{
int x=0,y=0,num=0;
cin>>x>>y;
if(y>x)
{
t=y;
y=x;
x=t;
}
if(x-y!=0)
{
for(int j=1;j<=x-y-1;j++)
{
int c=0;
c=y+j;
if(c%2==0)
continue;
else
num+=c;
}
cout<<num<<endl;
}
else
cout<<"0"<<endl;
}
return 0;
}