未確認。あんさいんどろんぐろんぐなので後でとく。 #include<iostream> using namespace std; int main(){ unsigned long long int p=1; unsigned long long int n=0; for(int i=0;i<1000;i++) { p*=2; } cout<<p<<endl; while(p>0) { n+= p%10; p/=10; cout<</p<<endl;></iostream>

#include<iostream> using namespace std; int main(){ unsigned long int max=0; unsigned long int maxans=0; unsigned long int p=0; unsigned long int count=0; for(unsigned long int i=999999;i>=0;i--) { count=0; p=i; while(p!=1) { if(p%2==0) { p=p/2; cou</iostream>…

#include<iostream> using namespace std; int main(){ int num[100][50]; int buf[50]; int mod[50]; int ans[50]; char c; for(int i=0;i<100;i++) { for(int p=0;p<50;p++) { cin>>c; num[i][p]=c-'0'; buf[p]=0; mod[p]=0; ans[p]=0; } } for(int i=0;i<50;i++) { </iostream>…

#include <iostream> #include <math.h> using namespace std; int main(){ int sq=0; int count=0; int prv=0; for(long long int i=1;i<100000000000000000;i++) { sq+=i; if( sqrt((double)sq) - floor(sqrt((double)sq))==0.0) count--; for(int n=1; n<=sq; n++ ) { if(sq</math.h></iostream>…

斜めって2方向あるんですよ奥さん。 In the 2020 grid below, four numbers along a diagonal line have been marked in red.08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81…

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million. #include <iostream> #include <math.h> using namespace std; long long int prime[1000000]; long long int table[100000000]; int primeCall(){ int flag=0; prim</math.h></iostream>…