201912-1
#include
using namespace std;
int skip[4];
bool judge(int n)
{
int t=0;
while(n&&t!=7)
{
t=n%10;
n/=10;
}
if(t==7) return true;
return false;
}
int main()
{
int n;
cin>>n;
int count=0;
int turn=0;
int i=1;
while(count<n)
{
if(i%7==0||judge(i))
skip[turn]++;
else count++;
turn=(turn+1)%4;
i++;
}
for(int i=0;i<4;i++)
cout<<skip[i]<<endl;
return 0;
}
2019-2(非原创）
#include
#include
using namespace std;
struct Node{
int x,y;
}node;
vectorG,V;
int ans[5];
int main(){
int n;
cin>>n;
for(int i = 0; i < n; i++){
cin>>node.x>>node.y;
G.push_back(node);
}
for(int i = 0; i < n; i++){
int count = 0;
for(int j = 0; j < n; j++){
if((G[i].x == G[j].x&&G[i].y-1 == G[j].y) || (G[i].x == G[j].x&&G[i].y+1 == G[j].y)
|| (G[i].x-1 == G[j].x&&G[i].y == G[j].y) || (G[i].x+1 == G[j].x&&G[i].y == G[j].y)){
count++;
}
if(count == 4) break;
}
if(count == 4){
V.push_back(G[i]);
}
}
for(int i = 0; i < V.size(); i++){
int count = 0;
for(int j = 0; j < G.size(); j++){
if((V[i].x-1 == G[j].x&&V[i].y-1 == G[j].y) || (V[i].x-1 == G[j].x&&V[i].y+1 == G[j].y)
|| (V[i].x+1 == G[j].x&&V[i].y-1 == G[j].y) || (V[i].x+1 == G[j].x&&V[i].y+1 == G[j].y)){
count++;
}
if(count == 4) break;
}
ans[count]++;
}
for(int i = 0; i < 5; i++){
cout<<ans[i]<<endl;
}
return 0;
}