#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<cmath> using LL=long long; using namespace std; int n; LL sum; int main() { cin>>n; int p=0; for(int i=1;i<=n;i++) { p=i; while(p) { if(p%10==2) { sum+=i; break; } if(p%10==0) { sum+=i; break; } if(p%10==1) { sum+=i; break; } if(p%10==9) { sum+=i; break; } p/=10; } } cout<<sum; return 0; }
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using LL=long long;
using namespace std;
const LL N = 30190324;
LL sum[N];
const LL P=20190324;
int main()
{
sum[1]=1;
sum[2]=1;
sum[3]=1;
sum[4]=3;
sum[5]=5;
for(int i=5;i<=P+1;i++)
{
sum[i]=(sum[i-1]+sum[i-2]+sum[i-3])%10000;
}
cout<<sum[P];
return 0;
}
#include <iostream>
using namespace std;
const int N=10;
int arr[N];
int main()
{
arr[1]=97;
arr[2]=99;
arr[3]=99;
arr[4]=97;
arr[5]=98;
int sum=0;
for(int i=1;i<=5;i++)
{
sum+=arr[i];
}
cout<<sum;
return 0;
}
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char arr[26];
for(int i=1;i<=26;i++)
arr[i]=(char)(i+65-1);
int x=2019/26/26;
int y=2019/26%26;
int z=2019%26;
cout<<arr[x]<<arr[y]<<arr[z];
return 0;
}
所作题目来源是殷念念念念念-CSDN博客这位大佬,以及算法思路均是来源于此