Submission #10306478
Source Code Expand
#pragma GCC optimize("Ofast") #include <cstdio> #include <cstdlib> #include <string> #include <algorithm> #include <iostream> #include <queue> #include <vector> #include <bitset> #include <cmath> #include <limits> #include <iostream> #include <map> #include <set> #include <tuple> #include <iomanip> #include <functional> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<int,ll> pil; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; template<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;} template<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;} #define bit(n,k) ( (n>>k)&1 ) //デバッグ template<class T> void Vout(vector<T> &V){ cout<<"\nstart\n"; const int sz=V.size(); for(int i=0;i<sz;i++){ cout<<i<<" "<<V[i]<<'\n'; } cout<<"end\n"<<endl; } template<class T> void VPout(vector<T> &V){ cout<<"\nstart\n"; const int sz=V.size(); for(int i=0;i<sz;i++){ cout<<i<<" "<<V[i].first<<" "<<V[i].second<<'\n'; } cout<<"end\n"<<endl; } //+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ //+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ //+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ constexpr int MAX=1<<30; constexpr ll INF=1LL<<62; constexpr int MOD=1e9+7; int dx[]={1,-1,0,0},dy[]={0,0,-1,1}; //__builtin_popcount(S); //#define int ll //vector<vector<int>> data(3, vector<int>(4)); //vector.resize(a,vector<int>(b,-1)); //vector<vector<vector<要素の型>>> 変数名(要素数1, vector<vector<要素の型>>(要素数2, vector<要素の型>(要素数3, 初期値))); signed main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout<<fixed<<setprecision(10); ll n;int K; cin>>n>>K; ll cnt[12]={}; ll sum=0; for(int i=1;i<=11;i++){ for(int k=1;k<=5;k++){ ll t=0; for(int j=0;j<3;j++){ for(int l=0;l<3;l++){ t+=(7*(i+j)+(k+l)-7); } } if(t%11==K) cnt[i]++; } sum+=cnt[i]; } ll ret=sum*(n/11); for(int i=1;i<=n%11;i++){ ret+=cnt[i]; } cout<<ret<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Calendar |
User | bin101 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2480 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 150 | 0 / 100 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Subtask1 | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub1_in8.txt, sub1_in9.txt |
Subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub1_in8.txt, sub1_in9.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt, sub2_in5.txt, sub2_in6.txt, sub2_in7.txt, sub2_in8.txt, sub2_in9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | WA | 1 ms | 256 KB |
sample_2.txt | WA | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sample_4.txt | AC | 1 ms | 256 KB |
sub1_in1.txt | AC | 1 ms | 256 KB |
sub1_in2.txt | WA | 1 ms | 256 KB |
sub1_in3.txt | AC | 1 ms | 256 KB |
sub1_in4.txt | WA | 1 ms | 256 KB |
sub1_in5.txt | WA | 1 ms | 256 KB |
sub1_in6.txt | WA | 1 ms | 256 KB |
sub1_in7.txt | WA | 1 ms | 256 KB |
sub1_in8.txt | WA | 1 ms | 256 KB |
sub1_in9.txt | WA | 1 ms | 256 KB |
sub2_in1.txt | WA | 1 ms | 256 KB |
sub2_in2.txt | WA | 1 ms | 256 KB |
sub2_in3.txt | WA | 1 ms | 256 KB |
sub2_in4.txt | WA | 1 ms | 256 KB |
sub2_in5.txt | WA | 1 ms | 256 KB |
sub2_in6.txt | WA | 1 ms | 256 KB |
sub2_in7.txt | WA | 1 ms | 256 KB |
sub2_in8.txt | WA | 1 ms | 256 KB |
sub2_in9.txt | AC | 1 ms | 256 KB |