| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 46021 | liusiyu | 四叶玫瑰数 | C++ | Accepted | 1 MS | 264 KB | 358 | 2024-04-22 20:51:46 |
#include<bits/stdc++.h> using namespace std; bool pd(int x){ int s4=0,s3=0,s2=0,s1=0; s4=x%10; s3=x%100/10; s2=x%1000/100; s1=x/1000; if(pow(s4,4)+pow(s3,4)+pow(s2,4)+pow(s1,4)==x) return 1; else return 0; } int main() { int n,m; cin>>n>>m; for(int i=n;i<=m;i++){ if(i<1000) continue; if(pd(i)) cout<<i<<" "; } return 0; }