PE 006 Sum square difference
2018-02-28 20:37
337 查看
题目链接:https://projecteuler.net/problem=6
按题意模拟即可
代码:#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ll A=0,B=0;
for(int i=1;i<=100;i++)
{
A+=1LL*i*i;
B+=i;
}
B*=B;
printf("%lld\n",B-A);
return 0;
}
按题意模拟即可
代码:#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ll A=0,B=0;
for(int i=1;i<=100;i++)
{
A+=1LL*i*i;
B+=i;
}
B*=B;
printf("%lld\n",B-A);
return 0;
}
相关文章推荐
- Project Euler 006 Sum square difference
- 6 Sum square difference - Project Euler
- (Problem 6)Sum square difference
- 【Project Euler】【Problem 6】Sum square difference
- (Problem 6)Sum square difference
- ProjectEuler编程之旅:6.Sum square difference
- Problem 6 Sum square difference (数学)
- Project Euler 6 Sum square difference
- (Problem 6)Sum square difference
- Sum square difference
- projecteuler---->problem=6----Sum square difference
- 欧拉计划(6)Sum square difference
- Project Euler Problem 6: Sum square difference
- Problem 6 Sum square difference
- 欧拉项目第六题 Sum square difference
- perfect squares find the least number of perfect square numbers (1, 4, 9, 16, ...) which sum to n
- Sum of Square Numbers
- uva 4965 - Sum the Square
- PE 439 Sum of sum of divisors | 51nod 1220 约数之和
- 【数论】 nefu 702 The minimum square sum