nyoj 可以直接写的简单题 - c++编程基础

ile(temp)
{
sum += m * (temp%10);
temp /= 10;
}
}
cout< }
return 0;
}
此题最优程序
[cpp]
#include
#include
using namespace std;
int main()
{
int N;
cin>>N;
while(N--)
{
string s1, s2;
cin>>s1>>s2;
int sum =0;
for(int i=0;i for(int j=0;j sum += (s1.at(i)-'0')*(s2.at(j)-'0');
cout< }
return 0;
}

盗梦空间 nyoj 125
[cpp]
#include
#include
using namespace std;
int main()
{
int N;
cin>>N;
while(N--)
{
string str;
int m, second=0, div=1;
cin>>m;
while(m--)
{
cin>>str;
if(str == "IN")
div *= 20;
else if(str == "STAY")
{
int stay;
cin>>stay;
second += (stay * 60) / div;
}
else
div /= 20;
}
cout< }
return 0;
}

小明求素数积 nyoj 225
[cpp]
#include
using namespace std;
int prime[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009};
int main()
{
int N, m, num;
cin>>N;
while(N--)
{
cin>>m;
num = 1;
for(int i=0;prime[i]<=m;i++)
{
num *= prime[i];
num %= 1000000;
}
cout< }
return 0;
}

玩转矩阵的C小加 nyoj 261
[cpp]
#include
using namespace std;
int main()
{
int N;
cin>>N;
while(N--)
{
int a[3][3];
cin>>a[0][0]>>a[0][1]>>a[0][2]>>a[1][0]>>a[1][1]>>a[1][2]>>a[2][0]>>a[2][1]>>a[2][2];
cout< }
return 0;
}
正三角形外接圆面积 nyoj 274
[cpp]
#include
using namespace std;
#define PI 3.1415926
int main()
{
int m;
cin>>m;
while(m--)
{
double s,a;
cin>>a;
s=PI*a*a/3.0;
cout.setf(ios_base::fixed);
cout.precision(2);
cout< }
return 0;
}

算菜价 nyoj 316
[cpp]
#include
int main()
{
double a,b,sum=0;
char c[20];
while(scanf("%s%lf%lf",c,&a,&b)!=EOF)
{
sum=sum+a*b;
}
printf("%.1lf\n",sum);
return 0;
}

猴子吃桃 nyoj 324
[cpp]
#include
using namespace std;
int main()
{
int N;
cin>>N;
while(N--)
{
int m;
cin>>m;

nyoj 可以直接写的简单题(二)